• Boxplots

General template for various tree questions. Source

Inorder Traversal ```java public List inorderTraversal(TreeNode root) { List list = new ArrayList<>(); if(root == null) return list; Stack stack = new Stack<>(); while(root != null || !stack.empty()){ while(root != null){ stack.push(root); root = root.left; } root = stack.pop(); list.add(root.val); root = root.right;

}
return list; } ```

Just weird code

A general template for most substring problems taken from link.

Problems

1. Container With Most Water

A bunch of clever solutions to leetcode problems

Practice Problems from DPV

Problems

1. Binary Tree Level Order Traversal

Problems

1. Search in Rotated Sorted Array
2. Find First and Last Position of Element in Sorted Array

Backtracking recursion

Build up many possible solutions through multiple recursive calls at each step

Seed the initial recursive call with an “empty” solution

At each base case, you have a potential solution