// the find
hussien89aa/DataStructureAndAlgorithms
Write code that run faster, use less memory and prepare for your Job Interview
A Java code companion for a Udemy course on data structures and algorithms aimed at interview prep. It covers the standard ground — sorting, searching, graphs, dynamic programming — with implementations you can run alongside video lectures. This is course material, not a standalone reference library.
The implementations from-scratch approach (custom linked list, hash table, dynamic array) is actually useful for interview prep — you see how the internals work, not just `ArrayList.add()`. The graph section covers BFS, DFS, Dijkstra, and A* which is more complete than most similar repos. The CodingInterviews subproject pairs named problems with concrete solutions, which makes it easy to work through specific patterns. Covers both recursive and iterative variants in a few places.
Dead since April 2023 and clearly not maintained — no issues addressed, no PRs merged, the Udemy coupon link in the README is the primary call to action. The problem files are named `problem1` through `problem21` with no index or README explaining what each solves, so navigating without the video is nearly impossible. No tests anywhere — you run `main()` methods manually and eyeball output. The code style is inconsistent and there are typos in class names (`FirendCircle`, `MerageLinkedList`, `SprialMatrix`) which signals this was never reviewed.