An open API service indexing awesome lists of open source software.

https://github.com/rsha256/shortest-fizzbuzz

Contains shortest solutions to fizzbuzz in various programming languages
https://github.com/rsha256/shortest-fizzbuzz

fizzbuzz hacktober hacktoberfest hacktoberfest2020 open-source

Last synced: 3 months ago
JSON representation

Contains shortest solutions to fizzbuzz in various programming languages

Awesome Lists containing this project

README

          

# shortest-fizzbuzz
#### Contains shortest solutions to fizzbuzz in various programming languages

** **

## Rules:
"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”."
To learn more and see clean versions, see: https://wiki.c2.com/?FizzBuzzTest

** **

## Languages:
- [C](C.c), 95 bytes
- [C++](C++.cpp), 231 bytes
- [Dart](Dart.dart), 124 bytes
- [Elm](Elm.elm), 297 bytes
- [Go](Go.go), 134 bytes
- [Haskell](Haskell.hs), 113 bytes
- [Java](Java.java), 106 bytes
- [JavaScript](JavaScript.js), 64 bytes
- [Perl6](Perl6.pl), 54 bytes
- [PHP](PHP.php), 68 bytes
- [Python2](Python2.py), 59 bytes
- [Python3](Python3.py), 61 bytes
- [R](R.R),110 bytes
- [Ruby](Ruby.rb), 69 bytes
- [Rust](Rust.rs), 115 bytes
- [Scheme](Scheme.scm), 433 bytes
- [Swift](Swift.swift), 578 bytes

## Contributing:
1. Alphabetically add your addition here to [README.md](README.md) in the format `[](), bytes`. GitHub tells you the number of **bytes** for any file.
2. Add a file to the root of the repo in the form of: `.` that satisfies the rules above.

## Notes:
Try to write a detailed commit message.

If possible make sure you end your file with a newline at the end and are using LF as opposed to CRLF Line sequences.

Feel free to improve on existing solutions if you can do better :)