856. Score of Parentheses
161. One Edit Distance
1293. Shortest Path in a Grid with Obstacles Elimination
1293. Shortest Path in a Grid with Obstacles Elimination
Description
You are given an m x n integer matrix grid where each cell is either 0 (empty) or 1 (obstacle). You can move up, down, left, or right from and to an empty cell in one step .
364. Nested List Weight Sum II
364. Nested List Weight Sum II
Description
You are given a nested list of integers nestedList. Each element is either an integer or a list whose elements may also be integers or other lists.
432. All O one Data Structure
[432. All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure/description/?envType=company&envId=linkedin&favoriteSlug=linkedin-six-months)
Description
Design a data structure to store the strings’ count with the ability to return the strings with minimum and maximum counts.
381. Insert Delete GetRandom O(1) - Duplicates allowed
381. Insert Delete GetRandom O(1) - Duplicates allowed
Description
RandomizedCollection is a data structure that contains a collection of numbers, possibly duplicates (i.e., a multiset). It should support inserting and removing specific elements and also reporting a random element.
470. Implement Rand10() Using Rand7()
470. Implement Rand10() Using Rand7()
Description
Given the API rand7() that generates a uniform random integer in the range [1, 7], write a function rand10() that generates a uniform random integer in the range [1, 10]. You can only call the API rand7(), and you shouldn’t call any other API. Please do not use a language’s built-in random API.
611. Valid Triangle Number
272. Closest Binary Search Tree Value II
272. Closest Binary Search Tree Value II
Description
Given the root of a binary search tree, a target value, and an integer k, return the k values in the BST that are closest to the target. You may return the answer in any order .