Difficulty: easy Problem DescriptionEnglish (Merge Two Sorted Lists)You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted lis

Difficulty: medium Problem DescriptionEnglish (Remove Nth Node From End of List)Given the head of a linked list, remove the nth node from the end of the list and return its he

Difficulty: easy Problem DescriptionEnglish (Reverse Linked List)Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: graph LR n

Difficulty: medium Problem DescriptionEnglish (Add Two Numbers)You are given two non-empty linked lists representing two non-negative integers. The digits are stored in revers

Difficulty: hard Problem DescriptionEnglish (Reducing Dishes)A chef has collected data on the satisfaction level of his n dishes. Chef can cook any dish in 1 unit of time. Lik

Problem DescriptionSuppose there were such a scenario - we need to put mutiple points into a collection which contains unique points. The form of point is its coordinates (x, y). The type of coordinat

Difficulty: medium Problem DescriptionEnglish (Palindrome Partitioning)Given a string s, partition s such that every substring of the partition is a palindrome. Return all pos

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102#i

Difficulty: easy Problem DescriptionEnglish (Counting Bits)Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the numb

Difficulty: medium Problem DescriptionEnglish (Minimum Lines to Represent a Line Chart)You are given a 2D integer array stockPrices where stockPrices[i] = [dayi, pricei] indic