// the take
A grab-bag of hand-rolled Java implementations of core data structures (custom ArrayList, LinkedList, Stack, Queue, Deque, PriorityQueue) plus a handful of classic interview problems, built as coursework for the Apni Kaksha Java placement bootcamp. It's aimed at students prepping for DSA interviews who want to see structures built from scratch rather than just importing java.util.
Decent breadth for a learning repo — it covers the core structures (deque, priority queue, graphs, trees) plus separate interview-style problems like Sliding Window Maximum and Group Anagrams, not just textbook algorithms. Implementing things like MyLinkedList and MyStack from scratch instead of wrapping java.util is actually useful for understanding internals rather than just calling library methods. Topic-per-folder layout makes it easy to jump straight to the one structure you're reviewing.
Zero tests anywhere — there's no way to know if MyArrayList or MyDeque are actually correct without reading every line yourself, which defeats the point of using someone else's reference implementation. No build file (no pom.xml, no build.gradle), just loose .java files meant to be dropped into Eclipse, so there's no CI and no easy way to compile or run this outside an IDE. Dead since January 2023 with no indication anyone's maintaining it, so any bugs in the custom implementations are permanent. The 500 stars / 400 forks ratio is a flag that most of that traffic is bootcamp students forking their own copy of the coursework, not organic interest in the code's quality — don't read the star count as a quality signal here.
We read the README, the directory tree and a key source file in October 2026. Nobody pays to be listed. How we judge →