Efficient solutions to problems on HackerRank written in C#
| Title | Solution | Difficulty | Points | Time | Space |
|---|---|---|---|---|---|
| Solve Me First | C# | Easy | 1 | O(1) | O(1) |
| Simple Array Sum | C# | Easy | 10 | O(n) | O(1) |
| Compare the Triplets | C# | Easy | 10 | O(n) | O(1) |
| A Very Big Sum | C# | Easy | 10 | O(n) | O(1) |
| Diagonal Difference | C# | Easy | 10 | O(n) | O(1) |
| Plus Minus | C# | Easy | 10 | O(n) | O(1) |
| Staircase | C# | Easy | 10 | O(n) | O(1) |
| Mini-Max Sum | C# | Easy | 10 | O(n) | O(1) |
| Birthday Cake Candles | C# | Easy | 10 | O(n) | O(1) |
| Time Conversion | C# | Easy | 10 | O(1) | O(1) |
| Grading Students | C# | Easy | 10 | O(n) | O(1) |
| Apple and Orange | C# | Easy | 10 | O(n) | O(1) |
| Number of Line Jumps | C# | Easy | 10 | O(1) | O(1) |
| Between Two Sets | C# | Easy | 10 | O(n*logn) | O(1) |
| Breaking the Records | C# | Easy | 10 | O(n) | O(1) |
| Subarray Division | C# | Easy | 10 | O(n) | O(1) |
| Divisible Sum Pairs | C# | Easy | 10 | O(n) | O(n) |
| Migratory Birds | C# | Easy | 10 | O(n) | O(1) |
| Day of the Programmer | C# | Easy | 15 | O(1) | O(1) |
| Bill Division | C# | Easy | 10 | O(n) | O(1) |
| Sales by Match | C# | Easy | 10 | O(n) | O(n) |
| Drawing Book | C# | Easy | 10 | O(1) | O(1) |
| Counting Valleys | C# | Easy | 15 | O(n) | O(1) |
| Electronics Shop | C# | Easy | 15 | O(n^2) | O(1) |
| Cats and a Mouse | C# | Easy | 15 | O(1) | O(1) |
| Forming a Magic Square | C# | Medium | 20 | O(n) | O(1) |
| Picking Numbers | C# | Easy | 20 | O(n) | O(n) |
| Climbing the Leaderboard | C# | Medium | 20 | O(n*logn) | O(n) |
| The Hurdle Race | C# | Easy | 15 | O(n) | O(1) |
| Designer PDF Viewer | C# | Easy | 20 | O(n) | O(1) |
| Utopian Tree | C# | Easy | 20 | O(1) | O(1) |
| Angry Professor | C# | Easy | 20 | O(n) | O(1) |
| Beautiful Days at the Movies | C# | Easy | 15 | O(n) | O(1) |
| Viral Advertising | C# | Easy | 15 | O(n) | O(1) |
| Save the Prisoner! | C# | Easy | 15 | O(1) | O(1) |
| Circular Array Rotation | C# | Easy | 20 | O(n) | O(1) |
| Sequence Equation | C# | Easy | 20 | O(n) | O(n) |
| Jumping on the Clouds: Revisited | C# | Easy | 15 | O(n) | O(1) |
| Find Digits | C# | Easy | 25 | O(logn) | O(1) |
| Extra Long Factorials | C# | Medium | 20 | O(n) | O(1) |
| Append and Delete | C# | Easy | 20 | O(1) | O(1) |
| Sherlock and Squares | C# | Easy | 20 | O(n) | O(1) |
| Library Fine | C# | Easy | 15 | O(1) | O(1) |
| Cut the sticks | C# | Easy | 20 | O(n*logn) | O(n) |
| Non-Divisible Subset | C# | Medium | 20 | O(n) | O(n) |
| Repeated String | C# | Easy | 20 | O(1) | O(1) |
| Jumping on the Clouds | C# | Easy | 20 | O(n) | O(1) |
| Equalize the Array | C# | Easy | 20 | O(n) | O(n) |
| Queen's Attack II | C# | Medium | 30 | O(n) | O(n) |
| ACM ICPC Team | C# | Easy | 25 | O(n^2) | O(1) |
| Taum and B'day | C# | Easy | 25 | O(1) | O(1) |
| Organizing Containers of Balls | C# | Medium | 30 | O(n) | O(n) |
| Encryption | C# | Medium | 30 | O(n) | O(n) |
| Bigger is Greater | C# | Medium | 35 | O(n) | O(1) |
| Modified Kaprekar Numbers | C# | Easy | 30 | O(n) | O(n) |
| Beautiful Triplets | C# | Easy | 20 | O(n) | O(n) |
| Minimum Distances | C# | Easy | 20 | O(n) | O(n) |
| Halloween Sale | C# | Easy | 20 | O(n) | O(1) |
| The Time in Words | C# | Medium | 25 | O(1) | O(1) |
| Chocolate Feast | C# | Easy | 25 | O(n) | O(1) |
| Service Lane | C# | Easy | 20 | O(n) | O(1) |
| Lisa's Workbook | C# | Easy | 25 | O(n) | O(1) |
| Flatland Space Stations | C# | Easy | 25 | O(n) | O(n) |
| Fair Rations | C# | Easy | 25 | O(n) | O(1) |
| Cavity Map | C# | Easy | 30 | O(n^2) | O(1) |
| Manasa and Stones | C# | Easy | 30 | O(n) | O(n) |
| The Grid Search | C# | Medium | 30 | O(n^2) | O(1) |
| Happy Ladybugs | C# | Easy | 30 | O(n) | O(n) |
| Strange Counter | C# | Easy | 30 | O(1) | O(1) |
| 3D Surface Area | C# | Medium | 30 | O(n^2) | O(1) |
| Absolute Permutation | C# | Medium | 40 | O(1) | O(1) |
| The Bomberman Game | C# | Medium | 40 | O(n) | O(1) |
| Larry's Array | C# | Medium | 40 | O(n^2) | O(1) |
| Almost Sorted | C# | Medium | 50 | O(n*logn) | O(n) |
| Matrix Layer Rotation | C# | Hard | 80 | O(n) | O(1) |
| Big Sorting | C# | Easy | 20 | O(n*logn) | O(n) |
| Super Reduced String | C# | Easy | 10 | O(n) | O(1) |
| Intro to Tutorial Challenges | C# | Easy | 30 | O(logn) | O(1) |