Recursion
Binary Tree 104. Maximum Depth of Binary Tree: leetcode.cn/problems/maximum-depth-of-binary-tree/ Given the root of a binary tree, return its maximum depth. A binary tree’s maximum depth is the n...
Binary Tree 104. Maximum Depth of Binary Tree: leetcode.cn/problems/maximum-depth-of-binary-tree/ Given the root of a binary tree, return its maximum depth. A binary tree’s maximum depth is the n...
Binary Search 35. Search Insert Position: leetcode.cn/problems/search-insert-position/ Given a sorted array of distinct integers and a target value, return the index if the target is found. If no...
Sliding Window 209. Minimum Size Subarray Sum: leetcode.cn/problems/minimum-size-subarray-sum/ Given an array of positive integers nums and a positive integer target, return the minimal length of...
Linked List 1. Add Two Numbers: leetcode.cn/problems/add-two-numbers/ You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and ...
Hash 1. Two Sum: leetcode.cn/problems/two-sum/ Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that ea...