03 2019 档案
摘要：Given an array arr that is a permutation of [0, 1, ..., arr.length - 1], we split the array into some number of "chunks" (partitions), and individuall
阅读全文
摘要：This question is the same as "Max Chunks to Make Sorted" except the integers of the given array are not necessarily distinct, the input array could be
阅读全文
摘要：Write a class StockSpanner which collects daily price quotes for some stock, and returns the span of that stock's price for the current day. The span
阅读全文
摘要：Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Note: Your algo
阅读全文
