{"id":24282292,"url":"https://github.com/leetcode-in-erlang/leetcode-in-erlang","last_synced_at":"2025-09-25T01:31:01.525Z","repository":{"id":271070551,"uuid":"911067044","full_name":"LeetCode-in-Erlang/LeetCode-in-Erlang","owner":"LeetCode-in-Erlang","description":"Erlang-based LeetCode algorithm problem solutions, regularly updated.","archived":false,"fork":false,"pushed_at":"2025-01-13T16:48:13.000Z","size":54,"stargazers_count":0,"open_issues_count":0,"forks_count":2,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-13T17:48:12.475Z","etag":null,"topics":["algorithm","algorithm-competitions","algorithms-and-data-structures","dynamic-programming","erlang","interview-questions","leetcode","leetcode-erlang","leetcode-solutions","math"],"latest_commit_sha":null,"homepage":"https://leetcode-in-erlang.github.io","language":"Erlang","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/LeetCode-in-Erlang.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2025-01-02T07:00:14.000Z","updated_at":"2025-01-13T16:48:17.000Z","dependencies_parsed_at":"2025-01-05T09:27:24.569Z","dependency_job_id":"44c8b27d-2a3c-45b8-bdb8-8c0913a0c56e","html_url":"https://github.com/LeetCode-in-Erlang/LeetCode-in-Erlang","commit_stats":null,"previous_names":["leetcode-in-erlang/leetcode-in-erlang"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LeetCode-in-Erlang%2FLeetCode-in-Erlang","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LeetCode-in-Erlang%2FLeetCode-in-Erlang/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LeetCode-in-Erlang%2FLeetCode-in-Erlang/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LeetCode-in-Erlang%2FLeetCode-in-Erlang/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/LeetCode-in-Erlang","download_url":"https://codeload.github.com/LeetCode-in-Erlang/LeetCode-in-Erlang/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":234143437,"owners_count":18786160,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","algorithm-competitions","algorithms-and-data-structures","dynamic-programming","erlang","interview-questions","leetcode","leetcode-erlang","leetcode-solutions","math"],"created_at":"2025-01-16T03:20:29.802Z","updated_at":"2025-09-25T01:31:01.517Z","avatar_url":"https://github.com/LeetCode-in-Erlang.png","language":"Erlang","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode-in-Erlang\n\n[![MIT License](https://img.shields.io/badge/license-MIT-green.svg)](https://github.com/LeetCode-in-Erlang/LeetCode-in-Erlang/blob/main/LICENSE)\n[![](https://img.shields.io/github/stars/LeetCode-in-Erlang/LeetCode-in-Erlang?style=flat-square)](https://github.com/LeetCode-in-Erlang/LeetCode-in-Erlang)\n[![](https://img.shields.io/github/forks/LeetCode-in-Erlang/LeetCode-in-Erlang?style=flat-square)](https://github.com/LeetCode-in-Erlang/LeetCode-in-Erlang/fork)\n\nErlang-based LeetCode algorithm problem solutions, regularly updated.\n\n\u003e [\"For coding interview preparation, LeetCode is one of the best online resource providing a rich library of more than 300 real coding interview questions for you to practice from using one of the 7 supported languages - C, C++, Java, Python, C#, JavaScript, Ruby.\"](https://www.quora.com/How-effective-is-Leetcode-for-preparing-for-technical-interviews)\n\n##\n* [Dynamic Programming I](#dynamic-programming-i)\n* [Programming Skills I](#programming-skills-i)\n* [Programming Skills II](#programming-skills-ii)\n* [Graph Theory I](#graph-theory-i)\n* [SQL I](#sql-i)\n* [Level 1](#level-1)\n* [Level 2](#level-2)\n* [Udemy](#udemy)\n* [Top Interview 150](#top-interview-150)\n* [Data Structure I](#data-structure-i)\n* [Data Structure II](#data-structure-ii)\n* [Algorithm I](#algorithm-i)\n* [Algorithm II](#algorithm-ii)\n* [Binary Search I](#binary-search-i)\n* [Binary Search II](#binary-search-ii)\n\n### Dynamic Programming I\n\n#### Day 1\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 2\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0070 |[Climbing Stairs](src/main/erlang/g0001_0100/s0070_climbing_stairs/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n\n#### Day 3\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0198 |[House Robber](src/main/erlang/g0101_0200/s0198_house_robber/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n\n#### Day 4\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0055 |[Jump Game](src/main/erlang/g0001_0100/s0055_jump_game/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00\n| 0045 |[Jump Game II](src/main/erlang/g0001_0100/s0045_jump_game_ii/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 488 | 100.00\n\n#### Day 5\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0053 |[Maximum Subarray](src/main/erlang/g0001_0100/s0053_maximum_subarray/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 4 | 100.00\n\n#### Day 6\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0152 |[Maximum Product Subarray](src/main/erlang/g0101_0200/s0152_maximum_product_subarray/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00\n\n#### Day 7\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0121 |[Best Time to Buy and Sell Stock](src/main/erlang/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 89 | 100.00\n\n#### Day 8\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 9\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0139 |[Word Break](src/main/erlang/g0101_0200/s0139_word_break/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\\*N)_Space_O(M+N+max) | 1 | 100.00\n| 0042 |[Trapping Rain Water](src/main/erlang/g0001_0100/s0042_trapping_rain_water/Solution.erl)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00\n\n#### Day 10\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 11\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0096 |[Unique Binary Search Trees](src/main/erlang/g0001_0100/s0096_unique_binary_search_trees/Solution.erl)| Medium | Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00\n\n#### Day 12\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 13\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 14\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 15\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0062 |[Unique Paths](src/main/erlang/g0001_0100/s0062_unique_paths/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Big_O_Time_O(m\\*n)_Space_O(m\\*n) | 0 | 100.00\n\n#### Day 16\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0221 |[Maximal Square](src/main/erlang/g0201_0300/s0221_maximal_square/Solution.erl)| Medium | Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\\*n)_Space_O(m\\*n) | 3221 | 100.00\n\n#### Day 17\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0005 |[Longest Palindromic Substring](src/main/erlang/g0001_0100/s0005_longest_palindromic_substring/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 179 | 100.00\n\n#### Day 18\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0300 |[Longest Increasing Subsequence](src/main/erlang/g0201_0300/s0300_longest_increasing_subsequence/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\\*log_n)_Space_O(n) | 954 | 100.00\n\n#### Day 19\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 1143 |[Longest Common Subsequence](src/main/erlang/g1101_1200/s1143_longest_common_subsequence/Solution.erl)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n\\*m)_Space_O(n\\*m) | 2600 | 100.00\n| 0072 |[Edit Distance](src/main/erlang/g0001_0100/s0072_edit_distance/Solution.erl)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 251 | 100.00\n\n#### Day 20\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0322 |[Coin Change](src/main/erlang/g0301_0400/s0322_coin_change/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\\*n)_Space_O(amount) | 797 | 100.00\n\n#### Day 21\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n### Programming Skills I\n\n#### Day 1 Basic Data Type\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 2 Operator\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 3 Conditional Statements\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 4 Loop\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 5 Function\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 6 Array\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 7 Array\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 8 String\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 9 String\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 10 Linked List and Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0104 |[Maximum Depth of Binary Tree](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00\n\n#### Day 11 Containers and Libraries\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 12 Class and Object\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n### Programming Skills II\n\n#### Day 1\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 2\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 3\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 4\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 5\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 6\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0739 |[Daily Temperatures](src/main/erlang/g0701_0800/s0739_daily_temperatures/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, LeetCode_75_Monotonic_Stack, Big_O_Time_O(n)_Space_O(n) | 94 | 100.00\n\n#### Day 7\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 8\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 9\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 10\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 11\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0049 |[Group Anagrams](src/main/erlang/g0001_0100/s0049_group_anagrams/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\\*k_log_k)_Space_O(n) | 13 | 90.00\n\n#### Day 12\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0438 |[Find All Anagrams in a String](src/main/erlang/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.erl)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1) | 43 | 100.00\n\n#### Day 13\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 14\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 15\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0002 |[Add Two Numbers](src/main/erlang/g0001_0100/s0002_add_two_numbers/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 1 | 77.78\n\n#### Day 16\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 17\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 18\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0155 |[Min Stack](src/main/erlang/g0101_0200/s0155_min_stack/MinStack.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 16 | 100.00\n\n#### Day 19\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 20\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n### Graph Theory I\n\n#### Day 1 Matrix Related Problems\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0200 |[Number of Islands](src/main/erlang/g0101_0200/s0200_number_of_islands/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\\*N)_Space_O(M\\*N) | 350 | 100.00\n\n#### Day 2 Matrix Related Problems\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 3 Matrix Related Problems\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 4 Matrix Related Problems\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 5 Matrix Related Problems\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 6 Matrix Related Problems\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 7 Standard Traversal\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 8 Standard Traversal\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 9 Standard Traversal\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 10 Standard Traversal\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 11 Breadth First Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 12 Breadth First Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 13 Graph Theory\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 14 Graph Theory\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n### SQL I\n\n#### Day 1 Select\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 2 Select and Order\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 3 String Processing Functions\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 4 Union and Select\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 5 Union\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 6 Union\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 7 Function\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 8 Function\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 9 Control of Flow\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 10 Where\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n### Level 1\n\n#### Day 1 Prefix Sum\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 2 String\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 3 Linked List\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0021 |[Merge Two Sorted Lists](src/main/erlang/g0001_0100/s0021_merge_two_sorted_lists/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00\n| 0206 |[Reverse Linked List](src/main/erlang/g0201_0300/s0206_reverse_linked_list/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00\n\n#### Day 4 Linked List\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 5 Greedy\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0121 |[Best Time to Buy and Sell Stock](src/main/erlang/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 89 | 100.00\n\n#### Day 6 Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0102 |[Binary Tree Level Order Traversal](src/main/erlang/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 12 | 100.00\n\n#### Day 7 Binary Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 8 Binary Search Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0098 |[Validate Binary Search Tree](src/main/erlang/g0001_0100/s0098_validate_binary_search_tree/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00\n\n#### Day 9 Graph/BFS/DFS\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0200 |[Number of Islands](src/main/erlang/g0101_0200/s0200_number_of_islands/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\\*N)_Space_O(M\\*N) | 350 | 100.00\n\n#### Day 10 Dynamic Programming\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0070 |[Climbing Stairs](src/main/erlang/g0001_0100/s0070_climbing_stairs/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n\n#### Day 11 Dynamic Programming\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0062 |[Unique Paths](src/main/erlang/g0001_0100/s0062_unique_paths/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Big_O_Time_O(m\\*n)_Space_O(m\\*n) | 0 | 100.00\n\n#### Day 12 Sliding Window/Two Pointer\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0438 |[Find All Anagrams in a String](src/main/erlang/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.erl)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1) | 43 | 100.00\n\n#### Day 13 Hashmap\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0001 |[Two Sum](src/main/erlang/g0001_0100/s0001_two_sum/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 3 | 97.50\n\n#### Day 14 Stack\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0394 |[Decode String](src/main/erlang/g0301_0400/s0394_decode_string/Solution.erl)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n\n#### Day 15 Heap\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n### Level 2\n\n#### Day 1 Implementation/Simulation\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 2 String\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 3 Linked List\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0019 |[Remove Nth Node From End of List](src/main/erlang/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00\n| 0234 |[Palindrome Linked List](src/main/erlang/g0201_0300/s0234_palindrome_linked_list/Solution.erl)| Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 25 | 100.00\n\n#### Day 4 Linked List\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0148 |[Sort List](src/main/erlang/g0101_0200/s0148_sort_list/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(log(N))_Space_O(log(N)) | 43 | 100.00\n\n#### Day 5 Greedy\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 6 Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0226 |[Invert Binary Tree](src/main/erlang/g0201_0300/s0226_invert_binary_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n\n#### Day 7 Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0543 |[Diameter of Binary Tree](src/main/erlang/g0501_0600/s0543_diameter_of_binary_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 485 | 100.00\n| 0437 |[Path Sum III](src/main/erlang/g0401_0500/s0437_path_sum_iii/Solution.erl)| Medium | Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 45 | 100.00\n\n#### Day 8 Binary Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0074 |[Search a 2D Matrix](src/main/erlang/g0001_0100/s0074_search_a_2d_matrix/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00\n| 0033 |[Search in Rotated Sorted Array](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00\n\n#### Day 9 Binary Search Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0230 |[Kth Smallest Element in a BST](src/main/erlang/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.erl)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n\n#### Day 10 Graph/BFS/DFS\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 11 Graph/BFS/DFS\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 12 Dynamic Programming\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0198 |[House Robber](src/main/erlang/g0101_0200/s0198_house_robber/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0322 |[Coin Change](src/main/erlang/g0301_0400/s0322_coin_change/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\\*n)_Space_O(amount) | 797 | 100.00\n\n#### Day 13 Dynamic Programming\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0416 |[Partition Equal Subset Sum](src/main/erlang/g0401_0500/s0416_partition_equal_subset_sum/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Big_O_Time_O(n\\*sums)_Space_O(n\\*sums) | 585 | 100.00\n| 0152 |[Maximum Product Subarray](src/main/erlang/g0101_0200/s0152_maximum_product_subarray/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00\n\n#### Day 14 Sliding Window/Two Pointer\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0003 |[Longest Substring Without Repeating Characters](src/main/erlang/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 11 | 100.00\n\n#### Day 15 Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0101 |[Symmetric Tree](src/main/erlang/g0101_0200/s0101_symmetric_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00\n\n#### Day 16 Design\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0155 |[Min Stack](src/main/erlang/g0101_0200/s0155_min_stack/MinStack.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 16 | 100.00\n| 0208 |[Implement Trie (Prefix Tree)](src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree/Trie.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 85 | 100.00\n\n#### Day 17 Interval\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0056 |[Merge Intervals](src/main/erlang/g0001_0100/s0056_merge_intervals/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 8 | 100.00\n\n#### Day 18 Stack\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 19 Union Find\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 20 Brute Force/Backtracking\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0039 |[Combination Sum](src/main/erlang/g0001_0100/s0039_combination_sum/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 0 | 100.00\n| 0046 |[Permutations](src/main/erlang/g0001_0100/s0046_permutations/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\\*n!)_Space_O(n+n!) | 0 | 100.00\n\n### Udemy\n\n#### Udemy Integers\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0136 |[Single Number](src/main/erlang/g0101_0200/s0136_single_number/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00\n| 0007 |[Reverse Integer](src/main/erlang/g0001_0100/s0007_reverse_integer/Solution.erl)| Medium | Top_Interview_Questions, Math | 244 | 100.00\n| 0009 |[Palindrome Number](src/main/erlang/g0001_0100/s0009_palindrome_number/Solution.erl)| Easy | Math | 1 | 100.00\n\n#### Udemy Strings\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0003 |[Longest Substring Without Repeating Characters](src/main/erlang/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 11 | 100.00\n| 0020 |[Valid Parentheses](src/main/erlang/g0001_0100/s0020_valid_parentheses/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0005 |[Longest Palindromic Substring](src/main/erlang/g0001_0100/s0005_longest_palindromic_substring/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 179 | 100.00\n| 0394 |[Decode String](src/main/erlang/g0301_0400/s0394_decode_string/Solution.erl)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0049 |[Group Anagrams](src/main/erlang/g0001_0100/s0049_group_anagrams/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\\*k_log_k)_Space_O(n) | 13 | 90.00\n\n#### Udemy Binary Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0033 |[Search in Rotated Sorted Array](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00\n| 0153 |[Find Minimum in Rotated Sorted Array](src/main/erlang/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00\n\n#### Udemy Arrays\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0121 |[Best Time to Buy and Sell Stock](src/main/erlang/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 89 | 100.00\n| 0001 |[Two Sum](src/main/erlang/g0001_0100/s0001_two_sum/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 3 | 97.50\n| 0055 |[Jump Game](src/main/erlang/g0001_0100/s0055_jump_game/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00\n| 0238 |[Product of Array Except Self](src/main/erlang/g0201_0300/s0238_product_of_array_except_self/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 22 | 100.00\n| 0041 |[First Missing Positive](src/main/erlang/g0001_0100/s0041_first_missing_positive/Solution.erl)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 151 | 100.00\n| 0239 |[Sliding Window Maximum](src/main/erlang/g0201_0300/s0239_sliding_window_maximum/Solution.erl)| Hard | Top_100_Liked_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Big_O_Time_O(n\\*k)_Space_O(n+k) | 422 | 100.00\n\n#### Udemy Two Pointers\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0042 |[Trapping Rain Water](src/main/erlang/g0001_0100/s0042_trapping_rain_water/Solution.erl)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00\n| 0015 |[3Sum](src/main/erlang/g0001_0100/s0015_3sum/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\\*log(n))_Space_O(n^2) | 1387 | 100.00\n\n#### Udemy Famous Algorithm\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0053 |[Maximum Subarray](src/main/erlang/g0001_0100/s0053_maximum_subarray/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 4 | 100.00\n| 0169 |[Majority Element](src/main/erlang/g0101_0200/s0169_majority_element/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00\n\n#### Udemy Sorting Algorithms\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Udemy 2D Arrays/Matrix\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0074 |[Search a 2D Matrix](src/main/erlang/g0001_0100/s0074_search_a_2d_matrix/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00\n| 0056 |[Merge Intervals](src/main/erlang/g0001_0100/s0056_merge_intervals/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 8 | 100.00\n\n#### Udemy Linked List\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0024 |[Swap Nodes in Pairs](src/main/erlang/g0001_0100/s0024_swap_nodes_in_pairs/Solution.erl)| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00\n| 0206 |[Reverse Linked List](src/main/erlang/g0201_0300/s0206_reverse_linked_list/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00\n| 0021 |[Merge Two Sorted Lists](src/main/erlang/g0001_0100/s0021_merge_two_sorted_lists/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00\n| 0234 |[Palindrome Linked List](src/main/erlang/g0201_0300/s0234_palindrome_linked_list/Solution.erl)| Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 25 | 100.00\n| 0146 |[LRU Cache](src/main/erlang/g0101_0200/s0146_lru_cache/LRUCache.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 312 | 100.00\n\n#### Udemy Tree Stack Queue\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0094 |[Binary Tree Inorder Traversal](src/main/erlang/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0102 |[Binary Tree Level Order Traversal](src/main/erlang/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 12 | 100.00\n| 0543 |[Diameter of Binary Tree](src/main/erlang/g0501_0600/s0543_diameter_of_binary_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 485 | 100.00\n| 0226 |[Invert Binary Tree](src/main/erlang/g0201_0300/s0226_invert_binary_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0104 |[Maximum Depth of Binary Tree](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00\n| 0124 |[Binary Tree Maximum Path Sum](src/main/erlang/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.erl)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 4 | 100.00\n| 0098 |[Validate Binary Search Tree](src/main/erlang/g0001_0100/s0098_validate_binary_search_tree/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00\n\n#### Udemy Trie and Heap\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0208 |[Implement Trie (Prefix Tree)](src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree/Trie.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 85 | 100.00\n\n#### Udemy Graph\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0200 |[Number of Islands](src/main/erlang/g0101_0200/s0200_number_of_islands/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\\*N)_Space_O(M\\*N) | 350 | 100.00\n\n#### Udemy Dynamic Programming\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0139 |[Word Break](src/main/erlang/g0101_0200/s0139_word_break/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\\*N)_Space_O(M+N+max) | 1 | 100.00\n| 0152 |[Maximum Product Subarray](src/main/erlang/g0101_0200/s0152_maximum_product_subarray/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00\n| 0198 |[House Robber](src/main/erlang/g0101_0200/s0198_house_robber/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0070 |[Climbing Stairs](src/main/erlang/g0001_0100/s0070_climbing_stairs/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0300 |[Longest Increasing Subsequence](src/main/erlang/g0201_0300/s0300_longest_increasing_subsequence/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\\*log_n)_Space_O(n) | 954 | 100.00\n| 1143 |[Longest Common Subsequence](src/main/erlang/g1101_1200/s1143_longest_common_subsequence/Solution.erl)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n\\*m)_Space_O(n\\*m) | 2600 | 100.00\n| 0072 |[Edit Distance](src/main/erlang/g0001_0100/s0072_edit_distance/Solution.erl)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 251 | 100.00\n| 0010 |[Regular Expression Matching](src/main/erlang/g0001_0100/s0010_regular_expression_matching/Solution.erl)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\\*n)_Space_O(m\\*n) | 2019 | 100.00\n\n#### Udemy Backtracking/Recursion\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0022 |[Generate Parentheses](src/main/erlang/g0001_0100/s0022_generate_parentheses/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 0 | 100.00\n| 0039 |[Combination Sum](src/main/erlang/g0001_0100/s0039_combination_sum/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 0 | 100.00\n| 0078 |[Subsets](src/main/erlang/g0001_0100/s0078_subsets/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n\\*2^n) | 0 | 100.00\n| 0017 |[Letter Combinations of a Phone Number](src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00\n| 0046 |[Permutations](src/main/erlang/g0001_0100/s0046_permutations/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\\*n!)_Space_O(n+n!) | 0 | 100.00\n\n#### Udemy Bit Manipulation\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0338 |[Counting Bits](src/main/erlang/g0301_0400/s0338_counting_bits/Solution.erl)| Easy | Dynamic_Programming, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 38 | 100.00\n\n#### Udemy Design\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0155 |[Min Stack](src/main/erlang/g0101_0200/s0155_min_stack/MinStack.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 16 | 100.00\n\n### Top Interview 150\n\n#### Top Interview 150 Array/String\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0169 |[Majority Element](src/main/erlang/g0101_0200/s0169_majority_element/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00\n| 0121 |[Best Time to Buy and Sell Stock](src/main/erlang/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 89 | 100.00\n| 0055 |[Jump Game](src/main/erlang/g0001_0100/s0055_jump_game/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00\n| 0045 |[Jump Game II](src/main/erlang/g0001_0100/s0045_jump_game_ii/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 488 | 100.00\n| 0238 |[Product of Array Except Self](src/main/erlang/g0201_0300/s0238_product_of_array_except_self/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 22 | 100.00\n| 0042 |[Trapping Rain Water](src/main/erlang/g0001_0100/s0042_trapping_rain_water/Solution.erl)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00\n| 0006 |[Zigzag Conversion](src/main/erlang/g0001_0100/s0006_zigzag_conversion/Solution.erl)| Medium | String | 203 | 100.00\n\n#### Top Interview 150 Two Pointers\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0011 |[Container With Most Water](src/main/erlang/g0001_0100/s0011_container_with_most_water/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 13 | 100.00\n| 0015 |[3Sum](src/main/erlang/g0001_0100/s0015_3sum/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\\*log(n))_Space_O(n^2) | 1387 | 100.00\n\n#### Top Interview 150 Sliding Window\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0003 |[Longest Substring Without Repeating Characters](src/main/erlang/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 11 | 100.00\n\n#### Top Interview 150 Matrix\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Top Interview 150 Hashmap\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0049 |[Group Anagrams](src/main/erlang/g0001_0100/s0049_group_anagrams/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\\*k_log_k)_Space_O(n) | 13 | 90.00\n| 0001 |[Two Sum](src/main/erlang/g0001_0100/s0001_two_sum/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 3 | 97.50\n| 0128 |[Longest Consecutive Sequence](src/main/erlang/g0101_0200/s0128_longest_consecutive_sequence/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find, Big_O_Time_O(N_log_N)_Space_O(1) | 42 | 100.00\n\n#### Top Interview 150 Intervals\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0056 |[Merge Intervals](src/main/erlang/g0001_0100/s0056_merge_intervals/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 8 | 100.00\n\n#### Top Interview 150 Stack\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0020 |[Valid Parentheses](src/main/erlang/g0001_0100/s0020_valid_parentheses/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0155 |[Min Stack](src/main/erlang/g0101_0200/s0155_min_stack/MinStack.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 16 | 100.00\n\n#### Top Interview 150 Linked List\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0002 |[Add Two Numbers](src/main/erlang/g0001_0100/s0002_add_two_numbers/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 1 | 77.78\n| 0021 |[Merge Two Sorted Lists](src/main/erlang/g0001_0100/s0021_merge_two_sorted_lists/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00\n| 0019 |[Remove Nth Node From End of List](src/main/erlang/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00\n| 0146 |[LRU Cache](src/main/erlang/g0101_0200/s0146_lru_cache/LRUCache.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 312 | 100.00\n\n#### Top Interview 150 Binary Tree General\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0104 |[Maximum Depth of Binary Tree](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00\n| 0226 |[Invert Binary Tree](src/main/erlang/g0201_0300/s0226_invert_binary_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0101 |[Symmetric Tree](src/main/erlang/g0101_0200/s0101_symmetric_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00\n| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src/main/erlang/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Big_O_Time_O(N)_Space_O(N) | 169 | 100.00\n| 0124 |[Binary Tree Maximum Path Sum](src/main/erlang/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.erl)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 4 | 100.00\n\n#### Top Interview 150 Binary Tree BFS\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0102 |[Binary Tree Level Order Traversal](src/main/erlang/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 12 | 100.00\n\n#### Top Interview 150 Binary Search Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0230 |[Kth Smallest Element in a BST](src/main/erlang/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.erl)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0098 |[Validate Binary Search Tree](src/main/erlang/g0001_0100/s0098_validate_binary_search_tree/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00\n\n#### Top Interview 150 Graph General\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0200 |[Number of Islands](src/main/erlang/g0101_0200/s0200_number_of_islands/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\\*N)_Space_O(M\\*N) | 350 | 100.00\n| 0207 |[Course Schedule](src/main/erlang/g0201_0300/s0207_course_schedule/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Big_O_Time_O(N)_Space_O(N) | 220 | 100.00\n\n#### Top Interview 150 Graph BFS\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Top Interview 150 Trie\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0208 |[Implement Trie (Prefix Tree)](src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree/Trie.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 85 | 100.00\n\n#### Top Interview 150 Backtracking\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0017 |[Letter Combinations of a Phone Number](src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00\n| 0046 |[Permutations](src/main/erlang/g0001_0100/s0046_permutations/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\\*n!)_Space_O(n+n!) | 0 | 100.00\n| 0039 |[Combination Sum](src/main/erlang/g0001_0100/s0039_combination_sum/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 0 | 100.00\n| 0022 |[Generate Parentheses](src/main/erlang/g0001_0100/s0022_generate_parentheses/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 0 | 100.00\n| 0079 |[Word Search](src/main/erlang/g0001_0100/s0079_word_search/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m\\*n))_Space_O(m\\*n) | 7 | 100.00\n\n#### Top Interview 150 Divide and Conquer\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0148 |[Sort List](src/main/erlang/g0101_0200/s0148_sort_list/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(log(N))_Space_O(log(N)) | 43 | 100.00\n| 0023 |[Merge k Sorted Lists](src/main/erlang/g0001_0100/s0023_merge_k_sorted_lists/Solution.erl)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Heap_Priority_Queue, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(k\\*n\\*log(k))_Space_O(log(k)) | 93 | 100.00\n\n#### Top Interview 150 Kadane's Algorithm\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0053 |[Maximum Subarray](src/main/erlang/g0001_0100/s0053_maximum_subarray/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 4 | 100.00\n\n#### Top Interview 150 Binary Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0035 |[Search Insert Position](src/main/erlang/g0001_0100/s0035_search_insert_position/Solution.erl)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00\n| 0074 |[Search a 2D Matrix](src/main/erlang/g0001_0100/s0074_search_a_2d_matrix/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00\n| 0033 |[Search in Rotated Sorted Array](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00\n| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/erlang/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 1 | 100.00\n| 0153 |[Find Minimum in Rotated Sorted Array](src/main/erlang/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00\n| 0004 |[Median of Two Sorted Arrays](src/main/erlang/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.erl)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer, Big_O_Time_O(log(min(N,M)))_Space_O(1), AI_can_be_used_to_solve_the_task | 1 | 100.00\n\n#### Top Interview 150 Heap\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0215 |[Kth Largest Element in an Array](src/main/erlang/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, LeetCode_75_Heap/Priority_Queue, Big_O_Time_O(n\\*log(n))_Space_O(log(n)) | 803 | 100.00\n\n#### Top Interview 150 Bit Manipulation\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0136 |[Single Number](src/main/erlang/g0101_0200/s0136_single_number/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00\n\n#### Top Interview 150 Math\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0009 |[Palindrome Number](src/main/erlang/g0001_0100/s0009_palindrome_number/Solution.erl)| Easy | Math | 1 | 100.00\n\n#### Top Interview 150 1D DP\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0070 |[Climbing Stairs](src/main/erlang/g0001_0100/s0070_climbing_stairs/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0198 |[House Robber](src/main/erlang/g0101_0200/s0198_house_robber/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0139 |[Word Break](src/main/erlang/g0101_0200/s0139_word_break/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\\*N)_Space_O(M+N+max) | 1 | 100.00\n| 0322 |[Coin Change](src/main/erlang/g0301_0400/s0322_coin_change/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\\*n)_Space_O(amount) | 797 | 100.00\n| 0300 |[Longest Increasing Subsequence](src/main/erlang/g0201_0300/s0300_longest_increasing_subsequence/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\\*log_n)_Space_O(n) | 954 | 100.00\n\n#### Top Interview 150 Multidimensional DP\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0005 |[Longest Palindromic Substring](src/main/erlang/g0001_0100/s0005_longest_palindromic_substring/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 179 | 100.00\n| 0072 |[Edit Distance](src/main/erlang/g0001_0100/s0072_edit_distance/Solution.erl)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 251 | 100.00\n| 0221 |[Maximal Square](src/main/erlang/g0201_0300/s0221_maximal_square/Solution.erl)| Medium | Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\\*n)_Space_O(m\\*n) | 3221 | 100.00\n\n### Data Structure I\n\n#### Day 1 Array\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0053 |[Maximum Subarray](src/main/erlang/g0001_0100/s0053_maximum_subarray/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 4 | 100.00\n\n#### Day 2 Array\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0001 |[Two Sum](src/main/erlang/g0001_0100/s0001_two_sum/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 3 | 97.50\n\n#### Day 3 Array\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0121 |[Best Time to Buy and Sell Stock](src/main/erlang/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 89 | 100.00\n\n#### Day 4 Array\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 5 Array\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0074 |[Search a 2D Matrix](src/main/erlang/g0001_0100/s0074_search_a_2d_matrix/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00\n\n#### Day 6 String\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 7 Linked List\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0021 |[Merge Two Sorted Lists](src/main/erlang/g0001_0100/s0021_merge_two_sorted_lists/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00\n\n#### Day 8 Linked List\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0206 |[Reverse Linked List](src/main/erlang/g0201_0300/s0206_reverse_linked_list/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00\n\n#### Day 9 Stack Queue\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0020 |[Valid Parentheses](src/main/erlang/g0001_0100/s0020_valid_parentheses/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n\n#### Day 10 Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0094 |[Binary Tree Inorder Traversal](src/main/erlang/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n\n#### Day 11 Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0102 |[Binary Tree Level Order Traversal](src/main/erlang/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 12 | 100.00\n| 0104 |[Maximum Depth of Binary Tree](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00\n| 0101 |[Symmetric Tree](src/main/erlang/g0101_0200/s0101_symmetric_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00\n\n#### Day 12 Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0226 |[Invert Binary Tree](src/main/erlang/g0201_0300/s0226_invert_binary_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n\n#### Day 13 Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 14 Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0098 |[Validate Binary Search Tree](src/main/erlang/g0001_0100/s0098_validate_binary_search_tree/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00\n\n### Data Structure II\n\n#### Day 1 Array\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0136 |[Single Number](src/main/erlang/g0101_0200/s0136_single_number/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00\n| 0169 |[Majority Element](src/main/erlang/g0101_0200/s0169_majority_element/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00\n| 0015 |[3Sum](src/main/erlang/g0001_0100/s0015_3sum/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\\*log(n))_Space_O(n^2) | 1387 | 100.00\n\n#### Day 2 Array\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0056 |[Merge Intervals](src/main/erlang/g0001_0100/s0056_merge_intervals/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 8 | 100.00\n\n#### Day 3 Array\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 4 Array\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 5 Array\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0238 |[Product of Array Except Self](src/main/erlang/g0201_0300/s0238_product_of_array_except_self/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 22 | 100.00\n| 0560 |[Subarray Sum Equals K](src/main/erlang/g0501_0600/s0560_subarray_sum_equals_k/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Big_O_Time_O(n)_Space_O(n) | 47 | 100.00\n\n#### Day 6 String\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 7 String\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0763 |[Partition Labels](src/main/erlang/g0701_0800/s0763_partition_labels/Solution.erl)| Medium | String, Hash_Table, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 5 | 100.00\n\n#### Day 8 String\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0049 |[Group Anagrams](src/main/erlang/g0001_0100/s0049_group_anagrams/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\\*k_log_k)_Space_O(n) | 13 | 90.00\n\n#### Day 9 String\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0005 |[Longest Palindromic Substring](src/main/erlang/g0001_0100/s0005_longest_palindromic_substring/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 179 | 100.00\n\n#### Day 10 Linked List\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0002 |[Add Two Numbers](src/main/erlang/g0001_0100/s0002_add_two_numbers/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 1 | 77.78\n\n#### Day 11 Linked List\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 12 Linked List\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0024 |[Swap Nodes in Pairs](src/main/erlang/g0001_0100/s0024_swap_nodes_in_pairs/Solution.erl)| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00\n\n#### Day 13 Linked List\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 14 Stack Queue\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0155 |[Min Stack](src/main/erlang/g0101_0200/s0155_min_stack/MinStack.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 16 | 100.00\n\n#### Day 15 Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src/main/erlang/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Big_O_Time_O(N)_Space_O(N) | 169 | 100.00\n\n#### Day 16 Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 17 Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0230 |[Kth Smallest Element in a BST](src/main/erlang/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.erl)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n\n#### Day 18 Tree\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 19 Graph\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 20 Heap Priority Queue\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0215 |[Kth Largest Element in an Array](src/main/erlang/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, LeetCode_75_Heap/Priority_Queue, Big_O_Time_O(n\\*log(n))_Space_O(log(n)) | 803 | 100.00\n| 0347 |[Top K Frequent Elements](src/main/erlang/g0301_0400/s0347_top_k_frequent_elements/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Big_O_Time_O(n\\*log(n))_Space_O(k) | 12 | 100.00\n\n#### Day 21 Heap Priority Queue\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n### Algorithm I\n\n#### Day 1 Binary Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0035 |[Search Insert Position](src/main/erlang/g0001_0100/s0035_search_insert_position/Solution.erl)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00\n\n#### Day 2 Two Pointers\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 3 Two Pointers\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 4 Two Pointers\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 5 Two Pointers\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0019 |[Remove Nth Node From End of List](src/main/erlang/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00\n\n#### Day 6 Sliding Window\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0003 |[Longest Substring Without Repeating Characters](src/main/erlang/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 11 | 100.00\n\n#### Day 7 Breadth First Search Depth First Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 8 Breadth First Search Depth First Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 9 Breadth First Search Depth First Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 10 Recursion Backtracking\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0021 |[Merge Two Sorted Lists](src/main/erlang/g0001_0100/s0021_merge_two_sorted_lists/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00\n| 0206 |[Reverse Linked List](src/main/erlang/g0201_0300/s0206_reverse_linked_list/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00\n\n#### Day 11 Recursion Backtracking\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0046 |[Permutations](src/main/erlang/g0001_0100/s0046_permutations/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\\*n!)_Space_O(n+n!) | 0 | 100.00\n\n#### Day 12 Dynamic Programming\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0070 |[Climbing Stairs](src/main/erlang/g0001_0100/s0070_climbing_stairs/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0198 |[House Robber](src/main/erlang/g0101_0200/s0198_house_robber/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n\n#### Day 13 Bit Manipulation\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 14 Bit Manipulation\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0136 |[Single Number](src/main/erlang/g0101_0200/s0136_single_number/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00\n\n### Algorithm II\n\n#### Day 1 Binary Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/erlang/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 1 | 100.00\n| 0033 |[Search in Rotated Sorted Array](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00\n| 0074 |[Search a 2D Matrix](src/main/erlang/g0001_0100/s0074_search_a_2d_matrix/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00\n\n#### Day 2 Binary Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0153 |[Find Minimum in Rotated Sorted Array](src/main/erlang/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00\n\n#### Day 3 Two Pointers\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0015 |[3Sum](src/main/erlang/g0001_0100/s0015_3sum/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\\*log(n))_Space_O(n^2) | 1387 | 100.00\n\n#### Day 4 Two Pointers\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0011 |[Container With Most Water](src/main/erlang/g0001_0100/s0011_container_with_most_water/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 13 | 100.00\n\n#### Day 5 Sliding Window\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0438 |[Find All Anagrams in a String](src/main/erlang/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.erl)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1) | 43 | 100.00\n\n#### Day 6 Breadth First Search Depth First Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0200 |[Number of Islands](src/main/erlang/g0101_0200/s0200_number_of_islands/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\\*N)_Space_O(M\\*N) | 350 | 100.00\n\n#### Day 7 Breadth First Search Depth First Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 8 Breadth First Search Depth First Search\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 9 Recursion Backtracking\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0078 |[Subsets](src/main/erlang/g0001_0100/s0078_subsets/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n\\*2^n) | 0 | 100.00\n\n#### Day 10 Recursion Backtracking\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0039 |[Combination Sum](src/main/erlang/g0001_0100/s0039_combination_sum/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 0 | 100.00\n\n#### Day 11 Recursion Backtracking\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0017 |[Letter Combinations of a Phone Number](src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00\n| 0022 |[Generate Parentheses](src/main/erlang/g0001_0100/s0022_generate_parentheses/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 0 | 100.00\n| 0079 |[Word Search](src/main/erlang/g0001_0100/s0079_word_search/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m\\*n))_Space_O(m\\*n) | 7 | 100.00\n\n#### Day 12 Dynamic Programming\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0055 |[Jump Game](src/main/erlang/g0001_0100/s0055_jump_game/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00\n\n#### Day 13 Dynamic Programming\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0045 |[Jump Game II](src/main/erlang/g0001_0100/s0045_jump_game_ii/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 488 | 100.00\n| 0062 |[Unique Paths](src/main/erlang/g0001_0100/s0062_unique_paths/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Big_O_Time_O(m\\*n)_Space_O(m\\*n) | 0 | 100.00\n\n#### Day 14 Dynamic Programming\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0005 |[Longest Palindromic Substring](src/main/erlang/g0001_0100/s0005_longest_palindromic_substring/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 179 | 100.00\n\n#### Day 15 Dynamic Programming\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0139 |[Word Break](src/main/erlang/g0101_0200/s0139_word_break/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\\*N)_Space_O(M+N+max) | 1 | 100.00\n\n#### Day 16 Dynamic Programming\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0300 |[Longest Increasing Subsequence](src/main/erlang/g0201_0300/s0300_longest_increasing_subsequence/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\\*log_n)_Space_O(n) | 954 | 100.00\n\n#### Day 17 Dynamic Programming\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 1143 |[Longest Common Subsequence](src/main/erlang/g1101_1200/s1143_longest_common_subsequence/Solution.erl)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n\\*m)_Space_O(n\\*m) | 2600 | 100.00\n\n#### Day 18 Dynamic Programming\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0072 |[Edit Distance](src/main/erlang/g0001_0100/s0072_edit_distance/Solution.erl)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 251 | 100.00\n| 0322 |[Coin Change](src/main/erlang/g0301_0400/s0322_coin_change/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\\*n)_Space_O(amount) | 797 | 100.00\n\n#### Day 19 Bit Manipulation\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 20 Others\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 21 Others\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n### Binary Search I\n\n#### Day 1\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 2\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0035 |[Search Insert Position](src/main/erlang/g0001_0100/s0035_search_insert_position/Solution.erl)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00\n\n#### Day 3\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 4\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 5\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/erlang/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 1 | 100.00\n\n#### Day 6\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 7\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 8\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0074 |[Search a 2D Matrix](src/main/erlang/g0001_0100/s0074_search_a_2d_matrix/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00\n\n#### Day 9\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 10\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 11\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0033 |[Search in Rotated Sorted Array](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00\n\n#### Day 12\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0153 |[Find Minimum in Rotated Sorted Array](src/main/erlang/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00\n\n### Binary Search II\n\n#### Day 1\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 2\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 3\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0300 |[Longest Increasing Subsequence](src/main/erlang/g0201_0300/s0300_longest_increasing_subsequence/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\\*log_n)_Space_O(n) | 954 | 100.00\n\n#### Day 4\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 5\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n| 0287 |[Find the Duplicate Number](src/main/erlang/g0201_0300/s0287_find_the_duplicate_number/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 234 | 100.00\n\n#### Day 6\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 7\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 8\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 9\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 10\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 11\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 12\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 13\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 14\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 15\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 16\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 17\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 18\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 19\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n#### Day 20\n\n| \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e | \u003c!-- --\u003e\n|-|-|-|-|-|-\n\n## Algorithms\n\n| #    |      Title     | Difficulty  | Tag         | Time, ms | Time, %\n|------|----------------|-------------|-------------|----------|---------\n| 1143 |[Longest Common Subsequence](src/main/erlang/g1101_1200/s1143_longest_common_subsequence/Solution.erl)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Algorithm_II_Day_17_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Big_O_Time_O(n\\*m)_Space_O(n\\*m) | 2600 | 100.00\n| 0763 |[Partition Labels](src/main/erlang/g0701_0800/s0763_partition_labels/Solution.erl)| Medium | String, Hash_Table, Greedy, Two_Pointers, Data_Structure_II_Day_7_String, Big_O_Time_O(n)_Space_O(1) | 5 | 100.00\n| 0739 |[Daily Temperatures](src/main/erlang/g0701_0800/s0739_daily_temperatures/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, LeetCode_75_Monotonic_Stack, Programming_Skills_II_Day_6, Big_O_Time_O(n)_Space_O(n) | 94 | 100.00\n| 0647 |[Palindromic Substrings](src/main/erlang/g0601_0700/s0647_palindromic_substrings/Solution.erl)| Medium | String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n) | 17 | 100.00\n| 0560 |[Subarray Sum Equals K](src/main/erlang/g0501_0600/s0560_subarray_sum_equals_k/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Data_Structure_II_Day_5_Array, Big_O_Time_O(n)_Space_O(n) | 47 | 100.00\n| 0543 |[Diameter of Binary Tree](src/main/erlang/g0501_0600/s0543_diameter_of_binary_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 485 | 100.00\n| 0494 |[Target Sum](src/main/erlang/g0401_0500/s0494_target_sum/Solution.erl)| Medium | Array, Dynamic_Programming, Backtracking, Big_O_Time_O(n\\*(sum+s))_Space_O(n\\*(sum+s)) | 377 | 100.00\n| 0438 |[Find All Anagrams in a String](src/main/erlang/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.erl)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Programming_Skills_II_Day_12, Level_1_Day_12_Sliding_Window/Two_Pointer, Big_O_Time_O(n+m)_Space_O(1) | 43 | 100.00\n| 0437 |[Path Sum III](src/main/erlang/g0401_0500/s0437_path_sum_iii/Solution.erl)| Medium | Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Level_2_Day_7_Tree, Big_O_Time_O(n)_Space_O(n) | 45 | 100.00\n| 0416 |[Partition Equal Subset Sum](src/main/erlang/g0401_0500/s0416_partition_equal_subset_sum/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Level_2_Day_13_Dynamic_Programming, Big_O_Time_O(n\\*sums)_Space_O(n\\*sums) | 585 | 100.00\n| 0394 |[Decode String](src/main/erlang/g0301_0400/s0394_decode_string/Solution.erl)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Level_1_Day_14_Stack, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0347 |[Top K Frequent Elements](src/main/erlang/g0301_0400/s0347_top_k_frequent_elements/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Data_Structure_II_Day_20_Heap_Priority_Queue, Big_O_Time_O(n\\*log(n))_Space_O(k) | 12 | 100.00\n| 0338 |[Counting Bits](src/main/erlang/g0301_0400/s0338_counting_bits/Solution.erl)| Easy | Dynamic_Programming, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Udemy_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 38 | 100.00\n| 0322 |[Coin Change](src/main/erlang/g0301_0400/s0322_coin_change/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_20, Level_2_Day_12_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(m\\*n)_Space_O(amount) | 797 | 100.00\n| 0300 |[Longest Increasing Subsequence](src/main/erlang/g0201_0300/s0300_longest_increasing_subsequence/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Algorithm_II_Day_16_Dynamic_Programming, Binary_Search_II_Day_3, Dynamic_Programming_I_Day_18, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n\\*log_n)_Space_O(n) | 954 | 100.00\n| 0287 |[Find the Duplicate Number](src/main/erlang/g0201_0300/s0287_find_the_duplicate_number/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Binary_Search_II_Day_5, Big_O_Time_O(n)_Space_O(n) | 234 | 100.00\n| 0239 |[Sliding Window Maximum](src/main/erlang/g0201_0300/s0239_sliding_window_maximum/Solution.erl)| Hard | Top_100_Liked_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Udemy_Arrays, Big_O_Time_O(n\\*k)_Space_O(n+k) | 422 | 100.00\n| 0238 |[Product of Array Except Self](src/main/erlang/g0201_0300/s0238_product_of_array_except_self/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Data_Structure_II_Day_5_Array, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 22 | 100.00\n| 0234 |[Palindrome Linked List](src/main/erlang/g0201_0300/s0234_palindrome_linked_list/Solution.erl)| Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Level_2_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(n)_Space_O(1) | 25 | 100.00\n| 0230 |[Kth Smallest Element in a BST](src/main/erlang/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.erl)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_II_Day_17_Tree, Level_2_Day_9_Binary_Search_Tree, Top_Interview_150_Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0226 |[Invert Binary Tree](src/main/erlang/g0201_0300/s0226_invert_binary_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree, Level_2_Day_6_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0221 |[Maximal Square](src/main/erlang/g0201_0300/s0221_maximal_square/Solution.erl)| Medium | Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(m\\*n)_Space_O(m\\*n) | 3221 | 100.00\n| 0215 |[Kth Largest Element in an Array](src/main/erlang/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, LeetCode_75_Heap/Priority_Queue, Data_Structure_II_Day_20_Heap_Priority_Queue, Top_Interview_150_Heap, Big_O_Time_O(n\\*log(n))_Space_O(log(n)) | 803 | 100.00\n| 0208 |[Implement Trie (Prefix Tree)](src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree/Trie.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Level_2_Day_16_Design, Udemy_Trie_and_Heap, Top_Interview_150_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 85 | 100.00\n| 0207 |[Course Schedule](src/main/erlang/g0201_0300/s0207_course_schedule/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Top_Interview_150_Graph_General, Big_O_Time_O(N)_Space_O(N) | 220 | 100.00\n| 0206 |[Reverse Linked List](src/main/erlang/g0201_0300/s0206_reverse_linked_list/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Data_Structure_I_Day_8_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00\n| 0200 |[Number of Islands](src/main/erlang/g0101_0200/s0200_number_of_islands/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS, Udemy_Graph, Top_Interview_150_Graph_General, Big_O_Time_O(M\\*N)_Space_O(M\\*N) | 350 | 100.00\n| 0198 |[House Robber](src/main/erlang/g0101_0200/s0198_house_robber/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3, Level_2_Day_12_Dynamic_Programming, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0169 |[Majority Element](src/main/erlang/g0101_0200/s0169_majority_element/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Data_Structure_II_Day_1_Array, Udemy_Famous_Algorithm, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00\n| 0155 |[Min Stack](src/main/erlang/g0101_0200/s0155_min_stack/MinStack.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Data_Structure_II_Day_14_Stack_Queue, Programming_Skills_II_Day_18, Level_2_Day_16_Design, Udemy_Design, Top_Interview_150_Stack, Big_O_Time_O(1)_Space_O(N) | 16 | 100.00\n| 0153 |[Find Minimum in Rotated Sorted Array](src/main/erlang/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Algorithm_II_Day_2_Binary_Search, Binary_Search_I_Day_12, Udemy_Binary_Search, Top_Interview_150_Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00\n| 0152 |[Maximum Product Subarray](src/main/erlang/g0101_0200/s0152_maximum_product_subarray/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Dynamic_Programming_I_Day_6, Level_2_Day_13_Dynamic_Programming, Udemy_Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00\n| 0148 |[Sort List](src/main/erlang/g0101_0200/s0148_sort_list/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Level_2_Day_4_Linked_List, Top_Interview_150_Divide_and_Conquer, Big_O_Time_O(log(N))_Space_O(log(N)) | 43 | 100.00\n| 0146 |[LRU Cache](src/main/erlang/g0101_0200/s0146_lru_cache/LRUCache.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 312 | 100.00\n| 0139 |[Word Break](src/main/erlang/g0101_0200/s0139_word_break/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_9, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(M+max\\*N)_Space_O(M+N+max) | 1 | 100.00\n| 0136 |[Single Number](src/main/erlang/g0101_0200/s0136_single_number/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Data_Structure_II_Day_1_Array, Algorithm_I_Day_14_Bit_Manipulation, Udemy_Integers, Top_Interview_150_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00\n| 0131 |[Palindrome Partitioning](src/main/erlang/g0101_0200/s0131_palindrome_partitioning/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(N\\*2^N)_Space_O(2^N\\*N) | 24 | 100.00\n| 0128 |[Longest Consecutive Sequence](src/main/erlang/g0101_0200/s0128_longest_consecutive_sequence/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find, Top_Interview_150_Hashmap, Big_O_Time_O(N_log_N)_Space_O(1) | 42 | 100.00\n| 0124 |[Binary Tree Maximum Path Sum](src/main/erlang/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.erl)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N) | 4 | 100.00\n| 0121 |[Best Time to Buy and Sell Stock](src/main/erlang/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_3_Array, Dynamic_Programming_I_Day_7, Level_1_Day_5_Greedy, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(N)_Space_O(1) | 89 | 100.00\n| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src/main/erlang/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N) | 169 | 100.00\n| 0104 |[Maximum Depth of Binary Tree](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Data_Structure_I_Day_11_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00\n| 0102 |[Binary Tree Level Order Traversal](src/main/erlang/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_1_Day_6_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_BFS, Big_O_Time_O(N)_Space_O(N) | 12 | 100.00\n| 0101 |[Symmetric Tree](src/main/erlang/g0101_0200/s0101_symmetric_tree/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_2_Day_15_Tree, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00\n| 0098 |[Validate Binary Search Tree](src/main/erlang/g0001_0100/s0098_validate_binary_search_tree/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_14_Tree, Level_1_Day_8_Binary_Search_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00\n| 0096 |[Unique Binary Search Trees](src/main/erlang/g0001_0100/s0096_unique_binary_search_trees/Solution.erl)| Medium | Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Dynamic_Programming_I_Day_11, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00\n| 0094 |[Binary Tree Inorder Traversal](src/main/erlang/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0079 |[Word Search](src/main/erlang/g0001_0100/s0079_word_search/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Top_Interview_150_Backtracking, Big_O_Time_O(4^(m\\*n))_Space_O(m\\*n) | 7 | 100.00\n| 0078 |[Subsets](src/main/erlang/g0001_0100/s0078_subsets/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Algorithm_II_Day_9_Recursion_Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(2^n)_Space_O(n\\*2^n) | 0 | 100.00\n| 0074 |[Search a 2D Matrix](src/main/erlang/g0001_0100/s0074_search_a_2d_matrix/Solution.erl)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Data_Structure_I_Day_5_Array, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_8, Level_2_Day_8_Binary_Search, Udemy_2D_Arrays/Matrix, Top_Interview_150_Binary_Search, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00\n| 0072 |[Edit Distance](src/main/erlang/g0001_0100/s0072_edit_distance/Solution.erl)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(n^2)_Space_O(n2) | 251 | 100.00\n| 0070 |[Climbing Stairs](src/main/erlang/g0001_0100/s0070_climbing_stairs/Solution.erl)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_2, Level_1_Day_10_Dynamic_Programming, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00\n| 0062 |[Unique Paths](src/main/erlang/g0001_0100/s0062_unique_paths/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_15, Level_1_Day_11_Dynamic_Programming, Big_O_Time_O(m\\*n)_Space_O(m\\*n) | 0 | 100.00\n| 0056 |[Merge Intervals](src/main/erlang/g0001_0100/s0056_merge_intervals/Solution.erl)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Data_Structure_II_Day_2_Array,","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fleetcode-in-erlang%2Fleetcode-in-erlang","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fleetcode-in-erlang%2Fleetcode-in-erlang","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fleetcode-in-erlang%2Fleetcode-in-erlang/lists"}