https://github.com/zsarge/mayinteralliancecodegolf

https://mailchi.mp/interalliance/coding-challenge-submit-by-may-1st?e=679d1cddb7
https://github.com/zsarge/mayinteralliancecodegolf

code-golf codegolf python27 ruby

Last synced: 6 days ago
JSON representation

https://mailchi.mp/interalliance/coding-challenge-submit-by-may-1st?e=679d1cddb7

• Host: GitHub
• URL: https://github.com/zsarge/mayinteralliancecodegolf
• Owner: zsarge
• License: mit
• Archived: true
• Created: 2020-04-27T15:17:44.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2020-05-08T01:19:54.000Z (over 5 years ago)
• Last Synced: 2024-09-28T16:40:55.907Z (about 1 year ago)
• Topics: code-golf, codegolf, python27, ruby
• Language: Python
• Homepage:
• Size: 10.7 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# MayInterallianceCodeGolf

[![Maintenance](https://img.shields.io/badge/Maintained%3F-no-red.svg)](https://bitbucket.org/lbesson/ansi-colors)

[![made-with-python](https://img.shields.io/badge/Made%20with-Python-1f425f.svg)](https://www.python.org/)

[The Flyer for this Challenge](https://web.archive.org/web/20200427151501/https://mailchi.mp/interalliance/coding-challenge-submit-by-may-1st?e=679d1cddb7#)

For an award of a $10 Chipotle Gift Card, you can choose between two coding challenges:

1) Using any coding language, write a program that prints the next 20 leap years

2) Using any language, write a program that automatically converts English text to Morse Code.

Fewest *lines* wins.

Due: **May/1/2020 @ 11:59 PM**

Assuming that I can only submit one program, I have chosen the leap year problem, because I don't have to store any English/Morse Code dictionaries and thus have a higher potential for fewer bytes.

Additionally, I talked with a friend, and we both believe that this is assuming pretty print style. Otherwise languages without mandatory indentation would win no matter what.

My goal: Try to solve the problem in the fewest bytes. 

-------------

Update: I won