{"id":18498521,"url":"https://github.com/yashkathe/dsa-with-javascript","last_synced_at":"2025-05-14T05:23:26.729Z","repository":{"id":173314460,"uuid":"484074898","full_name":"yashkathe/DSA-with-Javascript","owner":"yashkathe","description":"Data Structures, Algorithms and Problems with Javascript ","archived":false,"fork":false,"pushed_at":"2024-02-09T19:31:09.000Z","size":178,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-17T00:44:51.731Z","etag":null,"topics":["algorithms","data-structures","graphs","javascript","javascript-dsa","linked-list","problem-solving","sorting-algorithms","trees","typescript"],"latest_commit_sha":null,"homepage":"https://leetcode.com/problemset/all/","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/yashkathe.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":"2022-04-21T14:03:06.000Z","updated_at":"2024-10-07T16:55:37.000Z","dependencies_parsed_at":"2023-10-16T16:59:46.064Z","dependency_job_id":"8c238aa9-5ae2-4d36-964c-6d98c9edc55c","html_url":"https://github.com/yashkathe/DSA-with-Javascript","commit_stats":null,"previous_names":["yashkathe/dsa-and-leetcode","yashkathe/dsa-with-javascript"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yashkathe%2FDSA-with-Javascript","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yashkathe%2FDSA-with-Javascript/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yashkathe%2FDSA-with-Javascript/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yashkathe%2FDSA-with-Javascript/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/yashkathe","download_url":"https://codeload.github.com/yashkathe/DSA-with-Javascript/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254076862,"owners_count":22010613,"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","data-structures","graphs","javascript","javascript-dsa","linked-list","problem-solving","sorting-algorithms","trees","typescript"],"created_at":"2024-11-06T13:40:59.187Z","updated_at":"2025-05-14T05:23:26.669Z","avatar_url":"https://github.com/yashkathe.png","language":"JavaScript","readme":"# Data Structures and Algorithms with Leet Code Problems\n\n_-With JavaScript and TypeScript_\n\n## Table of Content\n\n### Data Structures and Algorithms\n\n- [Big O Notation](./A1%20Big%20O%20Notation/)\n- [Recursion](./A2%20Recursion/)\n- [Searching Algorithms](./A3%20Searching%20Alogirthms/)\n  - [Linear Search](./A3%20Searching%20Alogirthms/linear-search.js)\n  - [Binary Seatch](./A3%20Searching%20Alogirthms/binary-search.js)\n  - [Naive String Search](./A3%20Searching%20Alogirthms/naive-string-search.js)\n- [Sorting Algorithms](./A4%20Sorting%20Algortihms/)\n  - [Bubble Sort](./A4%20Sorting%20Algortihms/bubble-sort.js)\n  - [Selection Sort](./A4%20Sorting%20Algortihms//selection-sort.js)\n  - [Insertion Sort](./A4%20Sorting%20Algortihms/insertion-sort)\n  - [Merge Sort](./A4%20Sorting%20Algortihms/merge%20sort/)\n    - [Merge Arrays](./A4%20Sorting%20Algortihms/merge%20sort/merge-array.js)\n    - [Merge Sort](./A4%20Sorting%20Algortihms/merge%20sort/merge-sort.js)\n  - [Quick Sort](./A4%20Sorting%20Algortihms/quick%20sort/)\n    - [Pivot Helper](./A4%20Sorting%20Algortihms/quick%20sort/pivot-helper.js)\n    - [Quick sort](./A4%20Sorting%20Algortihms/quick%20sort/quick-sort.js)\n  - [Radix sort](./A4%20Sorting%20Algortihms/radix%20sort/)\n    - [Helper Functions](./A4%20Sorting%20Algortihms/radix%20sort/helper-functions.js)\n    - [Radix Sort](./A4%20Sorting%20Algortihms/radix%20sort/radix-sort.js)\n- [Data Structures - Introduction](./A5%20Data%20Structures%20Introduction/)\n  - [Class Syntax](./A5%20Data%20Structures%20Introduction/class-syntax.js)\n- [Singly Linked List](./A6%20Singly%20Linked%20List/linked%20-list.js)\n- [Doubly Linked List](./A7%20Doubly%20Linked%20List/doubly-linked-list.js)\n- [Stacks and Queues](./A8%20Stack%20and%20Queues/)\n  - [Stacks using Array implementation](./A8%20Stack%20and%20Queues/stacks-array.js)\n  - [Stacks using Linked List implementation](./A8%20Stack%20and%20Queues/stack-linked-list.js)\n  - [Queues using Array implementation](./A8%20Stack%20and%20Queues/queues-array.js)\n  - [Queues using Linked List implementation](./A8%20Stack%20and%20Queues/queues-linked-list.js)\n- [Binary Search Trees](./A9%20Binary%20Search%20Trees/binary-search-trees.js)\n- [Binary Heaps](./A10%20Binary%20Heaps/binary-heaps.js)\n- [Priority Queue](./A11%20Priority%20Queue/priority-queue.js)\n- [Hash Tables](./A12%20Hash%20Tables)\n  - [Hash Functions](./A12%20Hash%20Tables/hash-functions.js)\n  - [Hash Tables](./A12%20Hash%20Tables/hash-tables.js)\n- [Graphs](./A13%20Graphs/graph.js)\n\n### Leet Code Problems\n\n- [Easy Level Problems](./B1%20LEETCODE-Easy/)\n\n  - [Arrays](./B1%20LEETCODE-Easy/Arrays/)\n\n    - [Remove Elements](./B1%20LEETCODE-Easy/Arrays/remove_element.js)\n    - [Construct array from permutation](./B1%20LEETCODE-Easy/Arrays/array-from-permutation.js)\n    - [Decompress run length encoded list](./B1%20LEETCODE-Easy/Arrays/decompress-run-length.js)\n    - [Reverse Array](./B1%20LEETCODE-Easy/Arrays/reverse-array.js)\n    - [Shuffle Array](./B1%20LEETCODE-Easy/Arrays/suffle-array.js)\n    - [Number of good pairs](./B1%20LEETCODE-Easy/Arrays/number-of-good-pairs.js)\n    - [Running sum of 1d array](./B1%20LEETCODE-Easy/Arrays/running-sum-1d.js)\n    - [Difference of sum](./B1%20LEETCODE-Easy/Arrays/difference-of-sum.js)\n\n  - [Binary Search](./B1%20LEETCODE-Easy/Binary%20Search/)\n\n    - [Count negative numbers in a sorted matrix](./B1%20LEETCODE-Easy/Binary%20Search/count-negatives.js)\n\n  - [Binary Tree](./B1%20LEETCODE-Easy/Binary%20Trees/)\n\n    - [Solve the boolean binary tree](./B1%20LEETCODE-Easy/Binary%20Trees/boolean-binary-tree.js)\n    - [Find corresponding node in clone](./B1%20LEETCODE-Easy/Binary%20Trees/)\n    - [Check if certain value exists in binary tree](./B1%20LEETCODE-Easy/Binary%20Trees/)\n    - [Invert Tree](./B1%20LEETCODE-Easy/Binary%20Trees/)\n    - [Find Max Depth of binary tree](./B1%20LEETCODE-Easy/Binary%20Trees/)\n    - [Merge two trees](./B1%20LEETCODE-Easy/Binary%20Trees/)\n    - [Check if tress have similar leaves](./B1%20LEETCODE-Easy/Binary%20Trees/leaf-similar-trees.js)\n    - [Check if two trees are similar](./B1%20LEETCODE-Easy/Binary%20Trees/same-trees.js)\n    - [Is Uni Value Tree](./B1%20LEETCODE-Easy/Binary%20Trees/is-uni-value.js)\n\n  - [Binary Search Tree](./B1%20LEETCODE-Easy/Binary-Search-Tree/)\n\n    - [Increasing order search tree](./B1%20LEETCODE-Easy/Binary-Search-Tree/increasing-order-search-tree.js)\n    - [Minimum Distance between bst nodes](./B1%20LEETCODE-Easy/Binary-Search-Tree/min-dist-between-nodes.js)\n    - [Range Sum of BST](./B1%20LEETCODE-Easy/Binary-Search-Tree/range-sum.js)\n    - [Search in a BST](./B1%20LEETCODE-Easy/Binary-Search-Tree/search-a-node.js)\n    - [Mode in BST](./B1%20LEETCODE-Easy/Binary-Search-Tree/mode-in-bst.js)\n    - [Two Sum for BST nodes](./B1%20LEETCODE-Easy/Binary-Search-Tree/two-sum.js)\n    - [Maximum sum from root to leaf](./B1%20LEETCODE-Easy/Binary-Search-Tree/max-sum-root-to-leaf.js)\n\n  - [Hash Tables](./B1%20LEETCODE-Easy/Hash%20Tables/)\n\n    - [Arithmetic Triplets](./B1%20LEETCODE-Easy/Hash%20Tables/Arithmetic-triplets.js)\n    - [Decode message given a key](./B1%20LEETCODE-Easy/Hash%20Tables/Decode-message.js)\n    - [Equal occurences of string](./B1%20LEETCODE-Easy/Hash%20Tables/equal-occurence-string.js)\n    - [Panagram sentence](./B1%20LEETCODE-Easy/Hash%20Tables/Is-Panagram-sentence.js)\n    - [Max string pairs](./B1%20LEETCODE-Easy/Hash%20Tables/max-string-pairs.js)\n    - [Number of consistent strings when reversed](./B1%20LEETCODE-Easy/Hash%20Tables/number-of-consistent-strings.js)\n    - [Sort the people according to their heights](./B1%20LEETCODE-Easy/Hash%20Tables/Sort-the-people.js)\n    - [Unique Morse code](./B1%20LEETCODE-Easy/Hash%20Tables/unique-morse-code.js)\n\n  - [Linked List](./B1%20LEETCODE-Easy/Linked%20List/)\n\n    - [Intersection of Linked List](./B1%20LEETCODE-Easy/Linked%20List/intersection-of-linked-list.js)\n    - [Middle of Linked List](./B1%20LEETCODE-Easy/Linked%20List/middle-of-linked-list.js)\n    - [Linked List Cycle](./B1%20LEETCODE-Easy/Linked%20List/linked-list-cycle.js)\n    - [Palindrome Linked List](./B1%20LEETCODE-Easy/Linked%20List/palindrome-linked-list.js)\n    - [Remove duplicates from sorted list](./B1%20LEETCODE-Easy/Linked%20List/remove-duplicates-from-sorted-list.js)\n    - [Remove linked list elements](./B1%20LEETCODE-Easy/Linked%20List/remove-linked-list-elements.js)\n    - [Print linked list as string](./B1%20LEETCODE-Easy/Linked%20List/linked_list-to-string.js)\n    - [Get nth Element in a linked list](./B1%20LEETCODE-Easy/Linked%20List/nth-element.js)\n\n  - [Merging and Sorting](./B1%20LEETCODE-Easy/Merging%20and%20Sorting/)\n\n    - [Merge two sorted lists](./B1%20LEETCODE-Easy/Merging%20and%20Sorting/merge_two_sorted_lists.js)\n    - [Remove duplicates from sorted array](./B1%20LEETCODE-Easy/Merging%20and%20Sorting/remove_duplicates_from_sorted_array.js)\n\n  - [Recursion](./B1%20LEETCODE-Easy/Recursion/)\n\n    - [Power of 2](./B1%20LEETCODE-Easy/Recursion/power-of-2.js)\n    - [Power of 4](./B1%20LEETCODE-Easy/Recursion/power-of-4.js)\n    - [Print linked list as string](./B1%20LEETCODE-Easy/Linked%20List/linked_list-to-string.js)\n    - [Sum of array](./B1%20LEETCODE-Easy/Recursion/sum-of-array.js)\n    - [Sum all the numbers which are multiples of 3,5 and 7](./B1%20LEETCODE-Easy/Recursion/sum-multiples.js)\n    - [Get nth Element in a linked list](./B1%20LEETCODE-Easy/Linked%20List/nth-element.js)\n\n  - [Sliding Window](./B1%20LEETCODE-Easy/Sliding%20Window/)\n\n    - [Best time to buy and sell stock](./B1%20LEETCODE-Easy/Sliding%20Window/best-time-to-buy-and-sell-stocks.js)\n    - [Contains Duplicate 2](./B1%20LEETCODE-Easy/Sliding%20Window/contains-duplicate-2.js)\n\n  - [Stacks and Queues](./B1%20LEETCODE-Easy/Stacks%20and%20Queues/)\n\n    - [Backspace String Compare](./B1%20LEETCODE-Easy/Stacks%20and%20Queues/backspace-string-compare.js)\n    - [BaseBall Game](./B1%20LEETCODE-Easy/Stacks%20and%20Queues/baseball-game.js)\n    - [Max nesting depth](./B1%20LEETCODE-Easy/Stacks%20and%20Queues/max-nesting-depth.js)\n    - [Remove outermost Parentheses](./B1%20LEETCODE-Easy/Stacks%20and%20Queues/remove-outermost-parentheses.js)\n    - [Check if its valid parentheses](./B1%20LEETCODE-Easy/Stacks%20and%20Queues/valid-parentheses.js)\n\n  - [Strings](./B1%20LEETCODE-Easy/String/)\n\n    - [Two Sum](./B1%20LEETCODE-Easy/String/two-sum.js)\n    - [Palindrome Number](./B1%20LEETCODE-Easy/String/palindrome-number.js)\n    - [Roman to Integer](./B1%20LEETCODE-Easy/String/roman-to-integer.js)\n    - [Defanging IP address](./B1%20LEETCODE-Easy/String/defanging-ip.ts)\n    - [Final Value of Variable After Performing Operations](./B1%20LEETCODE-Easy/String/value-after-operation.ts)\n    - [Maximum Number of Words Found in Sentence](./B1%20LEETCODE-Easy/String/max-words-in-sentence.ts)\n    - [Jewels and Stones](./B1%20LEETCODE-Easy/String/jewels-and-stones.ts)\n    - [Goal Parser Interpretation](./B1%20LEETCODE-Easy/String/goal-parser.ts)\n\n  - [Trees](./B1%20LEETCODE-Easy/Trees/)\n\n    - [Construct height balanced binary tree using sorted array](./B1%20LEETCODE-Easy/Trees/create-tree-using-sorted-array.js)\n    - [Invert Binary Tree](./B1%20LEETCODE-Easy/Trees/invert-binary-tree.js)\n    - [Post order traversal](./B1%20LEETCODE-Easy/Trees/post-order-traversal.js)\n    - [Pre order traversal](./B1%20LEETCODE-Easy/Trees/pre-order-traversal.js)\n    - [Maximum depth of tree](./B1%20LEETCODE-Easy/Trees/max-depth.js)\n\n- [Medium Level Problems](./B2%20LEETCODE-Medium/)\n\n  - [Array and Hashings](./B2%20LEETCODE-Medium/Array-and-Hashing/)\n\n    - [Group Anagrams](./B2%20LEETCODE-Medium/Array-and-Hashing/group-anagrams.js)\n    - [Longest Consecutive Sequence](./B2%20LEETCODE-Medium/Array-and-Hashing/longest-consecutive-sequence.js)\n    - [Product except self](./B2%20LEETCODE-Medium/Array-and-Hashing/product-except-self.js)\n    - [Encode and decode](./B2%20LEETCODE-Medium/Array-and-Hashing/encode-and-decode-tiny-url.js)\n    - [Search 2-D Matrix](./B2%20LEETCODE-Medium/Array-and-Hashing/search-2d-matrix.js)\n    -\n\n  - [Concepts](./B2%20LEETCODE-Medium/Concepts/)\n\n    - [Debouncing](./B2%20LEETCODE-Medium/Concepts/debouncing.js)\n\n  - [Linked List](./B2%20LEETCODE-Medium/Linked%20List/merge-nodes-between-zero.js)\n\n    - [Merge nodes between zero](./B2%20LEETCODE-Medium/Linked%20List/merge-nodes-between-zero.js)\n    - [Maximum Twin Sum of Linked List](./B2%20LEETCODE-Medium/Linked%20List/max-twinSum-of-linked-list.js)\n    - [Merge other linked list in between two nodes of previous list](./B2%20LEETCODE-Medium/Linked%20List/merge-in-between.js)\n    - [Remove Node having greater value anywhere to the right side of it](./B2%20LEETCODE-Medium/Linked%20List/remove-nodes.js)\n    - [Swap nodes in pairs of two](./B2%20LEETCODE-Medium/Linked%20List/swap-nodes.in-pairs.js)\n    - [Remove nth node from end of list](./B2%20LEETCODE-Medium/Linked%20List/remove-nth-node-from-end.js)\n    - [Two Sum](./B2%20LEETCODE-Medium/Linked%20List/sum-of-nodes.js)\n    - [Sort Colors](./B2%20LEETCODE-Medium/Array-and-Hashing/sort-colors.js)\n\n  - [Stacks and Queues](./B2%20LEETCODE-Medium/Stacks%20and%20Queues/)\n\n    - [Remove Node having greater value anywhere to the right side of it](./B2%20LEETCODE-Medium/Linked%20List/remove-nodes.js)\n\n  - [Backtracking](./B2%20LEETCODE-Medium/Backtracking/)\n\n    - [Permutations](./B2%20LEETCODE-Medium/Backtracking/permutations.js)\n    - [Subsets](./B2%20LEETCODE-Medium/Backtracking/subsets.js)\n    - [Subsets 2](./B2%20LEETCODE-Medium/Backtracking/subsets2.js)\n    - [Generate parenthesis](./B2%20LEETCODE-Medium/Backtracking/generate-parenthesis.js)\n    - [Letter Tile possibilities](./B2%20LEETCODE-Medium/Backtracking/letter-tiles-possibilities.js)\n\n  - [Binary Search](./B2%20LEETCODE-Medium/Binary-Search/)\n\n    - [Capacity to Ship Packages](./B2%20LEETCODE-Medium/Binary-Search/capacity-to-ship-packages.js)\n    - [Find Minimum in Rotated Sorted Array](./B2%20LEETCODE-Medium/Binary-Search//Find-Minimum-in-rotated-sorted-array.js)\n    - [Find First and Last Position of Element in a Sorted Array](./B2%20LEETCODE-Medium/Binary-Search/first-last-position-of-target-in-sorted-array.js)\n    - [Koko eating bananas](./B2%20LEETCODE-Medium/Binary-Search/koko-eating-bananas.js)\n    - [Search in Rotated Sorted Array](./B2%20LEETCODE-Medium/Binary-Search/Search-in-rotated-sorted-array.js)\n\n  - [Sliding Windows](./B2%20LEETCODE-Medium/Sliding%20Window/)\n\n    - [Fruits in Basket](./B2%20LEETCODE-Medium/Sliding%20Window/fruits-in-basket.js)\n    - [Longest repeating character replacement](./B2%20LEETCODE-Medium/Sliding%20Window/longest-repeating-character-replacement.js)\n    - [Longest Substring without repeating characters](./B2%20LEETCODE-Medium/Sliding%20Window/longest-substring-without-repeating-characters.js)\n    - [Number of subarrays](./B2%20LEETCODE-Medium/Sliding%20Window/number-of-subarrays.js)\n    - [Maximum Number of vowels in a Substring](./B2%20LEETCODE-Medium/Sliding%20Window/Maximum-number-of-vowels-in-a-substring.js)\n    - [Minimum Operations to reuduce X to 0](./B2%20LEETCODE-Medium/Sliding%20Window/min_operations_to_reduce_x_to_zero.js)\n    - [Minimum Size of subarray Sum](./B2%20LEETCODE-Medium/Sliding%20Window/minimum-size-subarray-sum.js)\n    - [Number of Subarrays](./B2%20LEETCODE-Medium/Sliding%20Window/number-of-subarrays.js)\n    - [Permutation in a string](./B2%20LEETCODE-Medium/Sliding%20Window/permutation-in-string.js)\n\n  - [String](./B2%20LEETCODE-Medium/String/)\n\n    - [Maxium Nesting Depth of two parethesis](./B2%20LEETCODE-Medium/String/Maximum-Nesting-Depth-of-Two-Valid-Parentheses.js)\n\n  - [Tress](./B2%20LEETCODE-Medium/Trees/)\n\n    - [Level order traversal of BST](./B2%20LEETCODE-Medium/Trees/Binary-tree-level-order-traversal.js)\n    - [Right Side View of BST](./B2%20LEETCODE-Medium/Trees/Binary-Tree-right-side-view.js)\n    - [Binary Search Tree to Greater Sum tree](./B2%20LEETCODE-Medium/Trees/BST-to-greater-sum-tree.js)\n    - [Check Completness of BST](./B2%20LEETCODE-Medium/Trees/Check-completness-of-BST.js)\n    - [Sum of Deepest Leaves](./B2%20LEETCODE-Medium/Trees/Deepest-leaves-sum.js)\n    - [Find duplicate subtrees](./B2%20LEETCODE-Medium/Trees/Find-duplicate-subtrees.js)\n    - [Flip Equivalent Binary Trees](./B2%20LEETCODE-Medium/Trees/Flip-Equivalent-Binary-Trees.js)\n    - [Count Good nodes in a Binary Tree](./B2%20LEETCODE-Medium/Trees/Good-Node.js)\n    - [Insert into BST](./B2%20LEETCODE-Medium/Trees/Insert-into-BST.js)\n    - [Kth smallest element](./B2%20LEETCODE-Medium/Trees/K-th-smallest-element.js)\n    - [Lowest common ancestor of BST](./B2%20LEETCODE-Medium/Trees/Lowest-common-ancestor-of-BST.js)\n    - [Maximum Binary Tree](./B2%20LEETCODE-Medium/Trees/Max-Binary-Tree.js)\n    - [Sum of Nodes with even valued grandparents](./B2%20LEETCODE-Medium/Trees/Sum-of-node-with-even-valued-grandparents.js)\n    - [Sum root to leaf number](./B2%20LEETCODE-Medium/Trees/Sum-root-to-leaf-numbers.js)\n    - [Validate Binary Search Tree](./B2%20LEETCODE-Medium/Trees/Validate-binary-search-tree.js)\n    - [Zig Zag level traversal](./B2%20LEETCODE-Medium/Trees/Zig-Zag-traversal.js)\n\n  - [Two Pointers](./B2%20LEETCODE-Medium/Two-Pointers/)\n    - [Array with elements not equal to average of neighbour](./B2%20LEETCODE-Medium/Two-Pointers/array-with-elements-ot-equal-to-average-of-neighbour.js)\n    - [Boats to save people](./B2%20LEETCODE-Medium/Two-Pointers/boats-to-save-people.js)\n    - [Container with max area](./B2%20LEETCODE-Medium/Two-Pointers/)\n    - [Maximise Confusion of a Exam](./B2%20LEETCODE-Medium/Two-Pointers/maximize-confusion-of-exam.js)\n    - [Remove Duplicates](./B2%20LEETCODE-Medium/Two-Pointers/remove-duplicates-from-sorted-array2.js)\n    - [Rotate Array](./B2%20LEETCODE-Medium/Two-Pointers/rotate-array.js)\n    - [2 Sum](./B2%20LEETCODE-Medium/Two-Pointers/Two-sum-2.js)\n    - [3 Sum](./B2%20LEETCODE-Medium/Two-Pointers/three-sum.js)\n    - [4 Sum](./B2%20LEETCODE-Medium/Two-Pointers/four-sum.js)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyashkathe%2Fdsa-with-javascript","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyashkathe%2Fdsa-with-javascript","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyashkathe%2Fdsa-with-javascript/lists"}