kdn251/interviews

The interviews repository is a comprehensive study guide for software engineering technical interviews, with a particular focus on data structures, algorithms, and the kinds of coding challenges that companies ask during hiring. The problem it addresses is that interview preparation is scattered, candidates have to piece together resources from books, websites, and practice platforms. This repo consolidates explanations of core concepts, curated links to online judges, and a collection of actual Java implementations into one place. The repository covers major data structure categories such as linked lists, stacks, queues, trees, binary search trees, heaps, hash maps, tries, and segment trees, with time complexity tables for each common operation. It also explains algorithm categories including sorting, searching, graph traversal, dynamic programming, greedy algorithms, bit manipulation, and runtime complexity analysis using Big O notation. Beyond explanations, it links out to popular coding practice platforms like LeetCode, HackerRank, CodeForces, and Pramp for live mock interviews. The codebase itself contains Java implementations of solutions to common interview problems, organized in a directory structure you can browse. You would use this repository when preparing for software engineering interviews at companies that test algorithmic problem-solving, or as a reference when you want to brush up on a data structure before using it in a project. The tech stack is purely Java with no external dependencies, it is a straightforward collection of Java files and Markdown documentation.