{"id":20082481,"url":"https://github.com/nemruddemir/hackerrank","last_synced_at":"2025-05-06T01:30:22.338Z","repository":{"id":209089001,"uuid":"220966475","full_name":"NemrudDemir/HackerRank","owner":"NemrudDemir","description":"HackerRank Solutions C#","archived":false,"fork":false,"pushed_at":"2023-03-26T02:06:48.000Z","size":1358,"stargazers_count":23,"open_issues_count":0,"forks_count":7,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-09T06:25:17.209Z","etag":null,"topics":["hackathon","hackerrank","hackerrank-csharp","hackerrank-solutions"],"latest_commit_sha":null,"homepage":"","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/NemrudDemir.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-11-11T11:29:10.000Z","updated_at":"2025-01-15T09:56:27.000Z","dependencies_parsed_at":null,"dependency_job_id":"2f072ec6-4771-42ad-a46f-d4386ff93a1b","html_url":"https://github.com/NemrudDemir/HackerRank","commit_stats":null,"previous_names":["nemruddemir/hackerrank"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NemrudDemir%2FHackerRank","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NemrudDemir%2FHackerRank/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NemrudDemir%2FHackerRank/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NemrudDemir%2FHackerRank/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/NemrudDemir","download_url":"https://codeload.github.com/NemrudDemir/HackerRank/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252604104,"owners_count":21775049,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["hackathon","hackerrank","hackerrank-csharp","hackerrank-solutions"],"created_at":"2024-11-13T15:43:37.384Z","updated_at":"2025-05-06T01:30:22.331Z","avatar_url":"https://github.com/NemrudDemir.png","language":"C#","readme":"\u003cp align=\"center\"\u003e\n    \u003ca href=\"https://www.hackerrank.com/nemrud_demir\"\u003e\n        \u003cimg height=85 src=\"./Resources/hackerrank_logo.svg\"\u003e\n    \u003c/a\u003e\n    \u003cbr\u003e\n    Efficient solutions to problems on HackerRank written in C#\n\u003c/p\u003e\n\n## Problem Solving\n* [Algorithms](#Algorithms)\n\n### Algorithms\n| Title             | Solution  | Difficulty                    | Points| Time  | Space\n|-------------------|:---------:|:-----------------------------:|------:|:-----:|:-:\n[Solve Me First](./Problem%20Solving/Algorithms/Solve%20Me%20First)|[C#](./Problem%20Solving/Algorithms/Solve%20Me%20First/Solution.cs)|Easy|1|O(1)|O(1)\n[Simple Array Sum](./Problem%20Solving/Algorithms/Simple%20Array%20Sum)|[C#](./Problem%20Solving/Algorithms/Simple%20Array%20Sum/Solution.cs)|Easy|10|O(n)|O(1)\n[Compare the Triplets](./Problem%20Solving/Algorithms/Compare%20the%20Triplets)|[C#](./Problem%20Solving/Algorithms/Compare%20the%20Triplets/Solution.cs)|Easy|10|O(n)|O(1)\n[A Very Big Sum](./Problem%20Solving/Algorithms/A%20Very%20Big%20Sum)|[C#](./Problem%20Solving/Algorithms/A%20Very%20Big%20Sum/Solution.cs)|Easy|10|O(n)|O(1)\n[Diagonal Difference](./Problem%20Solving/Algorithms/Diagonal%20Difference)|[C#](./Problem%20Solving/Algorithms/Diagonal%20Difference/Solution.cs)|Easy|10|O(n)|O(1)\n[Plus Minus](./Problem%20Solving/Algorithms/Plus%20Minus)|[C#](./Problem%20Solving/Algorithms/Plus%20Minus/Solution.cs)|Easy|10|O(n)|O(1)\n[Staircase](./Problem%20Solving/Algorithms/Staircase)|[C#](./Problem%20Solving/Algorithms/Staircase/Solution.cs)|Easy|10|O(n)|O(1)\n[Mini-Max Sum](./Problem%20Solving/Algorithms/Mini-Max%20Sum)|[C#](./Problem%20Solving/Algorithms/Mini-Max%20Sum/Solution.cs)|Easy|10|O(n)|O(1)\n[Birthday Cake Candles](./Problem%20Solving/Algorithms/Birthday%20Cake%20Candles)|[C#](./Problem%20Solving/Algorithms/Birthday%20Cake%20Candles/Solution.cs)|Easy|10|O(n)|O(1)\n[Time Conversion](./Problem%20Solving/Algorithms/Time%20Conversion)|[C#](./Problem%20Solving/Algorithms/Time%20Conversion/Solution.cs)|Easy|10|O(1)|O(1)\n[Grading Students](./Problem%20Solving/Algorithms/Grading%20Students)|[C#](./Problem%20Solving/Algorithms/Grading%20Students/Solution.cs)|Easy|10|O(n)|O(1)\n[Apple and Orange](./Problem%20Solving/Algorithms/Apple%20and%20Orange)|[C#](./Problem%20Solving/Algorithms/Apple%20and%20Orange/Solution.cs)|Easy|10|O(n)|O(1)\n[Number of Line Jumps](./Problem%20Solving/Algorithms/Number%20of%20Line%20Jumps)|[C#](./Problem%20Solving/Algorithms/Number%20of%20Line%20Jumps/Solution.cs)|Easy|10|O(1)|O(1)\n[Between Two Sets](./Problem%20Solving/Algorithms/Between%20Two%20Sets)|[C#](./Problem%20Solving/Algorithms/Between%20Two%20Sets/Solution.cs)|Easy|10|O(n*logn)|O(1)\n[Breaking the Records](./Problem%20Solving/Algorithms/Breaking%20the%20Records)|[C#](./Problem%20Solving/Algorithms/Breaking%20the%20Records/Solution.cs)|Easy|10|O(n)|O(1)\n[Subarray Division](./Problem%20Solving/Algorithms/Subarray%20Division)|[C#](./Problem%20Solving/Algorithms/Subarray%20Division/Solution.cs)|Easy|10|O(n)|O(1)\n[Divisible Sum Pairs](./Problem%20Solving/Algorithms/Divisible%20Sum%20Pairs)|[C#](./Problem%20Solving/Algorithms/Divisible%20Sum%20Pairs/Solution.cs)|Easy|10|O(n)|O(n)\n[Migratory Birds](./Problem%20Solving/Algorithms/Migratory%20Birds)|[C#](./Problem%20Solving/Algorithms/Migratory%20Birds/Solution.cs)|Easy|10|O(n)|O(1)\n[Day of the Programmer](./Problem%20Solving/Algorithms/Day%20of%20the%20Programmer)|[C#](./Problem%20Solving/Algorithms/Day%20of%20the%20Programmer/Solution.cs)|Easy|15|O(1)|O(1)\n[Bill Division](./Problem%20Solving/Algorithms/Bill%20Division)|[C#](./Problem%20Solving/Algorithms/Bill%20Division/Solution.cs)|Easy|10|O(n)|O(1)\n[Sales by Match](./Problem%20Solving/Algorithms/Sales%20by%20Match)|[C#](./Problem%20Solving/Algorithms/Sales%20by%20Match/Solution.cs)|Easy|10|O(n)|O(n)\n[Drawing Book](./Problem%20Solving/Algorithms/Drawing%20Book)|[C#](./Problem%20Solving/Algorithms/Drawing%20Book/Solution.cs)|Easy|10|O(1)|O(1)\n[Counting Valleys](./Problem%20Solving/Algorithms/Counting%20Valleys)|[C#](./Problem%20Solving/Algorithms/Counting%20Valleys/Solution.cs)|Easy|15|O(n)|O(1)\n[Electronics Shop](./Problem%20Solving/Algorithms/Electronics%20Shop)|[C#](./Problem%20Solving/Algorithms/Electronics%20Shop/Solution.cs)|Easy|15|O(n^2)|O(1)\n[Cats and a Mouse](./Problem%20Solving/Algorithms/Cats%20and%20a%20Mouse)|[C#](./Problem%20Solving/Algorithms/Cats%20and%20a%20Mouse/Solution.cs)|Easy|15|O(1)|O(1)\n[Forming a Magic Square](./Problem%20Solving/Algorithms/Forming%20a%20Magic%20Square)|[C#](./Problem%20Solving/Algorithms/Forming%20a%20Magic%20Square/Solution.cs)|Medium|20|O(n)|O(1)\n[Picking Numbers](./Problem%20Solving/Algorithms/Picking%20Numbers)|[C#](./Problem%20Solving/Algorithms/Picking%20Numbers/Solution.cs)|Easy|20|O(n)|O(n)\n[Climbing the Leaderboard](./Problem%20Solving/Algorithms/Climbing%20the%20Leaderboard)|[C#](./Problem%20Solving/Algorithms/Climbing%20the%20Leaderboard/Solution.cs)|Medium|20|O(n*logn)|O(n)\n[The Hurdle Race](./Problem%20Solving/Algorithms/The%20Hurdle%20Race)|[C#](./Problem%20Solving/Algorithms/The%20Hurdle%20Race/Solution.cs)|Easy|15|O(n)|O(1)\n[Designer PDF Viewer](./Problem%20Solving/Algorithms/Designer%20PDF%20Viewer)|[C#](./Problem%20Solving/Algorithms/Designer%20PDF%20Viewer/Solution.cs)|Easy|20|O(n)|O(1)\n[Utopian Tree](./Problem%20Solving/Algorithms/Utopian%20Tree)|[C#](./Problem%20Solving/Algorithms/Utopian%20Tree/Solution.cs)|Easy|20|O(1)|O(1)\n[Angry Professor](./Problem%20Solving/Algorithms/Angry%20Professor)|[C#](./Problem%20Solving/Algorithms/Angry%20Professor/Solution.cs)|Easy|20|O(n)|O(1)\n[Beautiful Days at the Movies](./Problem%20Solving/Algorithms/Beautiful%20Days%20at%20the%20Movies)|[C#](./Problem%20Solving/Algorithms/Beautiful%20Days%20at%20the%20Movies/Solution.cs)|Easy|15|O(n)|O(1)\n[Viral Advertising](./Problem%20Solving/Algorithms/Viral%20Advertising)|[C#](./Problem%20Solving/Algorithms/Viral%20Advertising/Solution.cs)|Easy|15|O(n)|O(1)\n[Save the Prisoner!](./Problem%20Solving/Algorithms/Save%20the%20Prisoner!)|[C#](./Problem%20Solving/Algorithms/Save%20the%20Prisoner!/Solution.cs)|Easy|15|O(1)|O(1)\n[Circular Array Rotation](./Problem%20Solving/Algorithms/Circular%20Array%20Rotation)|[C#](./Problem%20Solving/Algorithms/Circular%20Array%20Rotation/Solution.cs)|Easy|20|O(n)|O(1)\n[Sequence Equation](./Problem%20Solving/Algorithms/Sequence%20Equation)|[C#](./Problem%20Solving/Algorithms/Sequence%20Equation/Solution.cs)|Easy|20|O(n)|O(n)\n[Jumping on the Clouds: Revisited](./Problem%20Solving/Algorithms/Jumping%20on%20the%20Clouds%20Revisited)|[C#](./Problem%20Solving/Algorithms/Jumping%20on%20the%20Clouds%20Revisited/Solution.cs)|Easy|15|O(n)|O(1)\n[Find Digits](./Problem%20Solving/Algorithms/Find%20Digits)|[C#](./Problem%20Solving/Algorithms/Find%20Digits/Solution.cs)|Easy|25|O(logn)|O(1)\n[Extra Long Factorials](./Problem%20Solving/Algorithms/Extra%20Long%20Factorials)|[C#](./Problem%20Solving/Algorithms/Extra%20Long%20Factorials/Solution.cs)|Medium|20|O(n)|O(1)\n[Append and Delete](./Problem%20Solving/Algorithms/Append%20and%20Delete)|[C#](./Problem%20Solving/Algorithms/Append%20and%20Delete/Solution.cs)|Easy|20|O(1)|O(1)\n[Sherlock and Squares](./Problem%20Solving/Algorithms/Sherlock%20and%20Squares)|[C#](./Problem%20Solving/Algorithms/Sherlock%20and%20Squares/Solution.cs)|Easy|20|O(n)|O(1)\n[Library Fine](./Problem%20Solving/Algorithms/Library%20Fine)|[C#](./Problem%20Solving/Algorithms/Library%20Fine/Solution.cs)|Easy|15|O(1)|O(1)\n[Cut the sticks](./Problem%20Solving/Algorithms/Cut%20the%20sticks)|[C#](./Problem%20Solving/Algorithms/Cut%20the%20sticks/Solution.cs)|Easy|20|O(n*logn)|O(n)\n[Non-Divisible Subset](./Problem%20Solving/Algorithms/Non-Divisible%20Subset)|[C#](./Problem%20Solving/Algorithms/Non-Divisible%20Subset/Solution.cs)|Medium|20|O(n)|O(n)\n[Repeated String](./Problem%20Solving/Algorithms/Repeated%20String)|[C#](./Problem%20Solving/Algorithms/Repeated%20String/Solution.cs)|Easy|20|O(1)|O(1)\n[Jumping on the Clouds](./Problem%20Solving/Algorithms/Jumping%20on%20the%20Clouds)|[C#](./Problem%20Solving/Algorithms/Jumping%20on%20the%20Clouds/Solution.cs)|Easy|20|O(n)|O(1)\n[Equalize the Array](./Problem%20Solving/Algorithms/Equalize%20the%20Array)|[C#](./Problem%20Solving/Algorithms/Equalize%20the%20Array/Solution.cs)|Easy|20|O(n)|O(n)\n[Queen's Attack II](./Problem%20Solving/Algorithms/Queen's%20Attack%20II)|[C#](./Problem%20Solving/Algorithms/Queen's%20Attack%20II/Solution.cs)|Medium|30|O(n)|O(n)\n[ACM ICPC Team](./Problem%20Solving/Algorithms/ACM%20ICPC%20Team)|[C#](./Problem%20Solving/Algorithms/ACM%20ICPC%20Team/Solution.cs)|Easy|25|O(n^2)|O(1)\n[Taum and B'day](./Problem%20Solving/Algorithms/Taum%20and%20B'day)|[C#](./Problem%20Solving/Algorithms/Taum%20and%20B'day/Solution.cs)|Easy|25|O(1)|O(1)\n[Organizing Containers of Balls](./Problem%20Solving/Algorithms/Organizing%20Containers%20of%20Balls)|[C#](./Problem%20Solving/Algorithms/Organizing%20Containers%20of%20Balls/Solution.cs)|Medium|30|O(n)|O(n)\n[Encryption](./Problem%20Solving/Algorithms/Encryption)|[C#](./Problem%20Solving/Algorithms/Encryption/Solution.cs)|Medium|30|O(n)|O(n)\n[Bigger is Greater](./Problem%20Solving/Algorithms/Bigger%20is%20Greater)|[C#](./Problem%20Solving/Algorithms/Bigger%20is%20Greater/Solution.cs)|Medium|35|O(n)|O(1)\n[Modified Kaprekar Numbers](./Problem%20Solving/Algorithms/Modified%20Kaprekar%20Numbers)|[C#](./Problem%20Solving/Algorithms/Modified%20Kaprekar%20Numbers/Solution.cs)|Easy|30|O(n)|O(n)\n[Beautiful Triplets](./Problem%20Solving/Algorithms/Beautiful%20Triplets)|[C#](./Problem%20Solving/Algorithms/Beautiful%20Triplets/Solution.cs)|Easy|20|O(n)|O(n)\n[Minimum Distances](./Problem%20Solving/Algorithms/Minimum%20Distances)|[C#](./Problem%20Solving/Algorithms/Minimum%20Distances/Solution.cs)|Easy|20|O(n)|O(n)\n[Halloween Sale](./Problem%20Solving/Algorithms/Halloween%20Sale)|[C#](./Problem%20Solving/Algorithms/Halloween%20Sale/Solution.cs)|Easy|20|O(n)|O(1)\n[The Time in Words](./Problem%20Solving/Algorithms/The%20Time%20in%20Words)|[C#](./Problem%20Solving/Algorithms/The%20Time%20in%20Words/Solution.cs)|Medium|25|O(1)|O(1)\n[Chocolate Feast](./Problem%20Solving/Algorithms/Chocolate%20Feast)|[C#](./Problem%20Solving/Algorithms/Chocolate%20Feast/Solution.cs)|Easy|25|O(n)|O(1)\n[Service Lane](./Problem%20Solving/Algorithms/Service%20Lane)|[C#](./Problem%20Solving/Algorithms/Service%20Lane/Solution.cs)|Easy|20|O(n)|O(1)\n[Lisa's Workbook](./Problem%20Solving/Algorithms/Lisa's%20Workbook)|[C#](./Problem%20Solving/Algorithms/Lisa's%20Workbook/Solution.cs)|Easy|25|O(n)|O(1)\n[Flatland Space Stations](./Problem%20Solving/Algorithms/Flatland%20Space%20Stations)|[C#](./Problem%20Solving/Algorithms/Flatland%20Space%20Stations/Solution.cs)|Easy|25|O(n)|O(n)\n[Fair Rations](./Problem%20Solving/Algorithms/Fair%20Rations)|[C#](./Problem%20Solving/Algorithms/Fair%20Rations/Solution.cs)|Easy|25|O(n)|O(1)\n[Cavity Map](./Problem%20Solving/Algorithms/Cavity%20Map)|[C#](./Problem%20Solving/Algorithms/Cavity%20Map/Solution.cs)|Easy|30|O(n^2)|O(1)\n[Manasa and Stones](./Problem%20Solving/Algorithms/Manasa%20and%20Stones)|[C#](./Problem%20Solving/Algorithms/Manasa%20and%20Stones/Solution.cs)|Easy|30|O(n)|O(n)\n[The Grid Search](./Problem%20Solving/Algorithms/The%20Grid%20Search)|[C#](./Problem%20Solving/Algorithms/The%20Grid%20Search/Solution.cs)|Medium|30|O(n^2)|O(1)\n[Happy Ladybugs](./Problem%20Solving/Algorithms/Happy%20Ladybugs)|[C#](./Problem%20Solving/Algorithms/Happy%20Ladybugs/Solution.cs)|Easy|30|O(n)|O(n)\n[Strange Counter](./Problem%20Solving/Algorithms/Strange%20Counter)|[C#](./Problem%20Solving/Algorithms/Strange%20Counter/Solution.cs)|Easy|30|O(1)|O(1)\n[3D Surface Area](./Problem%20Solving/Algorithms/3D%20Surface%20Area)|[C#](./Problem%20Solving/Algorithms/3D%20Surface%20Area/Solution.cs)|Medium|30|O(n^2)|O(1)\n[Absolute Permutation](./Problem%20Solving/Algorithms/Absolute%20Permutation)|[C#](./Problem%20Solving/Algorithms/Absolute%20Permutation/Solution.cs)|Medium|40|O(1)|O(1)\n[The Bomberman Game](./Problem%20Solving/Algorithms/The%20Bomberman%20Game)|[C#](./Problem%20Solving/Algorithms/The%20Bomberman%20Game/Solution.cs)|Medium|40|O(n)|O(1)\n[Larry's Array](./Problem%20Solving/Algorithms/Larry's%20Array)|[C#](./Problem%20Solving/Algorithms/Larry's%20Array/Solution.cs)|Medium|40|O(n^2)|O(1)\n[Almost Sorted](./Problem%20Solving/Algorithms/Almost%20Sorted)|[C#](./Problem%20Solving/Algorithms/Almost%20Sorted/Solution.cs)|Medium|50|O(n*logn)|O(n)\n[Matrix Layer Rotation](./Problem%20Solving/Algorithms/Matrix%20Layer%20Rotation)|[C#](./Problem%20Solving/Algorithms/Matrix%20Layer%20Rotation/Solution.cs)|Hard|80|O(n)|O(1)\n[Big Sorting](./Problem%20Solving/Algorithms/Big%20Sorting)|[C#](./Problem%20Solving/Algorithms/Big%20Sorting/Solution.cs)|Easy|20|O(n*logn)|O(n)\n[Super Reduced String](./Problem%20Solving/Algorithms/Super%20Reduced%20String)|[C#](./Problem%20Solving/Algorithms/Super%20Reduced%20String/Solution.cs)|Easy|10|O(n)|O(1)\n[Intro to Tutorial Challenges](./Problem%20Solving/Algorithms/Intro%20to%20Tutorial%20Challenges)|[C#](./Problem%20Solving/Algorithms/Intro%20to%20Tutorial%20Challenges/Solution.cs)|Easy|30|O(logn)|O(1)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnemruddemir%2Fhackerrank","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnemruddemir%2Fhackerrank","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnemruddemir%2Fhackerrank/lists"}