{"id":18372887,"url":"https://github.com/marttp/js-interview-practice","last_synced_at":"2025-04-06T19:32:16.652Z","repository":{"id":63461623,"uuid":"568053357","full_name":"marttp/js-interview-practice","owner":"marttp","description":"บันทึกการทำ Leetcode in JavaScript รวมถึง Data Structures พื้นฐานสำหรับ Technical Interviews","archived":false,"fork":false,"pushed_at":"2024-11-17T10:42:03.000Z","size":17038,"stargazers_count":23,"open_issues_count":0,"forks_count":2,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-22T05:51:08.408Z","etag":null,"topics":["data-structures","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/marttp.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}},"created_at":"2022-11-19T09:55:33.000Z","updated_at":"2024-12-15T13:26:57.000Z","dependencies_parsed_at":"2023-02-19T00:15:52.225Z","dependency_job_id":null,"html_url":"https://github.com/marttp/js-interview-practice","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/marttp%2Fjs-interview-practice","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/marttp%2Fjs-interview-practice/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/marttp%2Fjs-interview-practice/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/marttp%2Fjs-interview-practice/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/marttp","download_url":"https://codeload.github.com/marttp/js-interview-practice/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247539245,"owners_count":20955277,"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":["data-structures","leetcode-solutions"],"created_at":"2024-11-06T00:07:27.899Z","updated_at":"2025-04-06T19:32:11.638Z","avatar_url":"https://github.com/marttp.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# ไอต้าวแว่นทำ LeetCode - JS Special Editions\n\nHi everyone, this repository is used for storing the solutions for LeetCode in Javascript. The support resources for my video playlist for support learners.\n\n## Video Playlist\n\n[![ไอต้าวแว่นทำ LeetCode - Tackle JS Special Editions](https://img.youtube.com/vi/IWZhdcGAXRA/0.jpg)](https://youtube.com/playlist?list=PLm3A9eDaMzukbLKitQWP_ydRmnQj8jpd9)\n\n## LeetCode questions by pattern\n\n### Array \u0026 HashTable\n\n- [x] [Two Sum](https://leetcode.com/problems/two-sum/)\n- [x] [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)\n- [x] [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)\n- [x] [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)\n- [x] [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)\n\n### Two-Pointers\n\n- [x] [Move Zeroes](https://leetcode.com/problems/two-sum/)\n- [x] [Two Sum II - Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)\n- [x] [Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/)\n- [x] [Container With Most Water](https://leetcode.com/problems/container-with-most-water/)\n\n### Sliding Windows\n\n- [x] [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)\n- [x] [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/)\n- [x] [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)\n\n### String\n\n- [x] [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)\n- [x] [Valid Anagram](https://leetcode.com/problems/valid-anagram/)\n- [x] [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/)\n- [x] [Reverse Words in a String III](https://leetcode.com/problems/group-anagrams/)\n- [x] [Group Anagrams](https://leetcode.com/problems/reverse-words-in-a-string-iii/)\n\n### Linked List\n\n- [x] [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)\n- [x] [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)\n- [x] [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)\n- [x] [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)\n- [x] [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)\n- [x] [LRU Cache](https://leetcode.com/problems/lru-cache/)\n\n### Fast \u0026 Slow Pointers\n\n- [x] [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)\n- [x] [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)\n- [x] [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)\n- [x] [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/)\n\n### Modified Binary Search\n\n- [x] [First Bad Version](https://leetcode.com/problems/first-bad-version/)\n- [x] [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)\n- [x] [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)\n\n### Stack \u0026 Queue\n\n- [x] [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)\n- [x] [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/)\n- [x] [Find the Winner of the Circular Game](https://leetcode.com/problems/find-the-winner-of-the-circular-game)\n\n### Monotonic Stack\n\n- [x] [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/)\n- [x] [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii/)\n- [x] [Daily Temperatures](https://leetcode.com/problems/daily-temperatures/)\n- [x] [Online Stock Span](https://leetcode.com/problems/online-stock-span/)\n\n### Backtracking\n\n- [x] [Subsets](https://leetcode.com/problems/subsets/)\n- [x] [Permutations](https://leetcode.com/problems/permutations/)\n- [x] [Combination Sum](https://leetcode.com/problems/combination-sum/)\n- [x] [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)\n- [x] [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)\n\n### Merge Interval\n\n- [x] [Merge Intervals](https://leetcode.com/problems/merge-intervals/)\n- [x] [Insert Interval](https://leetcode.com/problems/insert-interval/)\n- [x] [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)\n\n### Cyclic Sort\n\n- [x] [Missing Number](https://leetcode.com/problems/missing-number/)\n- [x] [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/)\n- [x] [First Missing Positive](https://leetcode.com/problems/first-missing-positive/)\n\n### Tree - DFS\n\n- [x] [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)\n- [x] [Path Sum](https://leetcode.com/problems/path-sum/)\n- [x] [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)\n- [x] [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)\n- [x] [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)\n- [x] [Path Sum II](https://leetcode.com/problems/path-sum-ii/)\n- [x] [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)\n\n### Tree - BFS\n\n- [x] [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/)\n- [x] [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/)\n- [x] [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)\n- [x] [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)\n- [x] [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)\n\n## Trie\n\n- [x] [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/)\n- [x] [Replace Words](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/)\n- [x] [Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/)\n- [x] [Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)\n\n### Top K Elements\n\n- [x] [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)\n- [x] [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)\n- [x] [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)\n- [x] [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)\n- [x] [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/)\n- [x] [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/)\n- [x] [Reorganize String](https://leetcode.com/problems/reorganize-string/)\n\n### K-way Merge\n\n- [x] [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)\n- [x] [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)\n- [x] [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/)\n- [x] [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/)\n\n### 2 Heaps\n\n- [x] [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)\n\n### Graph\n\n- [x] [Clone Graph](https://leetcode.com/problems/clone-graph/)\n- [x] [Find if Path Exists in Graph - DFS](https://leetcode.com/problems/find-if-path-exists-in-graph/)\n- [x] [Find if Path Exists in Graph - BFS](https://leetcode.com/problems/find-if-path-exists-in-graph/)\n- [x] [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target/)\n- [x] [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/)\n- [x] [Word Search](https://leetcode.com/problems/word-search/)\n- [x] [Word Search II](https://leetcode.com/problems/word-search-ii/)\n- [x] [Number of Islands](https://leetcode.com/problems/number-of-islands/)\n- [x] [Surrounded Regions](https://leetcode.com/problems/surrounded-regions/)\n- [x] [Max Area of Island](https://leetcode.com/problems/max-area-of-island/)\n- [x] [01 Matrix](https://leetcode.com/problems/01-matrix/)\n- [x] [Word Ladder](https://leetcode.com/problems/word-ladder/)\n\n### Union-Find\n\n- [x] [Find if Path Exists in Graph - Union Find](https://leetcode.com/problems/find-if-path-exists-in-graph/)\n- [x] [Number of Provinces](https://leetcode.com/problems/number-of-provinces/)\n- [x] [Number of Operations to Make Network Connected](https://leetcode.com/problems/number-of-operations-to-make-network-connected/)\n\n### Topological Sort\n\n- [x] [Course Schedule](https://leetcode.com/problems/course-schedule/)\n- [x] [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)\n\n### Minimum Spanning Tree\n\n- [x] [Min Cost to Connect All Points [Kruskal]](https://leetcode.com/problems/min-cost-to-connect-all-points/)\n- [x] [Min Cost to Connect All Points [Prim]](https://leetcode.com/problems/min-cost-to-connect-all-points/)\n\n### Single-Source-Shortest Path\n\n- [ ] [Network Delay Time [Djisktra]](https://leetcode.com/problems/network-delay-time/)\n- [ ] [Network Delay Time [Bellman-ford]](https://leetcode.com/problems/network-delay-time/)\n\n### Dynamic Programming\n\n#### 0/1 Knapsack\n\n- [ ] [Target Sum](https://leetcode.com/problems/target-sum/)\n- [ ] [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/)\n- [ ] [House Robber](https://leetcode.com/problems/house-robber/)\n\n#### Unbound Knapsack\n\n- [ ] [Coin Change](https://leetcode.com/problems/coin-change/)\n- [ ] [Coin Change II](https://leetcode.com/problems/coin-change-ii/)\n\n#### Fibonacci\n\n- [ ] [Fibonacci Number](https://leetcode.com/problems/fibonacci-number/)\n- [ ] [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/)\n\n#### Longest Palindromic Subsequence (LPS)\n\n- [ ] [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/)\n- [ ] [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)\n- [ ] [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)\n\n#### Longest Common Subsequence (LCS)\n\n- [ ] [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)\n- [ ] [Shortest Common Supersequence](https://leetcode.com/problems/shortest-common-supersequence/)\n- [ ] [Edit Distance](https://leetcode.com/problems/edit-distance/)\n- [ ] [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)\n\n#### General\n\n- [ ] [Unique Paths](https://leetcode.com/problems/unique-paths/)\n- [ ] [Perfect Squares](https://leetcode.com/problems/perfect-squares/)\n- [ ] [Triangle](https://leetcode.com/problems/triangle/)\n- [ ] [Word Break](https://leetcode.com/problems/word-break/)\n- [ ] [Word Break II](https://leetcode.com/problems/word-break-ii/)\n- [ ] [Concatenated Words](https://leetcode.com/problems/concatenated-words/)\n- [ ] [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/)\n\n### Bitwise\n\n- [ ] [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)\n- [ ] [Hamming Distance](https://leetcode.com/problems/hamming-distance/)\n- [ ] [Counting Bits](https://leetcode.com/problems/counting-bits/)\n- [ ] [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmarttp%2Fjs-interview-practice","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmarttp%2Fjs-interview-practice","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmarttp%2Fjs-interview-practice/lists"}