636. Exclusive Time of Functions
636. Exclusive Time of Functions
Description
On a single-threaded CPU, we execute a program containing n functions. Each function has a unique ID between 0 and n-1.
1539. Kth Missing Positive Number
1539. Kth Missing Positive Number
Description
Given an array arr of positive integers sorted in a strictly increasing order , and an integer k.
498. Diagonal Traverse
415. Add Strings
398. Random Pick Index
339. Nested List Weight Sum
317. Shortest Distance from All Buildings
317. Shortest Distance from All Buildings
Description
You are given an m x n grid grid of values 0, 1, or 2, where:
708. Insert into a Sorted Circular Linked List
708. Insert into a Sorted Circular Linked List
Description
Given a Circular Linked List node, which is sorted in non-descending order, write a function to insert a value insertVal into the list such that it remains a sorted circular list. The given node can be a reference to any single node in the list and may not necessarily be the smallest value in the circular list.