• 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

Stock Buy Sell to Maximize Profit

Daughter’s Age VeryGood Puzzle

Code Chef PRGIFT Solution

Linked List V/S Binary Search Tree

Maximum of all subarrays of size k

Common Ancestor in a Binary Tree or Binary Search Tree

SAP Off Campus Hiring_ March 2015 Computer Skills

LeetCode: Binary Tree Maximum Path Sum

Cisco Hiring Event 21st – 22nd Feb 2015

C++ OOPs Part1

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

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Right view of Binary tree

The greedy coins game Dynamic Programming

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Amazon Interview Experience – SDE Chennai

flattens 2 D linked list to a single sorted link list

Find Nearest Minimum number in left side in O(n)

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Find the element that appears once others appears thrice

Naurki.com Security Breach

Binary Tree in Java

Sequence Finder Dynamic Programming

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Given Set of words or A String find whether chain is possible from these words or not

Maximum size of square sub matrix with all 1’s in a binary matrix

Find if a binary tree is height balanced ?

Word Break Problem

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Find next greater number with same set of digits

Copyright © 2025 · Genesis Framework · WordPress · Log in