文件名称：Problem-Solving-
文件大小：39KB
文件格式：ZIP
更新时间：2024-04-21 00:39:51
解决问题 20/12/5 66.加一易
【文件预览】：
Problem-Solving--main
----techniques(660B)
----Leet Mediums()
--------kth max in binary tree(823B)
--------Deep Copy list with random pointer(951B)
--------3 sum smaller(640B)
--------Top k Freq(3KB)
--------String Compression(2KB)
--------Create Binary Tree from preorder and inorder(1KB)
--------The Maze - rolling ball(2KB)
--------Sliding Window(1KB)
--------ZigZag(1KB)
--------kth largest using Quick Sort, Randomized QS(1KB)
--------Kill Process Brute Force(550B)
--------Kill Process(1KB)
--------K-diff Pairs in an Array(498B)
--------Merge Intervals(2KB)
--------Sum Root to Leaf Numbers(1KB)
--------Add Two Number II(2KB)
--------Container with most water(565B)
--------Longest Univalue Path(1KB)
--------Top k freq words(760B)
--------Minimum number of swaps to make 2 strings equal(746B)
--------Coin Change brute force backtracking(806B)
--------FirstUniqueNumber(1KB)
--------Insert Delete GetRandom(1KB)
--------Subarray sum k(465B)
--------Flatten Binary tree to link list(1KB)
--------Rotated Array Search Target(685B)
--------kth largest number(424B)
--------3sum(1KB)
--------Meeting Rooms 2(722B)
--------Consecutive ones II(817B)
--------All Paths graph problem(1KB)
--------Design Browser History(993B)
--------Sort characters by frequency(1KB)
--------Longest Palindromic Substring(1KB)
--------LRU(2KB)
--------Candy Crush(1KB)
--------Valid Tic Tac Toe State(2KB)
--------reverse nodes in k groups(1KB)
--------Design Hit Counter(979B)
--------Reverse Link List II(1KB)
--------Global Local inversions Divide and Conquer(1KB)
--------Longest Substring Without Repeating Characters(985B)
--------Minimum size subarray sum(701B)
--------Flatten Doubly LinkedList(1KB)
--------Design Underground System(2KB)
--------Group Anagrams(936B)
--------Word Break(791B)
--------Word Search(1KB)
--------Generate valid paranthesis(713B)
--------Calender I Booking problem(663B)
--------3 sum closest(703B)
--------Letter Combinations of a Phone Number(1KB)
--------Count Unhappy Friends(2KB)
----fundamentals()
--------Randomized QS(1KB)
--------Problem type(188B)
--------Sorting the HashMap(302B)
--------LCM(119B)
--------GCD(156B)
----Leet()
--------incrementBy1(853B)
--------2 sum with 2 pointer technique(396B)
--------Third max Number(675B)
--------Diameter of tree(926B)
--------2sum(495B)
----Peak6 Airport Problem(701B)
----README.md(46B)
----tricky()
--------Split array into consecutive subsequences(1KB)