{"id":17318076,"url":"https://github.com/yukunj/leetcode-practice-by-tag","last_synced_at":"2025-03-27T02:26:37.969Z","repository":{"id":156607652,"uuid":"364580604","full_name":"YukunJ/LeetCode-Practice-by-Tag","owner":"YukunJ","description":"This is the repository for LeetCode coding exercise starting May 2021.","archived":false,"fork":false,"pushed_at":"2021-11-07T22:51:25.000Z","size":3325,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-01T08:12:41.098Z","etag":null,"topics":["algorithms-and-data-structures","leetcode","python"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/YukunJ.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2021-05-05T13:10:35.000Z","updated_at":"2022-08-25T22:08:20.000Z","dependencies_parsed_at":null,"dependency_job_id":"86a4d34e-49db-4039-914b-f3b81243fd83","html_url":"https://github.com/YukunJ/LeetCode-Practice-by-Tag","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/YukunJ%2FLeetCode-Practice-by-Tag","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/YukunJ%2FLeetCode-Practice-by-Tag/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/YukunJ%2FLeetCode-Practice-by-Tag/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/YukunJ%2FLeetCode-Practice-by-Tag/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/YukunJ","download_url":"https://codeload.github.com/YukunJ/LeetCode-Practice-by-Tag/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245768535,"owners_count":20669025,"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":["algorithms-and-data-structures","leetcode","python"],"created_at":"2024-10-15T13:18:45.263Z","updated_at":"2025-03-27T02:26:37.949Z","avatar_url":"https://github.com/YukunJ.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode-Practice-by-Tag\n\nThis is the repository for LeetCode coding exercise starting May 2021. \n\nThe exercises are sorted by tag, thanks to [Windsooon](https://gist.github.com/Windsooon/e663358a6be45a93af2665206c4d4ae9)'s retagging work.\n\n------- \n\n**Hashmap**\n\n**1**. [Two Sum](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Hashmap/1-Two%20Sum.md)\n\n**13**. [Roman to Integer](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Hashmap/13-Roman%20to%20Integer.md)\n\n**36**. [Valid Soduku](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Hashmap/36-Valid%20Sudoku.md)\n\n**49**. [Group Anagrams](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Hashmap/49-Group%20Anagrams.md)\n\n**166**. [Fraction to Recurring Decimal](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Hashmap/166-Fraction%20to%20Recurring%20Decimal.md)\n\n**349**. [Intersection of Two Arrays](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Hashmap/349-Intersection%20of%20Two%20Arrays.md)\n\n**350**. [Intersection of Two Arrays II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Hashmap/350-Intersection%20of%20Two%20Arrays%20II.md)\n\n**523**. [Continuous Subarray Sum](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Hashmap/523-Continuous%20Subarray%20Sum.md)\n\n**560**. [Subarray Sum Equals K](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Hashmap/560-Subarray%20Sum%20Equals%20K.md)\n\n**953**. [Verifying an Alien Dictionary](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Hashmap/953-Verifying%20an%20Alien%20Dictionary.md)\n\n**1010**. [Pairs of Songs With Total Durations Divisible by 60](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Hashmap/1010-Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060.md)\n\n------- \n\n**Binary Search**\n\n**4**. [Median of Two Sorted Arrays](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/4-Median%20of%20Two%20Sorted%20Arrays.md)\n\n**29**. [Divide Two Integers](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/29-Divide%20Two%20Integers.md)\n\n**33**. [Search in Rotated Sorted Array](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/33-Search%20in%20Rotated%20Sorted%20Array.md)\n\n**34**. [Find First and Last Position of Element in Sorted Array](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/34-Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array.md)\n\n**35**. [Search Insert Position](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/35-Search%20Insert%20Position.md)\n\n**57**. [Insert Intervals](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/57-Insert%20Intervals.md)\n\n**81**. [Search in Rotated Sorted Array II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/81-Search%20in%20Rotated%20Sorted%20Array%20II.md)\n\n**153**. [Find Minimum in Rotated Sorted Array](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/153-Find%20Minimum%20in%20Rotated%20Sorted%20Array.md)\n\n**154**. [Find Minimum in Rotated Sorted Array II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/154-Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II.md)\n\n**162**. [Find Peak Element](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/162-Find%20Peak%20Element.md)\n\n**240**. [Search a 2D Matrix II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/240-Search%20a%202D%20Matrix%20II.md)\n\n**287**. [Find the Duplicate Number](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/287-Find%20the%20Duplicate%20Number.md)\n\n**528**. [Random Pick With Weight](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/528-Random%20Pick%20with%20Weight.md)\n\n**710**. [Random Pick with Blacklist](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/710-Random%20Pick%20with%20Blacklist.md)\n\n**1539**. [Kth Missing Positive Number](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/1539-Kth%20Missing%20Positive%20Number.md)\n\n**1901**. [Find a Peak Element II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Binary%20Search/1901-Find%20a%20Peak%20Element%20II.md)\n\n------- \n\n**Dynamic Programming**\n\n**5**. [Longest Palindromic Substring](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/5-Longest%20Palindromic%20Substring.md)\n\n**10**. [Regular Expression Matching](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/10-Regular%20Expression%20Matching.md)\n\n**42**. [Trapping Rain Water](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/42-Trapping%20Rain%20Water.md)\n\n**44**. [Wildcard Matching](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/44-Wildcard%20Matching.md)\n\n**45**. [Jump Game II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/45-Jump%20Game%20II.md)\n\n**53**. [Maximum Subarray](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/53-Maximum%20Subarray.md)\n\n**62**. [Unique Paths](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/62-Unique%20Paths.md)\n\n**63**. [Unique Paths II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/63-Unique%20Paths%20II.md)\n\n**64**. [Minimum Path Sum](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/64-Minimum%20Path%20Sum.md)\n\n**70**. [Climbing Stairs](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/70-Climbing%20Stairs.md)\n\n**72**. [Edit Distance](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/72-Edit%20Distance.md)\n\n**84**. [Largest Rectangle in Histogram](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/84-Largest%20Rectangle%20in%20Histogram.md)\n\n**85**. [Maximal Rectangle](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/85-Maximal%20Rectangle.md)\n\n**91**. [Decode Ways](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/91-Decode%20Ways.md)\n\n**95**. [Unique Binary Search Trees II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/95-Unique%20Binary%20Search%20Trees%20II.md)\n\n**96**. [Unique Binary Search Trees](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/96-Unique%20Binary%20Search%20Trees.md)\n\n**97**. [Interleaving String](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/97-Interleaving%20String.md)\n\n**120**. [Triangle](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/120-Triangle.md)\n\n**121**. [Best Time to Buy and Sell Stock](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/121-Best%20Time%20to%20Buy%20and%20Sell%20Stock.md)\n\n**122**. [Best Time to Buy and Sell Stock II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/122-Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.md)\n\n**123**. [Best Time to Buy and Sell Stock III](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/123-Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III.md)\n\n**132**. [Palindrome Partitioning II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/132-Palindrome%20Partitioning%20II.md)\n\n**139**. [Word Break](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/139-Word%20Break.md)\n\n**152**. [Maximum Product Subarray](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/152-Maximum%20Product%20Subarray.md)\n\n**198**. [House Robber](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/198-House%20Robber.md)\n\n**213**. [House Robber II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/213-House%20Robber%20II.md)\n\n**221**. [Maximal Square](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/221-Maximal%20Square.md)\n\n**303**. [Range Sum Query - Immutable](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/303-Range%20Sum%20Query%20-%20Immutable.md)\n\n**304**. [Range Sum Query 2D - Immutable](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/304-Range%20Sum%20Query%202D%20-%20Immutable.md)\n\n**322**. [Coin Change](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/322-Coin%20Change.md)\n\n**337**. [House Robber III](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/337-House%20Robber%20III.md)\n\n**403**. [Frog Jump](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/403-Frog%20Jump.md)\n\n**416**. [Partition Equal Subset Sum](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/416-Partition%20Equal%20Subset%20Sum.md)\n\n**456**. [132 Pattern](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/456-132%20Pattern.md)\n\n**518**. [Coin Change 2](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/518-Coin%20Change%202.md)\n\n**647**. [Palindromic Substrings](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/647-Palindromic%20Substrings.md)\n\n**739**. [Daily Temperatures](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/739-Daily%20Temperatures.md)\n\n**1048**. [Longest String Chain](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/1048-Longest%20String%20Chain.md)\n\n**1143**. [Longest Common Subsequence](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/1143-Longest%20Common%20Subsequence.md)\n\n**1186**. [Maximum Subarray Sum with One Deletion](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/1186-Maximum%20Subarray%20Sum%20with%20One%20Deletion.md)\n\n**1218**. [Longest Arithmetic Subsequence Given Difference](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/1218-Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference.md)\n\n**1223**. [Dice Roll Simulation](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/1223-Dice%20Roll%20Simulation.md)\n\n**1477**. [Find Two Non-overlapping Sub-arrays Each With Target Sum](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dynamic%20Programming/1477-Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum.md)\n\n------- \n**Greedy**\n\n**23**. [Longest Valid Parentheses](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Greedy/32-Longest%20Valid%20Parentheses.md)\n\n**55**. [Jump Game](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Greedy/55-Jump%20Game.md)\n\n**134**. [Gas Station](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Greedy/134-Gas%20Station.md)\n\n**279**. [Perfect Squares](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Greedy/279-Perfect%20Squares.md)\n\n**300**. [Longest Increasing Subsequence](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Greedy/300-Longest%20Increasing%20Subsequence.md)\n\n**334**. [Increasing Triplet Subsequence](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Greedy/334-Increasing%20Triplet%20Subsequence.md)\n\n**354**. [Russian Doll Envelopes](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Greedy/354-Russian%20Doll%20Envelopes.md)\n\n**410**. [Split Array Largest Sum](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Greedy/410-Split%20Array%20Largest%20Sum.md)\n\n**621**. [Task Scheduler](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Greedy/621-Task%20Scheduler.md)\n\n**630**. [Course Schedule III](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Greedy/630-Course%20Schedule%20III.md)\n\n**670**. [Maximum Swap](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Greedy/670.%20Maximum%20Swap.md)\n\n**1733**. [Minimum Number of People to Teach](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Greedy/1733-Minimum%20Number%20of%20People%20to%20Teach.md)\n\n------- \n\n**Two Pointers**\n\n**3**. [Longest Substring Without Repeating Characters](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/3-Longest%20Substring%20Without%20Repeating%20Characters.md)\n\n**11**. [Container With Most Water](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/11-Container%20With%20Most%20Water.md)\n\n**15**. [3Sum](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/15-3Sum.md)\n\n**16**. [3Sum Closest](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/16-3Sum%20Closest.md)\n\n**18**. [4Sum](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/18-4Sum.md)\n\n**26**. [Remove Duplicates from Sorted Array](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/26-Remove%20Duplicates%20from%20Sorted%20Array.md)\n\n**27**. [Remove Element](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/27-Remove%20Element.md)\n\n**30**. [Substring with Concatenation of All Words](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/30-Substring%20with%20Concatenation%20of%20All%20Words.md)\n\n**31**. [Next Permutation](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/31-Next%20Permutation.md)\n\n**56**. [Merge Intervals](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/56-Merge%20Intervals.md)\n\n**58**. [Length of Last Word](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/58-Length%20of%20Last%20Word.md)\n\n**75**. [Sort Colors](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/75-Sort%20Colors.md)\n\n**76**. [Minimum Window Substring](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/76-Minimum%20Window%20Substring.md)\n\n**88**. [Merge Sorted Array](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/88-Merge%20Sorted%20Array.md)\n\n**161**. [Edit Distance](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/161-One%20Edit%20Distance.md)\n\n**163**. [Missing Ranges](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/163-Missing%20Ranges.md)\n\n**165**. [Compare Version Numbers](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/165-Compare%20Version%20Numbers.md)\n\n**189**. [Rotate Array](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/189-Rotate%20Array.md)\n\n**202**. [Happy Number](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/202-Happy%20Number.md)\n\n**209**. [Minimum Size Subarray Sum](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/209-Minimum%20Size%20Subarray%20Sum.md)\n\n**238**. [Product of Array Except Self ](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/238-Product%20of%20Array%20Except%20Self.md)\n\n**243**. [Shortest Word Distance](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/243-Shortest%20Word%20Distance.md)\n\n**244**. [Shortest Word Distance II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/244-Shortest%20Word%20Distance%20II.md)\n\n**283**. [Move Zeros](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/283-Move%20Zeros.md)\n\n**415**. [Add Strings](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/415-Add%20Strings.md)\n\n**438**. [Find All Anagrams in a String](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/438-Find%20All%20Anagrams%20in%20a%20String.md)\n\n**443**. [String Compression](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/443-String%20Compression.md)\n\n**567**. [Permutation in String](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/567-Permutation%20in%20String.md)\n\n**977**. [Squares of a Sorted Array](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/977-Squares%20of%20a%20Sorted%20Array.md)\n\n**986**. [Interval List Intersections](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Two%20Pointers/986-Interval%20List%20Intersections.md)\n\n------- \n\n**Linked List**\n\n**2**. [Add Two Numbers](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Linked%20List/2-Add%20Two%20Numbers.md)\n\n**19**. [Remove Nth Node From End of List](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Linked%20List/19-Remove%20Nth%20Node%20From%20End%20of%20List.md)\n\n**21**. [Merge Two Sorted Lists](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Linked%20List/21-Merge%20Two%20Sorted%20Lists.md)\n\n**24**. [Swap Nodes in Pairs](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Linked%20List/24-Swap%20Nodes%20in%20Pairs.md)\n\n**25**. [Reverse Nodes in k-Group](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Linked%20List/25-Reverse%20Nodes%20in%20k-Group.md)\n\n**138**. [Copy List with Random Pointer](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Linked%20List/138-Copy%20List%20with%20Random%20Pointer.md)\n\n**142**. [Linked List Cycle II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Linked%20List/142-Linked%20List%20Cycle%20II.md)\n\n**160**. [Intersection of Two Linked Lists](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Linked%20List/160-Intersection%20of%20Two%20Linked%20Lists.md)\n\n**147**. [Insertion Sort List](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Linked%20List/147-Insertion%20Sort%20List.md)\n\n**206**. [Reverse Linked List](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Linked%20List/206-Reverse%20Linked%20List.md)\n\n**234**. [Palindrome Linked List](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Linked%20List/234-Palindrome%20Linked%20List.md)\n\n**445**. [Add Two Numbers II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Linked%20List/445-Add%20Two%20Numbers%20II.md)\n\n------- \n\n**Stack+Queue**\n\n**7**. [Reverse Integer](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/7-Reverse%20Integer.md)\n\n**9**. [Palindrome Number](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/9-Palindrome%20Number.md)\n\n**20**. [Valid Parentheses](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/20-Valid%20Parentheses.md)\n\n**71**. [Simplify Path](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/71-Simplify%20Path.md)\n\n**150**. [Evaluate Reverse Polish Notation](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/150-Evaluate%20Reverse%20Polish%20Notation.md)\n\n**224**. [Basic Calculator](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/224-Basic%20Calculator.md)\n\n**227**. [Basic Calculator II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/227.%20Basic%20Calculator%20II.md)\n\n**394**. [Decode String](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/394-Decode%20String.md)\n\n**636**. [Exclusive Time of Functions](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/636-Exclusive%20Time%20of%20Functions.md)\n\n**726**. [Number of Atoms](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/726-Number%20of%20Atoms.md)\n\n**735**. [Asteroid Collision](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/735-Asteroid%20Collision.md)\n\n**918**. [Maximum Sum Circular Subarray](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/918-Maximum%20Sum%20Circular%20Subarray.md)\n\n**1047**. [Remove All Adjacent Duplicates In String](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/1047-Remove%20All%20Adjacent%20Duplicates%20In%20String.md)\n\n**1249**. [Minimum Remove to Make Valid Parentheses](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/1249-Minimum%20Remove%20to%20Make%20Valid%20Parentheses.md)\n\n**1762**. [Buildings With an Ocean View](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Stack%2BQueue/1762-Buildings%20With%20an%20Ocean%20View.md)\n\n------- \n\n**Heap**\n\n**23**. [Merge k Sorted Lists](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Heap/23-Merge%20k%20Sorted%20Lists.md)\n\n**215**. [Kth Largest Element in an Array](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Heap/215-Kth%20Largest%20Element%20in%20an%20Array.md)\n\n**239**. [Sliding Window Maximum](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Heap/239-Sliding%20Window%20Maximum.md)\n\n**253**. [Meeting Rooms II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Heap/253-Meeting%20Rooms%20II.md)\n\n**264**. [Ugly Number II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Heap/264-Ugly%20Number%20II.md)\n\n**295**. [Find Median from Data Stream](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Heap/295-Find%20Median%20from%20Data%20Stream.md)\n\n**347**. [Top K Frequent Elements](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Heap/347-Top%20K%20Frequent%20Elements.md)\n\n**373**. [Find K Pairs with Smallest Sums](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Heap/373-Find%20K%20Pairs%20with%20Smallest%20Sums.md)\n\n**973**. [K Closest Points to Origin](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Heap/973-K%20Closest%20Points%20to%20Origin.md)\n\n------- \n\n**Tree**\n\n**98**. [Validate Binary Search Tree](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/98-Validate%20Binary%20Search%20Tree.md)\n\n**99**. [Recover Binary Search Tree](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/99-Recover%20Binary%20Search%20Tree.md)\n\n**101**. [Symmetric Tree](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/101-Symmetric%20Tree.md)\n\n**104**. [Maximum Depth of Binary Tree](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/104-Maximum%20Depth%20of%20Binary%20Tree.md)\n\n**105**. [Construct Binary Tree from Preorder and Inorder Traversal](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/105-Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.md)\n\n**109**. [Convert Sorted List to Binary Search Tree](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/109-Convert%20Sorted%20List%20to%20Binary%20Search%20Tree.md)\n\n**116**. [Populating Next Right Pointers in Each Node](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/116-Populating%20Next%20Right%20Pointers%20in%20Each%20Node.md)\n\n**117**. [Populating Next Right Pointers in Each Node II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/117-Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II.md)\n\n**199**. [Binary Tree Right Side View](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/199-Binary%20Tree%20Right%20Side%20View.md)\n\n**124**. [Binary Tree Maximum Path Sum](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/124-Binary%20Tree%20Maximum%20Path%20Sum.md)\n\n**230**. [Kth Smallest Element in a BST](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/230-Kth%20Smallest%20Element%20in%20a%20BST.md)\n\n**236**. [Lowest Common Ancestor of a Binary Tree](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/236-Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree.md)\n\n**297**. [Serialize and Deserialize Binary Tree](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/297-Serialize%20and%20Deserialize%20Binary%20Tree.md)\n\n**298**. [Longest Consecutive Sequence](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/298-Binary%20Tree%20Longest%20Consecutive%20Sequence.md)\n\n**314**. [Binary Tree Vertical Order Traversal](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/314-Binary%20Tree%20Vertical%20Order%20Traversal.md)\n\n**333**. [Largest BST Subtree](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/333-Largest%20BST%20Subtree.md)\n\n**426**. [Convert Binary Search Tree to Sorted Doubly Linked List](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/426-Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List.md)\n\n**536**. [Construct Binary Tree from String](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/536-Construct%20Binary%20Tree%20from%20String.md)\n\n**543**. [Diameter of Binary Tree](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/543-Diameter%20of%20Binary%20Tree.md)\n\n**834**. [Sum of Distances in Tree](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/834-Sum%20of%20Distances%20in%20Tree.md)\n\n**863**. [All Nodes Distance K in Binary Tree](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/863-All%20Nodes%20Distance%20K%20in%20Binary%20Tree.md)\n\n**938**. [Range Sum of BST](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/938-Range%20Sum%20of%20BST.md)\n\n**987**. [Vertical Order Traversal of Binary Tree](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/987-Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree.md)\n\n**1650**. [Lowest Common Ancestor of a Binary Tree III](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Tree/1650-Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III.md)\n\n------- \n\n**DFS+BFS**\n\n**17**. [Letter Combinations of a Phone Number](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/17-Letter%20Combinations%20of%20a%20Phone%20Number.md)\n\n**22**. [Generate Parentheses](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/22-Generate%20Parentheses.md)\n\n**37**. [Sudoku Solver](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/37-Sudoku%20Solver.md)\n\n**39**. [Combination Sum](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/39-Combination%20Sum.md)\n\n**40**. [Combination Sum II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/40-Combination%20Sum%20II.md)\n\n**46**. [Permutations](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/46-Permutations.md)\n\n**47**. [Permutations II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/47-Permutations%20II.md)\n\n**51**. [N-Queens](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/51-N-Queens.md)\n\n**78**. [Subsets](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/78-Subsets.md)\n\n**79**. [Word Search](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS+DFS/79-Word%20Search.md)\n\n**90**. [Subsets II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/90-Subsets%20II.md)\n\n**102**. [Binary Tree Level Order Traversal](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS+DFS/102-Binary%20Tree%20Level%20Order%20Traversal.md)\n\n**114**. [Flatten Binary Tree to Linked List](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/114-Flatten%20Binary%20Tree%20to%20Linked%20List.md)\n\n**126**. [Word Ladder II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/126-Word%20Ladder%20II.md)\n\n**127**. [Word Ladder](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS+DFS/127-Word%20Ladder.md)\n\n**131**. [Palindrome Partitioning](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/131-Palindrome%20Partitioning.md)\n\n**133**. [Clone Graph](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS+DFS/133-Clone%20Graph.md)\n\n**140**. [Word Break II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/140-Word%20Break%20II.md)\n\n**282**. [Expression Add Operators](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/282-Expression%20Add%20Operators.md)\n\n**301**. [Remove Invalid Parentheses](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/301-Remove%20Invalid%20Parentheses.md)\n\n**317**. [Shortest Distance from All Buildings](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/317-Shortest%20Distance%20from%20All%20Buildings.md)\n\n**490**. [The Maze](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/490-The%20Maze.md)\n\n**864**. [Shortest Path to Get All Keys](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS+DFS/864-Shortest%20Path%20to%20Get%20All%20Keys.md)\n\n**886**. [Possible Bipartition](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS+DFS/886-Possible%20Bipartition.md)\n\n**1263**. [Minimum Moves to Move a Box to Their Target Location](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/1263-Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location.md)\n\n**1293**. [Shortest Path in a Grid with Obstacles Eliimination](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/1293-Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination.md)\n\n**1306**. [Jump Game III](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS%2BDFS/1306-Jump%20Game%20III.md)\n\n**1367**. [Linked List in Binary Tree](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/BFS+DFS/1367-Linked%20List%20in%20Binary%20Tree.md)\n\n------- \n\n**Topological Sort**\n\n**Template**. [Topo Sort Template](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Topological%20Sort/Topological%20Sort%20Template.md)\n\n**207**. [Course Schedule](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Topological%20Sort/207-Course%20Schedule.md)\n\n**210**. [Course Schedule II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Topological%20Sort/210-Course%20Schedule%20II.md)\n\n**269**. [Alien Dictionary](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Topological%20Sort/269-Alien%20Dictionary.md)\n\n------- \n\n**Dijkstra+Bellman-Ford**\n\n**787**. [Cheapest Flights Within K Stops](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Dijkstra%2BBellman-Ford/787-Cheapest%20Flights%20Within%20K%20Stops.md)\n\n\n\n------- \n\n**Disjoint Set Union**\n\n**Template**. [DSU Template](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Disjoint%20Set%20Union/DSU%20Template.md)\n\n**128**. [Longest Consecutive Sequence](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Disjoint%20Set%20Union/128-Longest%20Consecutive%20Sequence.md)\n\n**200**. [Number of Islands](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Disjoint%20Set%20Union/200-Number%20of%20Islands.md)\n\n**547**. [Number of Provinces](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Disjoint%20Set%20Union/547-Number%20of%20Provinces.md)\n\n**721**. [Accounts Merge](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Disjoint%20Set%20Union/721-Accounts%20Merge.md)\n\n**839**. [Similar String Groups](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Disjoint%20Set%20Union/839-Similar%20String%20Groups.md)\n\n------- \n\n**Trie**\n\n**Template**. [Trie Template](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Trie/Trie%20Template.md)\n\n**211**. [Add and Search Words Data Structure](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Trie/211-Design%20Add%20and%20Search%20Words%20Data%20Structure.md)\n\n**336**. [Palindrome Pairs](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Trie/336-Palindrome%20Pairs.md)\n\n**642**. [Design Search Autocomplete System](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Trie/642-Design%20Search%20Autocomplete%20System.md)\n\n------- \n\n**Design**\n\n**146**. [LRU Cache](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Design/146-LRU%20Cache.md)\n\n**155**. [Min Stack](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Design/155-Min%20Stack.md)\n\n**158**. [Read N Characters Given Read4 II - Call multiple times](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Design/158-Read%20N%20Characters%20Given%20Read4%20II%20-%20Call%20multiple%20times.md)\n\n**173**. [Binary Search Tree Iterator](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Design/173-Binary%20Search%20Tree%20Iterator.md)\n\n**341**. [Flatten Nested Iterator](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Design/341-Flatten%20Nested%20List%20Iterator.md)\n\n**359**. [Logger Rate Limiter](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Design/359-Logger%20Rate%20Limiter.md)\n\n**380**. [Insert Delete GetRandom O(1)](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Design/380-Insert%20Delete%20GetRandom%20O(1).md)\n\n**449**. [Serialize and Deserialize BST](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Design/449-Serialize%20and%20Deserialize%20BST.md)\n\n**460**. [LFU Cache](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Design/460-LFU%20Cache.md)\n\n**588**. [Design In-Memory File System](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Design/588-Design%20In-Memory%20File%20System.md)\n\n**706**. [Design HashMap](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Design/706-Design%20HashMap.md)\n\n**981**. [Time Based Key-Value Store](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Design/981-Time%20Based%20Key-Value%20Store.md)\n\n**1352**. [Product of the Last K Numbers](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Design/1352-Product%20of%20the%20Last%20K%20Numbers.md)\n\n**1570**. [Dot Product of Two Sparse Vectors](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Design/1570-Dot%20Product%20of%20Two%20Sparse%20Vectors.md)\n\n------- \n\n**Math**\n\n**43**. [Multiply Strings](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Math/43-Multiply%20Strings.md)\n\n**48**. [Rotate Image](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Math/48-Rotate%20Image.md)\n\n**50**. [Pow(x,n)](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Math/50-Pow(x%2Cn).md)\n\n**54**. [Spiral Matrix](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Math/54-Spiral%20Matrix.md)\n\n**59**. [Spiral Matrix II](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Math/59-Spiral%20Matrix%20II.md)\n\n**60**. [Permutation Sequence](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Math/60-Permutation%20Sequence.md)\n\n**66**. [Plus One](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Math/66-Plus%20One.md)\n\n**67**. [Add Binary](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Math/67-Add%20Binary.md)\n\n**263**. [Ugly Number](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Math/263-Ugly%20Number.md)\n\n**342**. [Power of Four](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Math/342-Power%20of%20Four.md)\n\n**371**. [Sum of Two Integers](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Math/371-Sum%20of%20Two%20Integers.md)\n\n**384**. [Shuffle an Array](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Math/384-Shuffle%20an%20Array.md)\n\n**498**. [Diagonal Traverse](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Math/498-Diagonal%20Traverse.md)\n\n**989**. [Add to Array-Form of Integer](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Math/989-Add%20to%20Array-Form%20of%20Integer.md)\n\n------- \n\n**Miscellaneous**\n\n**6**. [ZigZag Conversion](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/6-ZigZag%20Conversion.md)\n\n**8**. [String to Integer (atoi)](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/8-String%20to%20Integer%20(atoi).md)\n\n**12**. [Integer to Roman](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/12-Integer%20to%20Roman.md)\n\n**14**. [Longest Common Prefix](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/14-Longest%20Common%20Prefix.md)\n\n**28**. [Implement strStr()](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/28-Implement%20strStr().md)\n\n**38**. [Count and Say](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/38-Count%20and%20Say.md)\n\n**41**. [First Missing Positive](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/41-First%20Missing%20Positive.md)\n\n**65**. [Valid Number](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/65.%20Valid%20Number.md)\n\n**68**. [Text Justification](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/68-Text%20Justification.md)\n\n**169**. [Majority Element](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/169-Majority%20Element.md)\n\n**214**. [Shortest Palindrome](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/214-Shortest%20Palindrome.md)\n\n**252**. [Meeting Rooms](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/252-Meeting%20Rooms.md)\n\n**289**. [Game of Life](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/289-Game%20of%20Life.md)\n\n**398**. [Random Pick Index](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/398-Random%20Pick%20Index.md)\n\n**1007**. [Minimum Domino Rotations For Equal Row](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/1007-Minimum%20Domino%20Rotations%20For%20Equal%20Row.md)\n\n**1094**. [Car Pooling](https://github.com/YukunJ/LeetCode-Practice-by-Tag/blob/main/Miscellaneous/1094-Car%20Pooling.md)\n\n------- \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyukunj%2Fleetcode-practice-by-tag","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyukunj%2Fleetcode-practice-by-tag","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyukunj%2Fleetcode-practice-by-tag/lists"}