385. Mini Parser
Given a nested list of integers represented as a string, implement a parser to deserialize it.
Given a nested list of integers represented as a string, implement a parser to deserialize it.
Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.
Given a 2D board and a list of words from the dictionary, find all words in the board.
Given a list of unique words. Find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words[i] + words[j] is a palindrome.
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most t and the difference between i and j is at most k.
A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down).
Given a 2D grid, each cell is either a wall ‘W’, an enemy ‘E’ or empty ‘0’ (the number zero), return the maximum enemies you can kill using one bomb.
The bomb kills all the enemies in the same row and column from the planted point until it hits the wall since the wall is too strong to be destroyed.
Note that you can only put the bomb at an empty cell.
Given a string, find the length of the longest substring T that contains at most 2 distinct characters.
Given a string, find the length of the longest substring T that contains at most k distinct characters.
Given a digit string, return all possible letter combinations that the number could represent.
Given two numbers represented as strings, return multiplication of the numbers as a string.
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],…] (si < ei), find the minimum number of conference rooms required.
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.