摘要:
This question is about implementing a basic elimination algorithm for Candy Crush. Given an m x n integer array board representing the grid of candy w 閱讀全文
摘要:
Given an array arr of positive integers sorted in a strictly increasing order, and an integer k. Return the kth positive integer that is missing from 閱讀全文
摘要:
Description Given two nodes of a binary tree p and q, return their lowest common ancestor (LCA). Each node will have a reference to its parent node. T 閱讀全文
摘要:
You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can 閱讀全文
摘要:
his is an interactive problem. You are given an array of unique strings wordlist where wordlist[i] is 6 letters long, and one word in this list is cho 閱讀全文
摘要:
You are given a string s representing an attendance record for a student where each character signifies whether the student was absent, late, or prese 閱讀全文
摘要:
A Range Module is a module that tracks ranges of numbers. Design a data structure to track the ranges represented as half-open intervals and query abo 閱讀全文
摘要:
You are a hiker preparing for an upcoming hike. You are given heights, a 2D array of size rows x columns, where heights[row][col] represents the heigh 閱讀全文
摘要:
Given strings s1 and s2, return the minimum contiguous substring part of s1, so that s2 is a subsequence of the part. If there is no such window in s1 閱讀全文
摘要:
Given a rows x cols screen and a sentence represented as a list of strings, return the number of times the given sentence can be fitted on the screen. 閱讀全文