https://github.com/cr21/pythonleetcode
Python Leetcode questions
https://github.com/cr21/pythonleetcode
Last synced: 2 months ago
JSON representation
Python Leetcode questions
- Host: GitHub
- URL: https://github.com/cr21/pythonleetcode
- Owner: cr21
- Created: 2022-06-13T22:20:50.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2022-09-20T13:01:25.000Z (over 2 years ago)
- Last Synced: 2025-02-09T14:49:33.703Z (4 months ago)
- Language: Python
- Size: 544 KB
- Stars: 2
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# PythonLeetcode
Python Leetcode questions
| No | Description | category | Leetcode Link | Solution Link |
| -- | --------------------------------------------------- | ------------ | --------------------------------------------------- | ---------------------------------------------------------------------------------- |
| 1 | Find Minimum number of knoght moves to reach. (0,0) | Backtracking | [LC 1197 minimum knight moves](https://leetcode.com/problems/minimum-knight-moves/) | [knights.py](/LC1197\_Minimum\_knight\_moves.py) |
| 2 | sparse matrix multiplication | Array | [LC 311 Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/) | [sparse_multiplication.py](/LC311_Sparse_matrix_Multiplication.py) |
| 3 | Design In-Memory File System | Design | [LC 588 Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system/) | [filesystemdesign.py](/LC588_Design_File_system.py) |
| 4 | Gase Station| Greedy | [LC 134 Gase Station](https://leetcode.com/problems/gas-station/) | [gaststaion.py](/LC134_Gase_station.py) |
| 5 |Maze| BFS DFS | [LC 490 Maze](https://leetcode.com/problems/the-maze/) | [maze.py](/LC490_Maze.py) |
| 6 |Spiral Matrix| Array | [LC 54 Spiral Matrix ](https://leetcode.com/problems/spiral-matrix/) | [spiral_matrix.py](/LC54_spiral_matrix.py) |
| 7 |Deisgn TicTacToe| Design | [LC 348 Deisgn TicTacToe ](https://leetcode.com/problems/design-tic-tac-toe/) | [tictactoe.py](/LC348_DesignTicTacToe.py)|
| 8 |Restore IP addresses| String, Backtracking | [LC 93 Restore IP addresses ](https://leetcode.com/problems/restore-ip-addresses/) | [restore_ip_backtracking.py](/LC93_RestoreIpAddresses.py) |
| 9 |reconstruct Itinerary | Graph, Backtracking , DFS | [LC 332 Reconstruct Itinerary ](https://leetcode.com/problems/reconstruct-itinerary/) | [findItinerary.py](/LC332_ReconstructItinerary.py) |
| 10 |Sudoku Solver | CSP, Backtracking , DFS | [LC 37 Sudoku solver ](https://leetcode.com/problems/sudoku-solver/) | [sudoku_solver.py](/LC37_SudokuSolver.py) |
| 11 |Pacific Atlantic Water flow | DFS MATRIX , BFS | [LC 417 Pacific Atlantic Water flow ](https://leetcode.com/problems/pacific-atlantic-water-flow/) | [ocean_water_flow.py](/LC417_Pacific_Atlantic_Ocean.py) |
| 12 |Angle bw hands of clock | Math, Ad hoc | [LC 1344 Angle between hours and minutes hands of clock ](https://leetcode.com/problems/angle-between-hands-of-a-clock/) | [angle_bw_hour_minutes.py](/LC1344_Angle_between_handsof_clock.py) |
| 13 | Longest Substring with At Most K Distinct Characters | String, two pointer, HashMap | [LC 340. Longest Substring with At Most K Distinct Characters ](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/) | [longest_repeating_k_distinct.py](/LC340_Longest_substring_with_k_distinct_char.py) |
| 13 | Longest Palindromic SubString | String, two pointer, DP | [LC 05. Longest Palindromic SubString ](https://leetcode.com/problems/longest-palindromic-substring/) | [longest_pallindromic_substring.py](/LC_5_LongestPalindromic_substring.py) |
| 14 | Next Permutation | Array, two pointer, Ad hoc, | [LC 31. Next Permutation ](https://leetcode.com/problems/next-permutation/) | [next_permutation.py](/LC31_nextPermutation.py) |
| 15 | Longest substring without repeating character| Array, two pointer, String, HashMap | [LC 3. Longest substring without repeating character ](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [longest_nonrepeating_char_substring.py](/Longest_substring_without_repeating_charc.py) |
| 16 | Pallindromic Permutation| Array, HashMap | [266. Palindrome Permutation ](https://leetcode.com/problems/palindrome-permutation/) | [pallindromic_permutation.py](/LC_266_pallindrome_permutation.py) |
| 17 | Pallindromic substring| Array, String, DP , Two Pointer | [647. palindromic substrings ](https://leetcode.com/problems/palindromic-substrings/) | [pallindromic_substring.py](/LC647Pallindromic_substring.py) |
| 18 | Edit Distance| String, DP | [72 . Edit Distance ](https://leetcode.com/problems/edit-distance/) | [lenenshitine_distance.py](/LC72_edit_distance.py) |
| 19 | Missing Positive Number| Array, Binary Search, Math | [1539 Missing Positive Number ](https://leetcode.com/problems/kth-missing-positive-number/) | [missing_positive_number.py](/LC1539_FindKthPositive_missing_number.py) |
| 20 | Search in 2d MAtrix| Array, Binary Search | [74 Search in 2d MAtrix ](https://leetcode.com/problems/search-a-2d-matrix/) | [search2dArray.py](/Array/LC74_SearchIn2D_Matrix.py) |
| 21 | Largest Rectangle in Histogram| Stack, Devide and Conquer, | [84 Largest Rectangle in Histogram ](https://leetcode.com/problems/largest-rectangle-in-histogram/) | [largest_histogram.py](/Stack/LC84_Largest_Rectangle_in_histogram.py) |
| 22 | Maximal Area Rectangle | Stack, DP| [85 Maximal Area Rectangle ](https://leetcode.com/problems/maximal-rectangle/) | [maximal_area_rectangle.py](/Stack/LC85_Maximal_rectangle.py) |
| 23 | Open Lock | Graph, String, BFS| [752 Open Lock ](https://leetcode.com/problems/open-the-lock/) | [open_lock_bfs_string.py](/Graph/LC752_open_lock.py) |
| 24 | Range Sum Query 2D - Immutable | Array, prefixsum ,Matrix, cumulative sum| [304. Range Sum Query 2D - Immutable ](https://leetcode.com/problems/range-sum-query-2d-immutable/) | [range_sum_query_2d_matrix.py](/Array/LC304_Range_sum_query_2d_immutable.py) |
| 25 | Minimum Area Rectangle | Geometry, sorting, HashMap , Math | [939. Minimum Area Rectangle ](https://leetcode.com/problems/minimum-area-rectangle/) | [minimum_area_rectangle.py](/HashMap/Minimum_area_rectangle.py) |
| 26 | Sliding Window Maximum | Sliding Window, DEQUE | [239. Sliding Window Maximum ](https://leetcode.com/problems/sliding-window-maximum/) | [sliding_window_maximum.py](/Sliding_window/LC239_Sliding_window_maximum.py) |
| 27 | Maximum Area of Island | Graph, BFS | [695. Maximum Area of Island ](https://leetcode.com/problems/max-area-of-island/) | [maximu_area_island.py](/Graph/LC695_max_area_island.py) |
| 28 | Maximum Consecutive ones| Two Pointer, Array, sliding window | [1004. Maximum Consecutive ones ](https://leetcode.com/problems/max-consecutive-ones-iii/) | [maximum_one_consecutive.py](/Sliding_window/LC1004_Max_consecutive_ones.py) |
| 29 | Shortest Bridge| Graph, BFS, DFS | [934. Shortest Bridge ](https://leetcode.com/problems/shortest-bridge/) | [bridge_between_island.py](/Graph/LC934_shortest_bridge_between_island.py) |
| 30 | 3Sum Closest| Array, Sorting, Two Pointer | [16. 3Sum Closest ](https://leetcode.com/problems/3sum-closest/) | [3sum_closest.py](/Two_Pointer/3SumClosest.py) |
| 31 | Insert, Delete, Randomized O(1)| Array, random, HashTable | [380. Insert Delete GetRandom O(1) ](https://leetcode.com/problems/insert-delete-getrandom-o1/) | [insert_delete_random_O_1.py](/Design/Insert_Delete_Random_O_1.py) |
| 32 | Insert, Delete, Randomized O(1) Duplicates allowed| Array, random, HashTable, Multiset | [381. Insert Delete GetRandom With duplicates O(1) ](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/) | [insert_delete_random__with_duplicates_O_1.py](/Design/Randomized_multiset_insertion_Deletion_randomization.py) |
| 33 | Copy Random Pointers| LinkedList, Graph | [138. Copy List with Random Pointer ](https://leetcode.com/problems/copy-list-with-random-pointer/) | [deep_copy_list.py](/LinkedList/LC138_copy_list_with_random_pointer.py) |
| 34 | Continuous Subarray Sum| Math, Array | [523. Continuous Subarray Sum ](https://leetcode.com/problems/continuous-subarray-sum/) | [Continous_subarray_sum.py](/Math/Continous_subarray_sum.py) |
| 35 | MERGE accounts| GRAPH, DFS, UNION FIND, CONNECTED COMPONENT | [729. Account Merge ](https://leetcode.com/problems/accounts-merge/) | [merge_accounts.py](/Graph/LC721_Account_merge.py) |
| 36 | Range sum BST| BST, Tree, InORder, Binary Search| [938. Range sum BST ](https://leetcode.com/problems/range-sum-of-bst/) | [bst_range_sum.py](/Tree/LC_938_BST_Range_Sum.py) |
| 37 | Basic Calculator II| Stack, String| [227. Basic Calculator II ](https://leetcode.com/problems/basic-calculator-ii/) | [basic_calculator_2.py](/Stack/LC_227_Basic_calculator.py ) |
| 38 | Basic Calculator| Stack, String| [224. Basic Calculator ](https://leetcode.com/problems/basic-calculator/) | [basic_calculator.py](/Stack//LC_224_Basic_calculator.py ) |
| 39 | Read 4 | String| [157. Read N Characters Given Read4 ](https://leetcode.com/problems/read-n-characters-given-read4/) | [read.py](/String/read4.py ) |
| 40 | Read 4 Multiple Calls | Buffer, OS| [158. Read N Characters Given Read4 Multiple Calls ](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/) | [reader4_multiple_Calls.py](/Queue/Reader4.py) |
| 41 | Walls and Gates | GRAPH, BFS | [286. Walls and Gates ](https://leetcode.com/problems/walls-and-gates/) | [walls_gates.py](/Graph/LC286_Walls_and_gates.py) |
| 42 | Time BAsed Key Value pair| Design, Binary Search, Array| [981. Time Based Key-Value Store ](https://leetcode.com/problems/time-based-key-value-store/) | [time_based_KV.py](/Design/LC981_Time_based_Key_value_pair.py) |
| 43 | Binary Search Tree Iterator | Design, Binary Search TREE, | [173. BST Iterator ](https://leetcode.com/problems/binary-search-tree-iterator/) | [BST_iterator.py](/Tree/LC173_BST_Iterator.py) |
| 44 | Searilize and Deserialize binary search tree| Serialize, Binary Search TREE, | [449. Serialize and Deserialize BST ](https://leetcode.com/problems/serialize-and-deserialize-bst/) | [searialize_deserialize_bst.py](/Tree/LC449_searialize_deserialize_bst.py) |
| 45 | Jump Game IV| Graph, BFS, Bidirectional BFS | [1345. Jump Game IV ](https://leetcode.com/problems/jump-game-iv/) | [jump_game_4.py](/Graph/LC1345_Jump_Game_IV.py) |
| 46 | Validate_BST | Tree, BST | [98 Validate Binary Search Tree ](https://leetcode.com/problems/validate-binary-search-tree/) | [validate_bst.py](/Tree/LC98_Validate_BST.py) |
| 47 | Rotate Image | Array, Matrix, | [48 Rotate Image](https://leetcode.com/problems/rotate-image/) | [rotateImage.py](/Array/LC48_Rotate_image.py) |
| 48 | Kth Closest Element to Origin | Heap | [973 K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | [kth_closest_point_to_origin.py](/Heap/KthClosestElement_to_origin.py) |
| 49 | Trapping Rain Water| Array, Two Pointer, Prefix sum, suffix sum, right left sum | [42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | [traipping_rain_water.py](/Two_Pointer/LC42_Trapping_Rain_water.py) |
| 50 | Word Search| Backtracking, DFS, GRAPH | [79. Word Search](https://leetcode.com/problems/word-search/) | [word_search.py](/Backtrack/LC79_WordSearch-I.py) |
| 51 | Word Search 2| Backtracking, DFS, GRAPH ,TRIE| [212. Word Search II](https://leetcode.com/problems/word-search-ii/) | [word_search_2.py](/Trie/LC212_WordSearch-II.py) |
| 52 | Trie Implementation| TRIE| [208. Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) | [trie.py](/Trie/LC208_Implement_Trie.py) |
| 53 | LCS of Two stirngs | STRING, Dynamic Programming| [1143. Longest Common Subsequence](https://leetcode.com/problems/longest-consecutive-sequence/) | [lcs.py](/DP/longest_common_subsequence.py) |
| 54 | Longest consecutive sequences | Array, Hashset| [128. Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | [longest_consecutive_seq.py](/Array_Hashing/Longest_consecutive_sequences.py) |
| 55 | Daily Temperature |Stack| [739. Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | [daily_temparature.py](/Stack/LC739_Daily_Temprature.py) |
| 56 | return forest |TREE, DFS| [1110. Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/) | [delete_and_Return_forest.py](/Tree/LC1110_delete_and_get_forest.py) |
| 57 | reverse linkedlist in k groups |LinkedList| [25. Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | [reverse_linked_list_kgroups.py](/LinkedList/reverse_in_k_group.py) |
| 58 | reverse linkedlist |LinkedList| [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | [reverse_linked_list.py](/LinkedList/LC206_reverse_linkedList.py) |
| 59 | reverse linkedlist II |LinkedList | [92. Reverse Linked List II ](https://leetcode.com/problems/reverse-linked-list-ii/) | [reverse_linked_list_II.py](/LinkedList/Reverse_linked_list2.py) |
| 60 | Merge Two Sorted Lists |LinkedList | [21. Merge Two Sorted Lists ](https://leetcode.com/problems/merge-two-sorted-lists/) | [merge_sorted_linkedlist.py](/LinkedList/LC21_Merge_two_sorted_linkedList.py) |
| 61 | Climbing Stairs |Dynamic Programming | [70. Climbing Stairs ](https://leetcode.com/problems/climbing-stairs/) | [staircase.py](/DP/Staicase.py) |
| 62 | Min Cost Climbing Stairs | Dynamic Programming| [746. Min Cost Climbing Stairs ](https://leetcode.com/problems/min-cost-climbing-stairs/) | [min_cost_climibing_stairs.py](/DP/LC746_min_cost_to_climb_stairs.py) |
| 63 | Lowest Common Ancestor of a Binary Tree | Tree| [236. Lowest Common Ancestor of a Binary Tree ](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | [lca_binary_tree.py](/Tree/LC236_LCA_of_Binary_Tree.py) |
| 64 | Lowest Common Ancestor of a Binary Search Tree | Tree| [235. Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [lca_bst.py](/Tree/LC235_LCA_BST.py) |
| 65 | House Robber| Dynamic Programming 1D | [198. House Robber](https://leetcode.com/problems/house-robber/) | [house_robber_1d.py](/DP/LC198_HouseRobber.py) |
| 66 | House Robber 2| Dynamic Programming 1D | [213. House Robber II](https://leetcode.com/problems/house-robber-ii/) | [house_robber_II_1d.py](/DP/LC213_House_Robber.py) |
| 67 | Longest Pallindromic Substring| Dynamic Programming 1D | [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [longest_pallindromic_substr.py](/DP/LC5_Longest_pallindromic_substirng.py) |
| 68 | Decode Ways| Dynamic Programming 1D | [91. Decode Ways](https://leetcode.com/problems/decode-ways/) | [decode_ways.py](/DP/LC91_DecodeWays.py) |
| 69 | Coin Change| Dynamic Programming 1D | [322. Coin Change](https://leetcode.com/problems/coin-change/) | [coin_change.py](/DP/LC322_coin_change.py) |
| 70 | Top K Frequent Elements| Array | [347. Top K frequent Element](https://leetcode.com/problems/top-k-frequent-elements/) | [topk_frequent.py](/Array/LC304_Range_sum_query_2d_immutable.py) |
| 71 | Longest Repeating Character Replacement| Array Hashing | [424 Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | [longest_repearing_Char_with_replancement.py](/Array_Hashing/LC424_Longest_repeating_char_with_repalcement.py) |
| 72 | Kth Smallest Element in a BST| Tree, BST| [230. Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | [kth_smallest_bst.py](/Tree/LC230_Kth_smallest_element_BST.py) |
| 73 | Maximum sum subarray| Array, Greedy| [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [maximum_subarray_sum.py](/Greedy/Maximum_subarray.py) |
| 74 | Missing Number| MATH, SET| [268. Missing Number](https://leetcode.com/problems/missing-number/) | [missing_positive.py](/Math/LC268_MissingPositive.py) |
| 75 | Counting Bits| MATH, BIT| [338. Counting Bits](https://leetcode.com/problems/counting-bits/) | [counting_bits.py](/BitManipulation/Counting_bits.py) |
| 76 | Combination sums| DP| [39. Combination Sum](https://leetcode.com/problems/combination-sum/) | [combinations_sum.py](/DP/Lc39_Combination_sum.py) |
| 77 | Find Median from Data Stream| Heap| [295. Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | [find_meadian_from_stream.py](/Heap/LC295_FindMeadianStream.py) |
| 78 | Valid Pallindrome| String | [125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | [valid_pallindrome.py](/String/LC_125ValidPallindrome.py) |
| 79 | Valid Analgram| String | [242. Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [valid_anagram.py](/String/LC_242ValidAnagram.py) |
| 80 | Contains Duplicate| HashMap | [217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [contains_duplicate.py](/HashMap/LC217_contains_duplicate.py) |
| 81 | Two Sum| Array | [1. Two Sum](https://leetcode.com/problems/two-sum/) | [two_sum.py](/Array/LC1_two_sum.py) |
| 82 | Binary Search | Binary Search | [704. Binary Search](https://leetcode.com/problems/binary-search/) | [binary_search.py](/BinarySearch/LC704_binary_search.py) |
| 83 | Coin Change 2 | Dynamic Programmin, Knapsack | [518. Coin Change 2 ](https://leetcode.com/problems/coin-change-2/) | [coin_change2.py](/DP/LC518_CoinChange2.py) |
| 84 | Rotting Oranges | Graph, BFS | [994. Rotting Oranges ](https://leetcode.com/problems/rotting-oranges/) | [rotting_orange.py](/Graph/LC994_Rotting_Orange.py) |
| 85 | Happy Number | Math, Hashset | [202. Happy Number ](https://leetcode.com/problems/happy-number/) | [happy_number.py](/Math/LC202_Happy_number.py) |
| 86 | Target Sum| Math, DP | [494. Target Sum ](https://leetcode.com/problems/target-sum/) | [target_sum.py](/DP/LC494_TargetSum.py) |
| 87 | Group Anagrams| Array Hashing | [49. Group Anagrams ](https://leetcode.com/problems/group-anagrams/) | [group_anagram.py](/Array_Hashing/LC49_Group_Anagram.py) |
| 88 | Design Add and Search Words Data Structure| Trie, HashMap | [211. Design Add and Search Words Data Structure ](https://leetcode.com/problems/design-add-and-search-words-data-structure/) | [add_search.py](/Trie/LC211_Design_add_and_wordsearch.py) |
| 89 | Minimum Window Substring| Sliding Window, Hashing, String | [76.Minimum Window Substring ](https://leetcode.com/problems/minimum-window-substring/) | [minimum_window_substring.py](/LC76_minimum_window_substring.py) |
| 90 | Merge k Sorted Lists| Linked List | [23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | [merge_k_sorted_list.py](/LinkedList/LC23_merge_k_sorted_list.java) |
| 91 | Reorder List| Linked List | [143. Reorder List](https://leetcode.com/problems/reorder-list/) | [reorder_linkedList.py](/LinkedList/LC143_Reorder_LinkedList.py) |
| 92 |Generate Parentheses| Backtracking, Stack | [22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | [generte_parenthesis.py](/Backtrack/LC22_Generate_parenthesis.py) |
| 93 |Search in Rotated Sorted Array| Backtracking, Stack | [33. Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [search_rotated_sorted_array.py](/BinarySearch/LC33_Search_rotated_Sorted_Array.py) |
| 94 |Koko Eating Bananas| Binary Search | [875. Koko Eating Banana](https://leetcode.com/problems/koko-eating-bananas/) | [koko_binary_search.py](/BinarySearch/LC875_KokoEating_bananas.py) |
| 95 |Car Fleet|stack | [853. Car Fleet](https://leetcode.com/problems/car-fleet/) | [car_fleet.py](/Stack/LC853_carfleet.py) |
| 96 |Valid Parenthesis|stack | [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | [valid_parenthesis.py](/Stack/LC20_ValidParenthesis.py) |
| 97 |Invert Binary Tree|Tree | [226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [invert_binary_tree.py](/Tree/LC226_Invert_tree.py) |
| 98 |Number of Island| Graph | [200. Number of Island](https://leetcode.com/problems/number-of-islands/) | [number_island.py](/Graph/LC200_Number_of_island.py) |
| 99 |Unique Path| Graph | [62. Unique Path](https://leetcode.com/problems/unique-paths/) | [unique_path.py](/Graph/LC62_unique_path.py) |
|100 |Word Break| DP | [139. Word Break](https://leetcode.com/problems/word-break/) | [word_break.py](/DP/LC139_wordBreak.py) |
|101 |Insert Interval|Intervals | [57. Insert Interval](https://leetcode.com/problems/insert-interval/) | [insert_interval.py](/Intervals/LC57_insert_interval.py) |
|102 |Merge Interval|Intervals | [56. Merge Interval](https://leetcode.com/problems/merge-intervals/) | [merge_interval.py](/Intervals/LC56_MergeInterval.py) |
|103 | Remove Nth Node From End of List |Intervals | [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | [remove_node_from_end_ofList.py](/LinkedList/LC19_Remove_Node_EndOfLinkedList.py) |
|104 | Construct Binary Tree from Preorder and Inorder Traversal |Tree | [105. Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [construct_binary_tree_inorder_preorder.py](/Tree/LC105_Construct_Binary_treeFromPreorder_Inorder.py) |
|105 | Maximum Product Subarray | DP | [152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | [maximum_product_subarray.py](/DP/LC152_MaximumProductSubarray.py) |
|106 | Longest Substring Without Repeating Characters| DP | [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [longest_substirng_without_repeatiing_chars.py](/Array_Hashing/LC3_Longest_substring_without_repeating_chars.py) |
|107 | Product of Array Except Self| Array Hashing | [238. Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | [product_array_except_Self.py](/Array_Hashing/LC238_ProductOfArrayExceptItSelf.py) |
|108 | LinkedList Cycle| LinkedList | [141 Linkedlist Cycle](https://leetcode.com/problems/linked-list-cycle/) | [product_array_except_Self.py](/LinkedList/LC141_LinkedListCycle.py) |
|109 | Container With Most Water| Two Pointer | [11 Container With Most Water](https://leetcode.com/problems/container-with-most-water/) |
|110 | Find Minimum in Rotated Sorted Array | Binary Search| [153. Find Minimum in Rotated Sorted Array.](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/ ) |[find_min_rotated_sorted_arr.py](/BinarySearch/LC153_FindMinimumInRotated_Sorted_Array.py) |
|111 | Binary Tree Maximum Path Sum | Binary Tree| [124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/ ) |[binary_tree_maximum_path_sum.py](/Tree/LC124_BinaryTreeMaximumPathSum.py) |
|112 | LIS of Array | DP, Binary Search| [300. Longest Increasing Subsequences](https://leetcode.com/problems/longest-increasing-subsequence/ ) |[lis.py](/DP/LC300_LongestIncreasingSubsequence.py) |
|113 | Same Tree | Tree| [100. Same Tree](https://leetcode.com/problems/same-tree/ ) |[sametree.py](/Tree/LC100SameTree.py) |
|114 | Maximum Depth of the Tree | Tree| [104. Max Depth](https://leetcode.com/problems/maximum-depth-of-binary-tree/ ) |[max_depth.py](/Tree/LC104MaxDepthTree.py) |
|115 | 3 Sum | Array Hashing, Two Pointer| [15. 3 Sum](https://leetcode.com/problems/3sum/ ) |[3sum.py](/Array_Hashing/LC15_3Sum.py) |
|116 | Clone Graph | Graph| [133. Clone Graph](https://leetcode.com/problems/clone-graph/ ) |[clone_graph.py](/Graph/LC133CloneGraph.py) |
|117 | Encode Decode String | String| [271. Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/) |[encode_decode_string.py](/String/LC271_EncodeDecodeString.py) |
|118| Subtree of Another Tree | Tree| [572. Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) |[subtree_of_tree.py](/Tree/LC572_subtreeofTree.py) |
|119| Meeting Rooms | Intervals| [252 Meeting Rooms](https://leetcode.com/problems/meeting-rooms/) |[meetingrooms1.py](/Intervals/LC252_MeetingRooms.py) |
|120| Graph Valid Tree | Tree| [261 Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/) |[graph_valid_tree.py](/Graph/LC261_GraphValidTree.py) |
|121| Course Schedule | Graph| [207. Course Schedule](https://leetcode.com/problems/course-schedule/) |[course_scheduler.py](/Graph/LC207_CourseScheduler.py) |
|122| Best Time To Buy Stock| Sliding Window| [121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) |[best_time_tobuy_stock.py](/Sliding_window/LC121_BestTimeToBuyStock.py) |
|123| 55 Jump Game| Greedy, DP| [55 Jump Game](https://leetcode.com/problems/jump-game/) |[jump_Game.py](/Greedy/LC55_JumpGame.py) |
|124| Meeting Rooms II | Intervals| [253 Meeting Rooms ](https://leetcode.com/problems//meeting-rooms-ii/) |[meetingrooms_2.py](/Intervals/Lc253_MeetingRoom_II.py) |
|125| Non-overlapping Intervals | Intervals| [435. Non-overlapping Intervals ](https://leetcode.com/problems/non-overlapping-intervals/) |[non_overlapping_intervals.py](/Intervals/LC435_NonOverlapping_intervals.py) |
|126| Number of Connected Components in an Undirected Graph | Graph| [323. Number of Connected Components in an Undirected Graph ](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) |[num_of_connected_components.py](/Graph/LC323_NumberOfConnectedComponenets.py) |
|127| Number of 1 Bits | Bit Manipulation| [191 . Number of 1 Bits ](https://leetcode.com/problems/number-of-1-bits/) |[countBits_1.py](/BitManipulation/LC191_NumberOf1Bits.py) |
|128| Set Matrix Zero | Math| [73. Set Matrix Zeroes ](https://leetcode.com/problems/set-matrix-zeroes/) |[set_matrix_zero.py](/Math/LC73_setMatrixZero.py) |
|129| Reverse Bit | Bit Manipulation| [190. Reverse Bits ](https://leetcode.com/problems/reverse-bits/) |[reverse_bits.py](/BitManipulation/LC190_Bit_reverse.py) |
|130| Sum Of Two Integer | Bit Manipulation| [371 Sum Of Two Integer](https://leetcode.com/problems/sum-of-two-integers/) |[sum_of_two_integer.py](/BitManipulation/LC371_Sum_of_two_interger.py) |
|131| Alien Dictionary | Graph, Topological Sorting| [269. Alien Dictionary](https://leetcode.com/problems/alien-dictionary/) |[aliendictionary.py](/Graph/LC269_AlienDictionary.py) |