• 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

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

LeetCode : Word Search

The Magic HackerEarth Nirvana solutions Hiring Challenge

Search element in a matrix with all rows and columns in sorted order

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

Introduction To Number Theory ( Part 1 )

Mirror of Tree

Leetcode: Merge Intervals

Generic Object Oriented Stack with Template

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

SAP Off Campus Hiring_ March 2015 Sample Questions

Find the number ABCD such that when multipled by 4 gives DCBA.

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

Walmart Labs Interview Experience

Find min element in Sorted Rotated Array (Without Duplicates)

Number of Islands BFS/DFS

VMWare SDEII Interview

BlueStone E-commerce Interview Experience

ADOBE Aptitude C Language Test

DFS (Depth First Search)

Printing Longest Common Subsequence

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

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Word Break Problem

Code Chef PRGIFT Solution

Amazon Interview Experience – SDE Chennai

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

Apriori algorithm C Code Data Mining

Find Percentage of Words matching in Two Strings

Longest Increasing Subsequence

Copyright © 2025 · Genesis Framework · WordPress · Log in