摘要：
Delete Operation for Two Strings (M) 题目 Given two strings word1 and word2, return the minimum number of steps required to make word1 and word2 the sam 阅读全文
摘要：
Convert Sorted List to Binary Search Tree (M) 题目 Given a singly linked list where elements are sorted in ascending order, convert it to a height balan 阅读全文
摘要：
Non-decreasing Array (M) 题目 Given an array nums with n integers, your task is to check if it could become non-decreasing by modifying at most one elem 阅读全文
摘要：
Running Sum of 1d Array (E) 题目 Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running su 阅读全文
摘要：
Course Schedule III (H) There are n different online courses numbered from 1 to n. You are given an array courses where courses[i] = [durationi, lastD 阅读全文
摘要：
Prefix and Suffix Search (H) 题目 Design a special dictionary which has some words and allows you to search the words in it by a prefix and a suffix. Im 阅读全文
摘要：
Powerful Integers (M) 题目 Given three integers x, y, and bound, return a list of all the powerful integers that have a value less than or equal to boun 阅读全文
摘要：
Power of Three (E) 题目 Given an integer n, return true if it is a power of three. Otherwise, return false. An integer n is a power of three, if there e 阅读全文
摘要：
Furthest Building You Can Reach (M) 题目 You are given an integer array heights representing the heights of buildings, some bricks, and some ladders. Yo 阅读全文
摘要：
Critical Connections in a Network (H) 题目 There are n servers numbered from 0 to n-1 connected by undirected server-to-server connections forming a net 阅读全文