{"id":21699873,"url":"https://github.com/jonasraoni/hackerrank","last_synced_at":"2025-04-12T13:22:16.092Z","repository":{"id":124279218,"uuid":"336042539","full_name":"jonasraoni/hackerrank","owner":"jonasraoni","description":"My solutions to exercises and tests at https://hackerrank.com.","archived":false,"fork":false,"pushed_at":"2024-04-10T20:37:17.000Z","size":115,"stargazers_count":6,"open_issues_count":0,"forks_count":3,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-26T08:06:27.660Z","etag":null,"topics":["algorithms","algorithms-and-data-structures","algorithms-javascript","hackerrank","hackerrank-algorithms-solutions","hackerrank-challenges","hackerrank-javascript","hackerrank-javascript-solutions","hackerrank-solutions","javascript","javascript-algorithms"],"latest_commit_sha":null,"homepage":"http://raoni.org/","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/jonasraoni.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2021-02-04T18:13:22.000Z","updated_at":"2023-08-02T12:16:06.000Z","dependencies_parsed_at":null,"dependency_job_id":"f4d7bd94-9c3e-4072-a4fe-d17b9a723ae6","html_url":"https://github.com/jonasraoni/hackerrank","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jonasraoni%2Fhackerrank","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jonasraoni%2Fhackerrank/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jonasraoni%2Fhackerrank/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jonasraoni%2Fhackerrank/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jonasraoni","download_url":"https://codeload.github.com/jonasraoni/hackerrank/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248571928,"owners_count":21126546,"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":["algorithms","algorithms-and-data-structures","algorithms-javascript","hackerrank","hackerrank-algorithms-solutions","hackerrank-challenges","hackerrank-javascript","hackerrank-javascript-solutions","hackerrank-solutions","javascript","javascript-algorithms"],"created_at":"2024-11-25T20:11:53.085Z","updated_at":"2025-04-12T13:22:16.085Z","avatar_url":"https://github.com/jonasraoni.png","language":"JavaScript","readme":"# HackerRank\nMy solutions to exercises at https://hackerrank.com.\n\nThis is my profile there: https://www.hackerrank.com/jonasraoni :)\n\nThese are my own implementations, everything should be running fast enough to pass through all tests. As I enjoy small and concise codes, whatever doesn't fit in this rule means that I've suffered or didn't have enough knowledge 😂\n\nNote: Few codes were solved in C# (I've written them a long time ago), I'll convert to JS when I get some free time, just to keep the repository uniform.\n\n## [Algorithms](algorithms)\n\n### [Bit Manipulation](algorithms/bit-manipulation)\n\n- [Flipping Bits](algorithms/bit-manipulation/flippingBits.js)\n- [Lonely Integer](algorithms/bit-manipulation/lonelyinteger.js)\n\n### [Constructive Algorithms](algorithms/constructive-algorithms)\n\n- [New Year Chaos](algorithms/constructive-algorithms/minimumBribes.js)\n\n### [Graph Theory](algorithms/graph-theory)\n\n- [Snakes and Ladders: The Quickest Way Up](algorithms/graph-theory/quickestWayUp.js)\n\n### [Greedy](algorithms/greedy)\n\n- [Greedy Florist](algorithms/greedy/getMinimumCost.js)\n- [Luck Balance](algorithms/greedy/luckBalance.js)\n- [Max Min](algorithms/greedy/maxMin.js)\n- [Mark And Toys](algorithms/greedy/maximumToys.js)\n- [Minimum Absolute Difference In An Array](algorithms/greedy/minimumAbsoluteDifference.js)\n- [Reverse Shuffle Merge](algorithms/greedy/reverseShuffleMerge.js)\n- [Sherlock and The Beast](algorithms/greedy/decentNumber.js)\n\n### [Implementation](algorithms/implementation)\n\n- [Counting Valleys](algorithms/implementation/countingValleys.js)\n- [Grading Students](algorithms/implementation/gradingStudents.cs)\n- [Jumping On The Clouds](algorithms/implementation/jumpingOnClouds.js)\n- [Repeated String](algorithms/implementation/repeatedString.js)\n- [Sales By Match](algorithms/implementation/sockMerchant.js)\n\n### [Sorting](algorithms/search)\n\n- [Connected Cells in a Grid](algorithms/search/connectedCell.js)\n- [Ice Cream Parlor](algorithms/search/icecreamParlor.js)\n- [Pairs](algorithms/search/pairs.js)\n- [Sherlock and Array](algorithms/search/balancedSums.js)\n\n### [Sorting](algorithms/sorting)\n\n- [Fraudulent Activity Notifications](algorithms/sorting/activityNotifications.js)\n\n### [Strings](algorithms/strings)\n\n- [Alternating Characters](algorithms/strings/alternatingCharacters.js)\n- [Circular Palindromes](algorithms/strings/circularPalindromes.cs)\n- [Common Child](algorithms/strings/commonChild.js)\n- [Sherlock And The Valid String](algorithms/strings/isValid.js)\n- [Sherlock And Anagrams](algorithms/strings/sherlockAndAnagrams.js)\n- [Two Strings](algorithms/strings/twoStrings.js)\n\n### [Warmup](algorithms/warmup)\n\n- [A Very Big Sum](algorithms/warmup/aVeryBigSum.cs)\n- [Birthday Cake Candles](algorithms/warmup/birthdayCakeCandles.cs)\n- [Compare The Triplets](algorithms/warmup/compareTriplets.cs)\n- [Diagonal Difference](algorithms/warmup/diagonalDifference.cs)\n- [Mini-Max Sum](algorithms/warmup/miniMaxSum.cs)\n- [Plus Minus](algorithms/warmup/plusMinus.cs)\n- [Simple Array Sum](algorithms/warmup/simpleArraySum.cs)\n- [Staircase](algorithms/warmup/staircase.cs)\n- [Time Conversion](algorithms/warmup/timeConversion.cs)\n\n## [Challenges](challenges)\n\n- [Count Triplets](challenges/countTriplets.js)\n- [Frequency Queries](challenges/freqQuery.js)\n- [Friend Circle Queries](challenges/maxCircle.js)\n- [Max Array Sum](challenges/maxSubsetSum.js)\n- [Minimum Swaps 2](challenges/minimumSwaps.js)\n- [Minimum Time Required](challenges/minTime.js)\n- [Special String Again](challenges/substrCount.js)\n- [Triple Sum](challenges/tripleSum.js)\n\n## [Data Structures](data-structures)\n\n### [Arrays](data-structures/arrays)\n\n- [Arrays - DS](data-structures/arrays/reverse.js)\n- [2D Array - DS](data-structures/arrays/hoursglassSum.js)\n- [Array Manipulation](data-structures/arrays/arrayManipulation.js)\n- [Dynamic Array](data-structures/arrays/dynamicArray.js)\n- [Left Rotation](data-structures/arrays/rotateLeft.js)\n- [Sparse Arrays](data-structures/arrays/matchingStrings.js)\n\n### [Linked Lists](data-structures/linked-lists)\n\n- [Find Merge Point Of Two Lists](data-structures/linked-lists/findMergeNode.js)\n- [Insert A Node At A Specific Position In A Linked List](data-structures/linked-lists/insertNodeAtPosition.js)\n- [Inserting a Node Into a Sorted Doubly Linked List](data-structures/linked-lists/sortedInsert.js)\n- [Reverse A Doubly Linked List](data-structures/linked-lists/reverse.js)\n\n### [Stacks](stacks/trees)\n\n- [Balanced Brackets](data-structures/stacks/isBalanced.js)\n- [Maximum Element](data-structures/stacks/processData.js)\n\n### [Trees](data-structures/trees)\n\n- [Binary Search Tree : Lowest Common Ancestor](data-structures/trees/lca.js)\n- [Swap Nodes [Algo]](data-structures/trees/swapNodes.js)\n- [Tree: Height of a Binary Tree](data-structures/trees/height.js)\n\n## [Functional Programming](functional-programming)\n\n- [Solve Me First FP](functional-programming/introduction/solveMeFirst.cs)\n\n### [Introduction](functional-programming/introduction)\n\n## [Mathematics](mathematics)\n\n### [Fundamentals](mathematics/fundamentals)\n\n- [Army Game](mathematics/fundamentals/gameWithCells.js)\n- [Best Divisor](mathematics/fundamentals/bestDivisor.js)\n- [Connecting Towns](mathematics/fundamentals/connectingTowns.js)\n- [Cutting Paper Squares](mathematics/fundamentals/cuttingPapersSquare.js)\n- [Sherlock and Divisors](mathematics/fundamentals/divisors.js)\n- [Filling Jars](mathematics/fundamentals/fillingJars.js)\n- [Find the Point](mathematics/fundamentals/findPoint.js)\n- [Halloween Party](mathematics/fundamentals/halloweenParty.js)\n- [Handshake](mathematics/fundamentals/handshake.js)\n- [Is Fibo](mathematics/fundamentals/isFibo.js)\n- [Leonardo's Prime Factors](mathematics/fundamentals/primeCount.js)\n- [Maximum Draws](mathematics/fundamentals/maximumDraws.js)\n- [Minimum Height Triangle](mathematics/fundamentals/lowestTriangle.js)\n- [Most Distant](mathematics/fundamentals/mostDistant.js)\n- [Restaurant](mathematics/fundamentals/restaurant.js)\n- [Reverse Game](mathematics/fundamentals/reverseGame.js)\n- [Sherlock and Moving Tiles](mathematics/fundamentals/movingTiles.js)\n- [Sumar and the Floating Rocks](mathematics/fundamentals/floatingRocks.js)\n- [Summing the N Series](mathematics/fundamentals/summingSeries.js)\n- [Strange Grid](mathematics/fundamentals/strangeGrid.js)\n\n### [Number Theory](mathematics/number-theory)\n\n- [Constructing a Number](mathematics/number-theory/canConstruct.js)\n- [Sherlock and GCD](mathematics/number-theory/sherlockAndGcd.js)\n\n## [Tutorials](tutorials)\n\n### [Cracking The Code Interview](tutorials/cracking-the-code-interview)\n- [Arrays: Left Rotation](tutorials/cracking-the-code-interview/rotLeft.js)\n- [Hash Tables: Ice Cream Parlor](tutorials/cracking-the-code-interview/whatFlavors.js)\n- [Hash Tables: Ransom Note Solution](tutorials/cracking-the-code-interview/checkMagazine.js)\n- [Linked Lists: Detect a Cycle](tutorials/cracking-the-code-interview/has_cycle.js)\n- [Merge Sort: Counting Inversions](tutorials/cracking-the-code-interview/countInversions.js)\n- [Recursion: Fibonacci Numbers](tutorials/cracking-the-code-interview/fibonacci.js)\n- [Sorting: Bubble Sort](tutorials/cracking-the-code-interview/countSwaps.js)\n- [Sorting: Comparator](tutorials/cracking-the-code-interview/compare.js)\n- [Strings: Making Anagrams](tutorials/cracking-the-code-interview/makeAnagram.js)\n- [Time Complexity: Primality](tutorials/cracking-the-code-interview/primality.js)","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjonasraoni%2Fhackerrank","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjonasraoni%2Fhackerrank","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjonasraoni%2Fhackerrank/lists"}