Store Blog
Study & Reference Archive — Black / White Edition
Computer Science

Java Interview Prep — Part 2

Array programs, searching & sorting, and matrix programs (Q41–Q70) — each question paired with the logic explained in plain English and working Java code, covering Kadane's algorithm, binary search, merge/quick/counting/bucket sort, and matrix operations.

22 pages PDF Free — no account required
Download PDF Preview in browser
Why it's on this site

Array and sorting questions show up in almost every Java interview, and this part walks through them the way I'd actually explain them on a whiteboard — plain English first, code after. Kadane's algorithm and the sort family (merge, quick, counting, bucket) are the two sections worth slowing down on; the rest clicks quickly once those two land. Pairs well with Part 4 if you're doing a full prep pass rather than a quick refresh.

← Back to the full archive