- C.P.A.1 Two Sum
- C.P.A.2 Three Sum
- C.P.A.3 Trapping Rain Water
- C.P.A.4 Max Consecutive Ones III
- C.P.A.5 Maximum Product Subarray
- C.P.A.6 Next Permutation
- C.P.SG.1 Valid Number
- C.P.SG.2 Valid Parentheses
- C.P.SG.3 Palindromic Substrings
- C.P.SG.4 Minimum Window Substring
- C.P.SG.5 Longest Substring with At Most K Distinct Characters
- C.P.SG.6 Design Search Autocomplete System
- C.P.SG.7 Longest Repeating Character Replacement
- C.P.T.1 Populating Next Right Pointers in Each Node
- C.P.T.2 Binary Search Tree Iterator
- C.P.T.3 Serialize and Deserialize Binary Tree
- C.P.T.4 Lowest Common Ancestor of a Binary Search Tree
- C.P.T.5 Kth Smallest Element in a BST
- C.P.T.6 Diameter of Binary Tree
- C.P.G.1 Clone Graph
- C.P.G.2 Course Schedule II
- C.P.G.3 Number of Islands
- C.P.G.4 Number of Connected Components in an Undirected Graph
- C.P.G.5 Graph Valid Tree
- C.P.G.6 Reconstruct Itinerary
- C.P.G.7 Cheapest Flights Within K Stops
- C.P.G.8 Alien Dictionary
- C.P.SP.1 Basic Calculator III
- C.P.SP.2 Top K Frequent Elements
- C.P.SP.3 Merge k Sorted Lists
- C.P.SP.4 Next Greater Element II
- C.P.L.1 Reverse Linked List
- C.P.L.2 Linked List Cycle
- C.P.L.3 Merge k Sorted Lists
- C.P.L.4 Remove Nth Node From End of List
- C.P.L.5 Reorder List
- C.P.BS.1 Search in Rotated Sorted Array
- C.P.BS.2 Find Minimum in Rotated Sorted Array II
- C.P.BS.3 Single Element in a Sorted Array
- C.P.BS.4 Find K Closest Elements
- C.P.BS.5 Median of Two Sorted Arrays
- C.P.BK.1 Letter Combinations of a Phone Number
- C.P.BK.2 Generate Parentheses
- C.P.BK.3 N-Queens
- C.P.BK.4 Regular Expression Matching
- C.P.BK.5 Permutations
- C.P.DP.1 Climbing Stairs
- C.P.DP.2 Coin Change
- C.P.DP.3 Longest Common Subsequence
- C.P.DP.4 Word Break
- C.P.DP.5 Jump Game
- C.P.DP.6 Decode Ways