Cracking-the-Coding-Interview-Challenges

Java solutions for Cracking the Coding Interview Challenges for Hackerrank

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
Arrays - Left Rotation		Arrays - Left Rotation
BFS - Shortest Reach in a Graph		BFS - Shortest Reach in a Graph
Binary Search - Ice Cream Parlor		Binary Search - Ice Cream Parlor
DFS - Connected Cell in a Grid		DFS - Connected Cell in a Grid
DP - Coin Change		DP - Coin Change
Hash Tables - Ransom Note		Hash Tables - Ransom Note
Heaps - Find the Running Median		Heaps - Find the Running Median
Linked Lists - Detect a Cycle		Linked Lists - Detect a Cycle
Merge Sort - Counting Inversions		Merge Sort - Counting Inversions
Queues - A Tale of Two Stacks		Queues - A Tale of Two Stacks
Stacks - Balanced Brackets		Stacks - Balanced Brackets
Strings - Making Anagrams		Strings - Making Anagrams
Time Complexity - Primality		Time Complexity - Primality
Tries- Contacts		Tries- Contacts
.gitignore		.gitignore
README.md		README.md

Provide feedback