https://github.com/jonasraoni/hackerrank
My solutions to exercises and tests at https://hackerrank.com.
https://github.com/jonasraoni/hackerrank
algorithms algorithms-and-data-structures algorithms-javascript hackerrank hackerrank-algorithms-solutions hackerrank-challenges hackerrank-javascript hackerrank-javascript-solutions hackerrank-solutions javascript javascript-algorithms
Last synced: 18 days ago
JSON representation
My solutions to exercises and tests at https://hackerrank.com.
- Host: GitHub
- URL: https://github.com/jonasraoni/hackerrank
- Owner: jonasraoni
- License: mit
- Created: 2021-02-04T18:13:22.000Z (about 4 years ago)
- Default Branch: main
- Last Pushed: 2024-04-10T20:37:17.000Z (about 1 year ago)
- Last Synced: 2025-03-26T08:06:27.660Z (about 1 month ago)
- Topics: algorithms, algorithms-and-data-structures, algorithms-javascript, hackerrank, hackerrank-algorithms-solutions, hackerrank-challenges, hackerrank-javascript, hackerrank-javascript-solutions, hackerrank-solutions, javascript, javascript-algorithms
- Language: JavaScript
- Homepage: http://raoni.org/
- Size: 112 KB
- Stars: 6
- Watchers: 2
- Forks: 3
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# HackerRank
My solutions to exercises at https://hackerrank.com.
This is my profile there: https://www.hackerrank.com/jonasraoni :)
These 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 😂
Note: 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.
## [Algorithms](algorithms)
### [Bit Manipulation](algorithms/bit-manipulation)
- [Flipping Bits](algorithms/bit-manipulation/flippingBits.js)
- [Lonely Integer](algorithms/bit-manipulation/lonelyinteger.js)
### [Constructive Algorithms](algorithms/constructive-algorithms)
- [New Year Chaos](algorithms/constructive-algorithms/minimumBribes.js)
### [Graph Theory](algorithms/graph-theory)
- [Snakes and Ladders: The Quickest Way Up](algorithms/graph-theory/quickestWayUp.js)
### [Greedy](algorithms/greedy)
- [Greedy Florist](algorithms/greedy/getMinimumCost.js)
- [Luck Balance](algorithms/greedy/luckBalance.js)
- [Max Min](algorithms/greedy/maxMin.js)
- [Mark And Toys](algorithms/greedy/maximumToys.js)
- [Minimum Absolute Difference In An Array](algorithms/greedy/minimumAbsoluteDifference.js)
- [Reverse Shuffle Merge](algorithms/greedy/reverseShuffleMerge.js)
- [Sherlock and The Beast](algorithms/greedy/decentNumber.js)
### [Implementation](algorithms/implementation)
- [Counting Valleys](algorithms/implementation/countingValleys.js)
- [Grading Students](algorithms/implementation/gradingStudents.cs)
- [Jumping On The Clouds](algorithms/implementation/jumpingOnClouds.js)
- [Repeated String](algorithms/implementation/repeatedString.js)
- [Sales By Match](algorithms/implementation/sockMerchant.js)
### [Sorting](algorithms/search)
- [Connected Cells in a Grid](algorithms/search/connectedCell.js)
- [Ice Cream Parlor](algorithms/search/icecreamParlor.js)
- [Pairs](algorithms/search/pairs.js)
- [Sherlock and Array](algorithms/search/balancedSums.js)
### [Sorting](algorithms/sorting)
- [Fraudulent Activity Notifications](algorithms/sorting/activityNotifications.js)
### [Strings](algorithms/strings)
- [Alternating Characters](algorithms/strings/alternatingCharacters.js)
- [Circular Palindromes](algorithms/strings/circularPalindromes.cs)
- [Common Child](algorithms/strings/commonChild.js)
- [Sherlock And The Valid String](algorithms/strings/isValid.js)
- [Sherlock And Anagrams](algorithms/strings/sherlockAndAnagrams.js)
- [Two Strings](algorithms/strings/twoStrings.js)
### [Warmup](algorithms/warmup)
- [A Very Big Sum](algorithms/warmup/aVeryBigSum.cs)
- [Birthday Cake Candles](algorithms/warmup/birthdayCakeCandles.cs)
- [Compare The Triplets](algorithms/warmup/compareTriplets.cs)
- [Diagonal Difference](algorithms/warmup/diagonalDifference.cs)
- [Mini-Max Sum](algorithms/warmup/miniMaxSum.cs)
- [Plus Minus](algorithms/warmup/plusMinus.cs)
- [Simple Array Sum](algorithms/warmup/simpleArraySum.cs)
- [Staircase](algorithms/warmup/staircase.cs)
- [Time Conversion](algorithms/warmup/timeConversion.cs)
## [Challenges](challenges)
- [Count Triplets](challenges/countTriplets.js)
- [Frequency Queries](challenges/freqQuery.js)
- [Friend Circle Queries](challenges/maxCircle.js)
- [Max Array Sum](challenges/maxSubsetSum.js)
- [Minimum Swaps 2](challenges/minimumSwaps.js)
- [Minimum Time Required](challenges/minTime.js)
- [Special String Again](challenges/substrCount.js)
- [Triple Sum](challenges/tripleSum.js)
## [Data Structures](data-structures)
### [Arrays](data-structures/arrays)
- [Arrays - DS](data-structures/arrays/reverse.js)
- [2D Array - DS](data-structures/arrays/hoursglassSum.js)
- [Array Manipulation](data-structures/arrays/arrayManipulation.js)
- [Dynamic Array](data-structures/arrays/dynamicArray.js)
- [Left Rotation](data-structures/arrays/rotateLeft.js)
- [Sparse Arrays](data-structures/arrays/matchingStrings.js)
### [Linked Lists](data-structures/linked-lists)
- [Find Merge Point Of Two Lists](data-structures/linked-lists/findMergeNode.js)
- [Insert A Node At A Specific Position In A Linked List](data-structures/linked-lists/insertNodeAtPosition.js)
- [Inserting a Node Into a Sorted Doubly Linked List](data-structures/linked-lists/sortedInsert.js)
- [Reverse A Doubly Linked List](data-structures/linked-lists/reverse.js)
### [Stacks](stacks/trees)
- [Balanced Brackets](data-structures/stacks/isBalanced.js)
- [Maximum Element](data-structures/stacks/processData.js)
### [Trees](data-structures/trees)
- [Binary Search Tree : Lowest Common Ancestor](data-structures/trees/lca.js)
- [Swap Nodes [Algo]](data-structures/trees/swapNodes.js)
- [Tree: Height of a Binary Tree](data-structures/trees/height.js)
## [Functional Programming](functional-programming)
- [Solve Me First FP](functional-programming/introduction/solveMeFirst.cs)
### [Introduction](functional-programming/introduction)
## [Mathematics](mathematics)
### [Fundamentals](mathematics/fundamentals)
- [Army Game](mathematics/fundamentals/gameWithCells.js)
- [Best Divisor](mathematics/fundamentals/bestDivisor.js)
- [Connecting Towns](mathematics/fundamentals/connectingTowns.js)
- [Cutting Paper Squares](mathematics/fundamentals/cuttingPapersSquare.js)
- [Sherlock and Divisors](mathematics/fundamentals/divisors.js)
- [Filling Jars](mathematics/fundamentals/fillingJars.js)
- [Find the Point](mathematics/fundamentals/findPoint.js)
- [Halloween Party](mathematics/fundamentals/halloweenParty.js)
- [Handshake](mathematics/fundamentals/handshake.js)
- [Is Fibo](mathematics/fundamentals/isFibo.js)
- [Leonardo's Prime Factors](mathematics/fundamentals/primeCount.js)
- [Maximum Draws](mathematics/fundamentals/maximumDraws.js)
- [Minimum Height Triangle](mathematics/fundamentals/lowestTriangle.js)
- [Most Distant](mathematics/fundamentals/mostDistant.js)
- [Restaurant](mathematics/fundamentals/restaurant.js)
- [Reverse Game](mathematics/fundamentals/reverseGame.js)
- [Sherlock and Moving Tiles](mathematics/fundamentals/movingTiles.js)
- [Sumar and the Floating Rocks](mathematics/fundamentals/floatingRocks.js)
- [Summing the N Series](mathematics/fundamentals/summingSeries.js)
- [Strange Grid](mathematics/fundamentals/strangeGrid.js)
### [Number Theory](mathematics/number-theory)
- [Constructing a Number](mathematics/number-theory/canConstruct.js)
- [Sherlock and GCD](mathematics/number-theory/sherlockAndGcd.js)
## [Tutorials](tutorials)
### [Cracking The Code Interview](tutorials/cracking-the-code-interview)
- [Arrays: Left Rotation](tutorials/cracking-the-code-interview/rotLeft.js)
- [Hash Tables: Ice Cream Parlor](tutorials/cracking-the-code-interview/whatFlavors.js)
- [Hash Tables: Ransom Note Solution](tutorials/cracking-the-code-interview/checkMagazine.js)
- [Linked Lists: Detect a Cycle](tutorials/cracking-the-code-interview/has_cycle.js)
- [Merge Sort: Counting Inversions](tutorials/cracking-the-code-interview/countInversions.js)
- [Recursion: Fibonacci Numbers](tutorials/cracking-the-code-interview/fibonacci.js)
- [Sorting: Bubble Sort](tutorials/cracking-the-code-interview/countSwaps.js)
- [Sorting: Comparator](tutorials/cracking-the-code-interview/compare.js)
- [Strings: Making Anagrams](tutorials/cracking-the-code-interview/makeAnagram.js)
- [Time Complexity: Primality](tutorials/cracking-the-code-interview/primality.js)