Probelm DescriptionDesign a data structure with O(1) time complexity for all functions: set(key, value) get(key) set_all(value) SolutionFor the general solution, the time complexity of the function

Problem DescriptionEnglishA sequence is defined as: the absolute value of the difference between two adjacent elements after ordering is exactly equal to 1.Now given an array of length n, how many sub

Basic ProblemIf we have a number array and a desired range of values, we have chance to operate a pair of numbers every time with multiple times - we are able to give a number a plus and give another

Difficulty: easy Problem DescriptionEnglish (Remove Duplicates from Sorted List)Given the head of a sorted linked list, delete all duplicates such that each element appears on

Difficulty: medium Problem DescriptionEnglish (Reverse Linked List II)Given the head of a singly linked list and two integers left and right where left <= right, reverse th

Difficulty: easy Problem DescriptionEnglish (Intersection of Two Linked Lists)Given the heads of two singly linked-lists headA and headB, return the node at which the two list

Difficulty: medium Problem DescriptionEnglish (Linked List Cycle II)Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null.

Difficulty: hard Problem DescriptionEnglish (Reverse Nodes in k-Group)Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list.

Difficulty: medium Problem DescriptionEnglish (Swap Nodes in Pairs)Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without m

Difficulty: easy Problem DescriptionEnglish (Linked List Cycle)Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a lin