94. Binary Tree Inorder Traversal
Given the root of a binary tree, return the inorder traversal of its nodes’ values. Example 1: Input: root = [1,null,2,3] Output: [1,3,2] […]
91. Decode Ways
A message containing letters from A-Z can be encoded into numbers using the following mapping: ‘A’ -> “1” ‘B’ -> “2” … ‘Z’ ->
85. Maximal Rectangle
Given a rows x cols binary matrix filled with 0‘s and 1‘s, find the largest rectangle containing only 1‘s and return its area. Example 1: Input: matrix =
1701. Average Waiting Time
There is a restaurant with a single chef. You are given an array customers, where customers[i] = [arrivali, timei]: arrivali is the arrival
Closest Three Sum
Given an array, arr of integers, and another number target, find three integers in the array such that their sum is closest to
1823. Find the Winner of the Circular Game
There are n friends that are playing a game. The friends are sitting in a circle and are numbered from 1 to n in clockwise order. More
Search in Rotated Sorted Array
Given a sorted (in ascending order) and rotated array arr of distinct elements which may be rotated at some point and given
1518. Water Bottles
There are numBottles water bottles that are initially full of water. You can exchange numExchange empty water bottles from the market with one full
Ancestors in Binary Tree
Given a Binary Tree and an integer target. Find all the ancestors of the given target. Note: The ancestor of node x is node y, which is
2582. Pass the Pillow
There are n people standing in a line labeled from 1 to n. The first person in the line is holding a pillow initially. Every
Populate Inorder Successor for all nodes
Given a Binary Tree, complete the function to populate the next pointer for all nodes. The next pointer for every
2181. Merge Nodes in Between Zeros
You are given the head of a linked list, which contains a series of integers separated by 0‘s. The beginning and end of the linked list will have Node.val ==