hsaputra/leetcode-1

This repository is a personal collection of solved coding puzzles from LeetCode, a popular platform where programmers practice algorithmic problems to prepare for technical interviews. The author, hsaputra, has worked through hundreds of these challenges in Java and documented their solutions along with brief notes on the strategy or technique used for each one. The repo is essentially a big table of contents. Each entry lists a problem number, the problem title, and a short label describing the approach taken to solve it, such as "Greedy," "Binary Search," or "Dynamic Programming." The source files themselves apparently contain a short explanation of the core idea at the top, followed by the actual code. It covers a wide range of difficulty levels and topics, from straightforward array manipulation to more complex problems involving trees, graphs, and number theory. The audience here is other programmers who are also practicing for interviews or just enjoy algorithmic puzzles. If you are stuck on a specific problem, say, "Knight Dialer" or "Cheapest Flights Within K Stops", you could look up the author's approach to see how they thought about it. The labels next to each problem give you a quick hint about the intended technique before you dive into the code. There is not much in the way of hand-holding or tutorial-style explanation. This is a reference resource, not a textbook. The README does not explain what the various algorithmic terms mean, so it assumes you already have some familiarity with concepts like BFS, DFS, or union-find. It is best treated as a companion to the LeetCode platform itself, useful for cross-referencing your own solutions against someone else's approach.