Solutions to all of the Hackerrank Cracking the Coding Interview problems in Python
| Arrays: Left Rotation | Problem | Solution |
| Tries: Contacts | Problem | Solution |
| Strings: Making Anagrams | Problem | Solution |
| Hash Tables: Ransom Note | Problem | Solution |
| Linked Lists: Detect a Cycle | Problem | Solution |
| Stacks: Balanced Brackets | Problem | Solution |
| Queues: A Tale of Two Stacks | Problem | Solution |
| Heaps: Find the Running Median | Problem | Solution |
| Sorting: Bubble Sort | Problem | Solution |
| Sorting: Comparator | Problem | Solution |
| BFS: Shortest Reach in a Graph | Problem | Solution |
| DFS: Connected Cell in a Grid | Problem | Solution |
| Binary Search: Ice Cream Parlor | Problem | Solution |
| Merge Sort: Counting Inversions | Problem | Solution |
| DP: Coin Change | Problem | Solution |
| Bit Manipulation: Lonely Integer | Problem | Solution |
| Recursion: Fibonacci Numbers | Problem | Solution |
| Time Complexity: Primality | Problem | Solution |
| Recursion: Davis' Staircase | Problem | Solution |