北叶青藤

摘要： You are given a list of edges in a graph with weight. Find all the paths between start node and end node with min weights in the path. The edges like 阅读全文

摘要： You have a browser of one tab where you start on the homepage and you can visit another url, get back in the history number of steps or move forward i 阅读全文

摘要： We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. You're given the startTime,  阅读全文

摘要： We are given some website visits: the user with name username[i] visited the website website[i] at time timestamp[i]. A 3-sequence is a list of websit 阅读全文

摘要： Design a stack which supports the following operations. Implement the CustomStack class: CustomStack(int maxSize) Initializes the object with maxSize  阅读全文

摘要： You are given a data structure of employee information, which includes the employee's unique id, their importance value and their direct subordinates' 阅读全文

摘要： Design a logger system that receives a stream of messages along with their timestamps. Each unique message should only be printed at most every 10 sec 阅读全文

摘要： Alex and Lee play a game with piles of stones. There are an even number of piles arranged in a row, and each pile has a positive integer number of sto 阅读全文

摘要： A permutation perm of n + 1 integers of all the integers in the range [0, n] can be represented as a string s of length n where: s[i] == 'I' if perm[i 阅读全文

摘要： Given a n * n matrix grid of 0's and 1's only. We want to represent the grid with a Quad-Tree. Return the root of the Quad-Tree representing the grid. 阅读全文