Step-By-Step Directions From a Binary Tree Node to Another You are given the root of a binary tree with n nodes. Each node is uniquely assigned a value from 1 to n. You are also given an integer ...
Create Binary Tree From Descriptions You are given a 2D integer array descriptions where descriptions[i] = [parenti, childi, isLefti] indicates that parenti is the parent of childi in a binary tr...
Robot Collisions There are n 1-indexed robots, each having a position on a line, health, and movement direction. You are given 0-indexed integer arrays positions, healths, and a string direction...
Maximum Score From Removing Substrings You are given a string s and two integers x and y. You can perform two types of operations any number of times. Remove substring "ab" and gain x points. ...
Reverse Substrings Between Each Pair of Parentheses You are given a string s that consists of lower case English letters and brackets. Reverse the strings in each pair of matching parentheses, s...
Crawler Log Folder The Leetcode file system keeps a log each time some user performs a change folder operation. The operations are described below: "../" : Move to the parent folder of the curr...
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 time of the ith customer. The arr...
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 formally, moving clockw...
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 water bottle. The operation of d...
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 second, the person holding the pillow passes it to the...