balajiathreya/CrackingTheCodeInterview
Solution for problems from Cracking the code interview, 4th edition
Public GitHub Catalog
Discovered Oct 5, 2026
balajiathreya / SortingAlgorithms
Sorting algorithms in java
About this discovery
Public repository record indexed from GitHub. Explore verified star velocity metrics, source code repositories, and curated developer tool directories across the GitHubRepo ecosystem.
#30809655GitHub System ID
balajiathreyaOrganization / User
PublicVisibility
ActiveCatalog Status
More from balajiathreya
balajiathreya/BTreeSortingValidator
A B-tree is a generalization of a binary search tree, where each node has n keys and n+1 children and n can be different for each node. The keys are sorted the same as in a binary search tree. For each key k in the tree, all children to the left must have keys less than k, and all children to the right must have keys greater than k. Write a method that validates whether a B-tree is correctly sorted. You do NOT need to validate whether the tree is balanced. Use the following model for a node in the B-tree.
balajiathreya/data-gov-in
Visualization of data from data.gov.in
balajiathreya/GeoCodingUtils
Python utility for various geo-coding stuff.