https://github.com/vinitkumar/ctci-hackerrank
Solutions to Hackerrank problems in Python
https://github.com/vinitkumar/ctci-hackerrank
Last synced: over 1 year ago
JSON representation
Solutions to Hackerrank problems in Python
- Host: GitHub
- URL: https://github.com/vinitkumar/ctci-hackerrank
- Owner: vinitkumar
- License: mit
- Created: 2019-09-10T05:09:15.000Z (almost 7 years ago)
- Default Branch: master
- Last Pushed: 2017-10-27T05:07:09.000Z (over 8 years ago)
- Last Synced: 2025-01-10T18:50:24.072Z (over 1 year ago)
- Size: 32.2 KB
- Stars: 1
- Watchers: 1
- Forks: 5
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Cracking the Coding interview
Solutions to all of the Hackerrank Cracking the Coding Interview problems in Python
## Data Structures
| | | |
|---|:---:|:---:|
| Arrays: Left Rotation | [Problem](https://www.hackerrank.com/challenges/ctci-array-left-rotation/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/array_left_rotation.py) |
| Tries: Contacts | [Problem](https://www.hackerrank.com/challenges/ctci-contacts/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/contacts.py) |
| Strings: Making Anagrams | [Problem](https://www.hackerrank.com/challenges/ctci-making-anagrams/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/making_anagrams.py) |
| Hash Tables: Ransom Note | [Problem](https://www.hackerrank.com/challenges/ctci-ransom-note/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/ransom_note.py) |
| Linked Lists: Detect a Cycle | [Problem](https://www.hackerrank.com/challenges/ctci-linked-list-cycle/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/linked_list_cycle.py) |
| Stacks: Balanced Brackets | [Problem](https://www.hackerrank.com/challenges/ctci-balanced-brackets/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/balanced_brackets.py) |
| Queues: A Tale of Two Stacks | [Problem](https://www.hackerrank.com/challenges/ctci-queue-using-two-stacks/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/queue_using_two_stacks.py) |
| Heaps: Find the Running Median | [Problem](https://www.hackerrank.com/challenges/ctci-find-the-running-median/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/find_the_running_median.py) |
## Algorithms
| | | |
|---|:---:|:---:|
| Sorting: Bubble Sort | [Problem](https://www.hackerrank.com/challenges/ctci-bubble-sort/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/bubble_sort.py) |
| Sorting: Comparator | [Problem](https://www.hackerrank.com/challenges/ctci-comparator-sorting/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/comparator_sorting.py) |
| BFS: Shortest Reach in a Graph | [Problem](https://www.hackerrank.com/challenges/ctci-bfs-shortest-reach/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/bfs_shortest_reach.py) |
| DFS: Connected Cell in a Grid | [Problem](https://www.hackerrank.com/challenges/ctci-connected-cell-in-a-grid/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/connected_cell_in_a_grid.py) |
| Binary Search: Ice Cream Parlor | [Problem](https://www.hackerrank.com/challenges/ctci-ice-cream-parlor/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/ice_cream_parlor.py) |
| Merge Sort: Counting Inversions | [Problem](https://www.hackerrank.com/challenges/ctci-merge-sort/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/merge_sort.py) |
## Techniques/Concepts
| | | |
|---|:---:|:---:|
| DP: Coin Change | [Problem](https://www.hackerrank.com/challenges/ctci-coin-change/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/coin_change.py) |
| Bit Manipulation: Lonely Integer | [Problem](https://www.hackerrank.com/challenges/ctci-lonely-integer/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/lonely_integer.py) |
| Recursion: Fibonacci Numbers | [Problem](https://www.hackerrank.com/challenges/ctci-fibonacci-numbers/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/fibonacci_numbers.py) |
| Time Complexity: Primality | [Problem](https://www.hackerrank.com/challenges/ctci-big-o/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/big_o.py) |
| Recursion: Davis' Staircase | [Problem](https://www.hackerrank.com/challenges/ctci-recursive-staircase/problem) | [Solution](https://github.com/v1n337/hackerrank/blob/master/solutions/recursive_staircase.py) |