# LeetCode

## Lowest Common Ancestor of a Binary Tree

Explain the recursive and interactive algorithms to find the lowest common ancestor (LCA) of binary tree.

## LeetCode: Unique Binary Search Trees II

How to generate all the unique binary search trees with given values [1, N].

## LeetCode: Two Sum II – Input array is sorted

Solution for LeetCode: Two Sum II – Input array is sorted

## LeetCode Problems for Beginners

This is a list of categories with classic and easy problems for LeetCode beginners.

## Intersection of Two Linked Lists

Solution for Intersection of Two Linked Lists, naive solution and approaches of set and two pointers.

## Let’s LeetCode with Fun

The LeetCode problems are suitable exercises for beginners, intermediate learners or any programmer who want more proficient at data structures and algorithms. Let’s treat it with fun.

## LeetCode: Maximum Product Subarray

Solution for LeetCode: Maximum Product Subarray, with naive approach and leaner scan approach.

## LeetCode: Min Stack

Solution for LeetCode: Min Stack.

## LeetCode: Word Search

Solution for LeetCode challenge: word search, with depth-first searching.

## LeetCode: Permutations II

Solution for LeetCode: Permutations II, with depth-first search and optimization.