Algorithms Bootcamp in Java

This guide is designed to help you quickly learn the most commonly asked problems in algorithm interview

An algorithm is a step-by-step procedure to solve a problem

Prerequisites

• Your local computer should have installed JDK 8+ or OpenJDK 8+, and Maven 3+

• You should have walked through the Data Structure Bootcamp

Array and String

• Smallest missing positive integer

• Reverse words in a string

• Check if two strings are anagrams

Two Pointers

Use two pointers to walk inward from both ends of a linear collection, such as array or string, to reduce the time complexity of the solution

• 2Sum

• 3Sum

Sliding Window

Use a sliding window to check a condition while iterating over an array or string
A window is a range of element indices in an array or string. A sliding window is a window that slides its boundaries toward a direction (left/right)

• Sliding window maximum

• Subarray sum equals k

• Minimum substring

• Longest substring without repeating characters

Dynamic Programming

Learn to break a problem into optimal subproblems and use a cache to store the computed results of the solutions to overlapping subproblems

• Fibonacci numbers

• Longest palindromic substring

• Longest increasing subsequence

• Longest common substring

• Box stacking

• Unique paths without obstacles

• Unique paths with obstacles

• 0-1 Knapsack

• Coin change

• Minimum coin change

Backtracking

• N Queens

• Given a set, find all subsets

• Given a string, find all permutations

Divide and Conquer

• Merge Sort Algorithm

• Binary Search Algorithm

Tree

• Depth First Traversal

• Breadth First Traversal

• Height of a Binary Tree

Graph

• Depth First Search Algorithm

• Breath First Search Algorithm

• Detect Cycle

• Topological Sort

• Shortest Paths Algorithms