LeetCode/Top150Interview
2023-07-26 19:16:04 -07:00
..
20_Valid_Parenthesis.py added new test cases 2023-07-26 19:16:04 -07:00
22_Generate_Parenthesis.py Solution found with recursion 2023-07-21 16:48:52 -07:00
26RemoveDuplicatesFromSortedArray.py completed and added faster runtime solution 2023-06-29 03:00:39 -07:00
27RemoveElement.py fixed numbering and went back to complete challenge 26 2023-06-28 17:21:04 -07:00
55JumpGame.py two pointer method first run 2023-07-02 20:44:46 -07:00
80RemoveDuplicates.py Test Commit 2023-06-26 16:39:03 -07:00
88MergeSortedArray.py Test Commit 2023-06-26 16:39:03 -07:00
121BestTimetoBuyandSellStock.py Update min price and max profit dynamically 2023-06-27 01:44:19 -07:00
122BestTimetoBuyandSellStock2.py Complete, Beats 11% runtime, beats 42% memory 2023-06-30 22:29:51 -07:00
169MajorityElement.py Test Commit 2023-06-26 16:39:03 -07:00
189RotateArray.py Test Commit 2023-06-26 16:39:03 -07:00
217_Contains_Duplicate.py Added less memory solution and testing db TZ 2023-07-22 11:31:46 -07:00
238ProductofArrayExceptSelf.py began problem, solved in o(n)^2, but needs O(n) 2023-07-11 02:37:28 -07:00
274H-Index.py working, needs refinement on multiple hits 2023-07-04 17:42:58 -07:00
380InsertDeleteGetRandomO1.py updated rand 2023-07-12 20:14:49 -07:00
856_Score_of_Parenthesis.py moving on from question 856 2023-07-23 17:58:51 -07:00
LessonsLearned.md Update Lesson on Dynamic min/max 2023-06-27 01:46:40 -07:00
Questions_to_revisit.md moving on from question 856 2023-07-23 17:58:51 -07:00