A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null.Construct a deep copy of the list. 138. Copy List with Random Pointer leetcode
Given two strings text1 and text2, return common subsequence. If there is no common subsequence, return 0. 有更新！ 1143. Longest Common Subsequence dp
You want to schedule a list of jobs in d days. Jobs are dependent (i.e To work on the i-th job, you have to finish all the jobs j where 0 <= j < i). 有更新！ 1335. Minimum Difficulty of a Job Schedule leetcode
whistle