-
38.Count and SayMedium26795642Add to ListShareThecount-and-saysequence is a sequ…
-
1335.Minimum Difficulty of a Job ScheduleHard2251217Add to ListShareYou want to …
-
237.Delete Node in a Linked ListMedium1556493Add to ListShareThere is a singly-l…
-
653.Two Sum IV - Input is a BSTEasy5063223Add to ListShareGiven therootof a Bina…
-
16.3Sum ClosestMedium7071385Add to ListShareGiven an integer arraynumsof lengthn…
-
981.Time Based Key-Value StoreMedium3526333Add to ListShareDesign a time-based k…
-
112.Path SumEasy7129869Add to ListShareGiven therootof a binary tree and an inte…
-
1155.Number of Dice Rolls With Target SumMedium3127107Add to ListShareYou havend…
-
91.Decode WaysMedium86964068Add to ListShareA message containing letters fromA-Z…
-
218.The Skyline ProblemHard4963232Add to ListShareA city'sskylineis the outer co…
-
658.Find K Closest ElementsMedium6025493Add to ListShareGiven asortedinteger arr…
-
19.Remove Nth Node From End of ListMedium13095548Add to ListShareGiven theheadof…
-
838.Push DominoesMedium2828173Add to ListShareThere arendominoes in a line, and …
-
622.Design Circular QueueMedium2644217Add to ListShareDesign your implementation…
-
113.Path Sum IIMedium6053126Add to ListShareGiven therootof a binary tree and an…