All Posts
LeetCode 130. Given an m x n matrix board containing...
LeetCode 129. You are given the root of a binary...
LeetCode 116. You are given a perfect binary tree where...
LeetCode 117. Given a binary tree, populate each next pointer...
LeetCode 112. Given the root of a binary tree and...
LeetCode 113. Given the root of a binary tree and...
LeetCode 118. Given an integer numRows, return the first numRows...
LeetCode 119. Given an integer rowIndex, return the rowIndex^th (0-indexed)...
LeetCode 111. Given a binary tree, find its minimum depth....
LeetCode 128. Given an unsorted array of integers nums, return...
LeetCode 114. Given the root of a binary tree, flatten...
LeetCode 115. Given two strings s and t, return the...
LeetCode 109. Given the head of a singly linked list...
LeetCode 124. A path in a binary tree is a...
LeetCode 121. You are given an array prices where prices[i]...
LeetCode 123. You are given an array prices where prices[i]...