• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

FizzBuzz Solution C C++

May 19, 2015 by Dhaval Dave

Write a program that prints the numbers from 1 to 100. But for multiples of three print “Fizz” instead of the number and for the multiples of five print “Buzz”. For numbers which are multiples of both three and five print “FizzBuzz”. Print a new line after each string or number.
Here is C and C++ solutions

Fizz Buzz C Solution :

#include <stdio.h>
#define gc getchar_unlocked
#define pc putchar_unlocked
inline int scan(){register int n=0,c=gc();while(c<'0'||c>'9')c=gc();while(c<='9'&&c>='0')n=(n<<1)+(n<<3)+c-'0',c=gc();return n;} 
int printFB(int n){
 int i,j;
 for(i=1;i<=n;i++){
  if(i%3==0 && i%5==0)printf("FizzBuzz\n");
  else if(i%3==0)printf("Fizz\n");
  else if(i%5==0)printf("Buzz\n");
  else printf("%d\n",i);
  }
}
int main(void) {
 int t,n;
 t=scan();
   while(t--){
   n=scan();
   printFB(n);
   }
 return 0;
}

Fizz Buzz C++ Solution

#include <iostream>
using namespace std;
 
int main()
{
 int T,num, i=1;;
 cin >> T;
   while(T > 0) {
   cin>>num;
   cout<<"number="<<num<<"T="<<T<<endl;
   i=1;
      while(i<=num){
      if( i%15 == 0) {
      cout << "FizzBuzz" << endl; 
      }
      else if(i%5 == 0 ){
      cout << "Buzz" << endl; 
      }
      else if(i%3 == 0) {
      cout << "Fizz" << endl;
      }
       else {
       cout<<i<< endl;
       }
   i++;
   }
 T--;
 }
return 0;
}

Similar Articles

Filed Under: Adobe Interview Questions, Hacker Earth Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: c, Mathematical

Reader Interactions

Trackbacks

  1. Urban Ladder Written Test. - GoHired says:
    May 19, 2015 at 7:44 pm

    […] 1 ) Print Fizz Buzz  […]

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Closed Parentheses checker

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Walmart Labs Interview Experience

Print Power Set of a Set

Find if a binary tree is height balanced ?

Implement a generic binary search algorithm for Integer Double String etc

Minimum insertions to form a palindrome

Find the kth number with prime factors 3, 5 and 7

Given a float number convert it into the string WITHOUT using any inbuilt Function

Maximum difference between two elements s.t larger element appears after the smaller number

Skiing on Mountains Matrix

System Design: Designing a LLD for Hotel Booking

SAP Hiring Off-Campus General Aptitude

HackeEarth Flipkart’s Drone

Get Minimum element in O(1) from input numbers or Stack

Edit Distance ( Dynamic Programming )

Adobe Interview Questions 8 month Exp

Binary Tree in Java

Maximum occurred Smallest integer in n ranges

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Given a string, find the first character which is non-repetitive

Amazon Interview Experience – SDE Chennai

Find and print longest consecutive number sequence in a given sequence in O(n)

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Leetcode: Edit Distance

Coin Collection Dynamic Programming

Daughter’s Age VeryGood Puzzle

VMWare SDEII Interview

Common Ancestor in a Binary Tree or Binary Search Tree

Copyright © 2026 · Genesis Framework · WordPress · Log in