HackerRank solutions in Java/JS/Python/C++/C#
Solutions to problems on HackerRank.
Check out HackerRank's new format here
If you are interested in helping or have a solution in a different language feel free to make a pull request.| # | Title | Solution | Time | Space | Difficulty | Points | Note |
|---|---|---|---|---|---|---|---|
| Solve Me First |
| O(1) | O(1)| Easy | 1 | || | |Simple Array Sum|
| O(n) | O(1) | Easy | 10 | || | |Compare the Triplets|
| O(1) | O(1) | Easy | 10 | || | |A Very Big Sum|
| O(n) | O(1) | Easy | 10 | || | |Diagonal Difference|
| O(n) | O(1) | Easy | 10 | || | |Plus Minus|
| O(n) | O(1) | Easy | 10 | || | |Staircase|
| O(n) | O(n) | Easy | 10 | || | |Mini-Max Sum|
| O(1) | O(1) | Easy | 10 | || | |Time Conversion|
| O(1) | O(1) | Easy | 15 | || | |Birthday Cake Candles|
| O(n) | O(1) | Easy | 10 | ||
| # | Title | Solution | Time | Space | Difficulty | Points | Note |
|---|---|---|---|---|---|---|---|
| Grading Students |
| O(n) | O(1) | Easy| 10| || | | Apple and Orange|
| O(n+m) | O(1) | Easy| 10| || | | Kangaroo|
| O(1) | O(1) | Easy| 10| || | | Between Two Sets|
| O(x(n+m)) | O(1) | Easy| 10| x=(max(m) - min(n))/min(n) || | | Divisible Sum Pairs|
| O(n^2) | O(1) | Easy| 10| || | | Birthday Chocolate|
| O(n) | O(1) | Easy| 10| || | | Breaking the Records|
| O(n) | O(1) | Easy| 10| || | | Migratory Birds|
| O(n) | O(1) | Easy| 10| || | | Day of the Programmer|
| O(1) | O(1) | Easy| 15| || | | Bon Appetit|
| O(n) | O(1) | Easy| 10| || | | Sock Merchant|
| O(n) | O(n) | Easy| 10| || | | Drawing Book|
| O(1) | O(1) | Easy| 10| || | | Counting Valleys|
| O(n) | O(1) | Easy| 15| || | | Cats and a Mouse|
| O(1) | O(1) | Easy| 15| || | | Electronics Shop|
| O(n log (n)) | O(1) | Easy| 15| n = m+n|| | | Picking Numbers|
| O(n) | O(n) | Easy| 20| || | | Climbing the Leaderboard|
| O(n+m) | (n) | Easy| 20| || | | The Hurdle Race|
| O(n) | O(1) | Easy| 15| || | | Designer PDF Viewer|
| O(n) | O(n) | Easy| 20| || | | Forming a Magic Square|
| O(1) | O(1) | Easy| 20| || | | Utopian Tree|
| O(n) | O(1) | Easy | 20| || | | Angry Professor|
| O(n) | O(1) | Easy | 20| || | | Beautiful Days at the Movies|
| O(n) | O(1) | Easy | 15| || | | Viral Advertising|
[JS](
No open issues yet, or sync has not completed.