{"id":25854489,"url":"https://github.com/tanishraj/data-structures-using-javascript","last_synced_at":"2026-05-13T03:36:17.069Z","repository":{"id":50121026,"uuid":"373614036","full_name":"tanishraj/data-structures-using-javascript","owner":"tanishraj","description":"Leet Code Problems with solutions using DS and Algo","archived":false,"fork":false,"pushed_at":"2024-05-09T18:51:00.000Z","size":69,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-11-27T18:59:08.209Z","etag":null,"topics":["algorithms","data-structures","data-structures-and-algorithms","data-structures-and-algorithms-js","javascript"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/tanishraj.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":"2021-06-03T19:05:33.000Z","updated_at":"2025-01-16T11:37:12.000Z","dependencies_parsed_at":"2024-04-17T22:24:21.511Z","dependency_job_id":"a15ba1c8-2007-4212-afb4-50f478646ddc","html_url":"https://github.com/tanishraj/data-structures-using-javascript","commit_stats":null,"previous_names":["tanishraj/data-structures-and-algorithms","tanishraj/data-structures-using-javascript"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/tanishraj/data-structures-using-javascript","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tanishraj%2Fdata-structures-using-javascript","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tanishraj%2Fdata-structures-using-javascript/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tanishraj%2Fdata-structures-using-javascript/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tanishraj%2Fdata-structures-using-javascript/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tanishraj","download_url":"https://codeload.github.com/tanishraj/data-structures-using-javascript/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tanishraj%2Fdata-structures-using-javascript/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32967208,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-12T23:30:32.555Z","status":"online","status_checked_at":"2026-05-13T02:00:07.132Z","response_time":115,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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","data-structures-and-algorithms","data-structures-and-algorithms-js","javascript"],"created_at":"2025-03-01T16:13:18.776Z","updated_at":"2026-05-13T03:36:17.041Z","avatar_url":"https://github.com/tanishraj.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leet Code + Data Structure + Polyfills in Javascript\n\n- This repo consists of 3 categories of problems, completely based on Javascript Programming Language, which are asked in interviews.\n  \u003e Leet Code Problem\n  \u003e Basic Data Structure Problems\n  \u003e Polyfills for JS Methods\n- You can find the code in respective folders.\n- You'r welcome to contribute to this repo, if you get any questions that is asked in your interview.\n\n## Leet Code Problems\n\n| Problems                                              | Solution                                                                                                  |\n| ----------------------------------------------------- | --------------------------------------------------------------------------------------------------------- |\n| Even or Odd w/o conditional statement                 | [Even or Odd](./javascript-problems/even-or-odd-without-condition.js)                                     |\n| Convert Decimal into Binary                           | [Decimal to Binary](./javascript-problems/Convert-Decimal-into-Binary.js)                                 |\n| Find Max value in an array                            | [Find Max value](./javascript-problems/Find-Max-value-in-an-array.js)                                     |\n| Find Missing Number in an array                       | [Find Missing Number](./javascript-problems/Find-Missing-Number-in-an-array.js)                           |\n| Flatten Array                                         | [Flatten Array](./javascript-problems/Flatten-Array.js)                                                   |\n| Flatten an array                                      | [Flatten an array](./javascript-problems/Flatten-an-array.js)                                             |\n| Number of Student Working in time slot                | [Number of Student Working](./javascript-problems/MMT:-Number-of-Student-Working-in-time-slot.js)         |\n| Matching Brackets                                     | [Matching Brackets](./javascript-problems/Matching-Brackets.js)                                           |\n| Max Consecutive 1's in Binary Numbers                 | [Max Consecutive 1's](./javascript-problems/Max-Consecutive-1's-in-Binary-Numbers.js)                     |\n| Max Profit From Stocks                                | [Max Profit](./javascript-problems/Max-Profit-From-Stocks.js)                                             |\n| Max Water Saving Between Buildings (Naive)            | [Max Water Saving](\u003c./javascript-problems/Max-Water-Saving-Between-Buildings-(Naive).js\u003e)                 |\n| Max Water Saving Between Buildings                    | [Max Water Saving](./javascript-problems/Max-Water-Saving-Between-Buildings.js)                           |\n| Maximum Occurance of A char in string                 | [Maximum Occurance](./javascript-problems/Maximum-Occurance-of-A-char-in-string.js)                       |\n| Min and Max in Array (Naive)                          | [Min and Max](\u003c./javascript-problems/Min-and-Max-in-Array-(Naive).js\u003e)                                    |\n| Min and Max in Array (Optimized)                      | [Min and Max](\u003c./javascript-problems/Min-and-Max-in-Array-(Optimized).js\u003e)                                |\n| Minimum Shift To Sit Together                         | [Minimum Shift](./javascript-problems/Minimum-Shift-To-Sit-Together.js)                                   |\n| Move Negative Numbers Before Positive Numbers (Naive) | [Move Negative Numbers](\u003c./javascript-problems/Move-Negative-Numbers-Before-Positive-Numbers-(Naive).js\u003e) |\n| Move Negative Numbers Before Positive Numbers         | [Move Negative Numbers](./javascript-problems/Move-Negative-Numbers-Before-Positive-Numbers.js)           |\n| Remove Duplicate and Sort Numbers                     | [Remove Duplicate](./javascript-problems/Remove-Duplicate-and-Sort-Numbers.js)                            |\n| Remove Duplicates (Naive)                             | [Remove Duplicates](\u003c./javascript-problems/Remove-Duplicates-(Naive).js\u003e)                                 |\n| Reverse Number                                        | [Reverse Number](./javascript-problems/Reverse-Number.js)                                                 |\n| Second Max Occurance                                  | [Second Max Occurance](./javascript-problems/Second-Max-Occurance.js)                                     |\n| Second Max Occurrence using Hash Map                  | [Second Max Occurrence](./javascript-problems/Second-Max-Occurrence-using-Hash-Map.js)                    |\n| Second Most Frequency                                 | [Second Most Frequency](./javascript-problems/Second-Most-Frequency.js)                                   |\n| Sort Array of Object By Last name                     | [Sort Array of Object](./javascript-problems/Sort-Array-of-Object-By-Last-name.js)                        |\n| Sorting Array of Objects                              | [Sorting Array of Objects](./javascript-problems/Sorting-Array-of-Objects.js)                             |\n| SubArray Chunks                                       | [SubArray Chunks](./javascript-problems/SubArray-Chunks.js)                                               |\n| Subarray Sum (Naive)                                  | [Subarray Sum](\u003c./javascript-problems/Subarray-Sum-(Naive).js\u003e)                                           |\n| Warmer Temperature                                    | [Warmer Temperature](./javascript-problems/Warmer-Temperature.js)                                         |\n| Retain Duplicated Numbers                             | [Retain Duplicated Numbers](./javascript-problems/Retain-Duplicated-Numbers.js)                           |\n| Sum of SubArray Equals with Number                    | [Sum of SubArray Equals with Number](./javascript-problems/sum-of-subArray-to-a-value.js)                 |\n\n## Data Structure Problems\n\n| Problems           | Solution                                                        |\n| ------------------ | --------------------------------------------------------------- |\n| Singly Linked List | [Singly Linked List](./data-structures/1-singly-linked-list.js) |\n| Doubly Linked List | [Doubly Linked List](./data-structures/2-doubly-linked-list.js) |\n| Stack (array)      | [Stack (array)](./data-structures/3-stack-using-array.js)       |\n| Stack (class)      | [Stack (class)](./data-structures/4-stack-using-class.js)       |\n| Queue              | [Queue](./data-structures/5-queue-using-class.js)               |\n| Binary Search Tree | [Binary Search Tree](./polyfills/6-binary-search-tree.js)       |\n| Tree Traversal     | [Tree Traversal](./data-structures/7-tree-traversal.js)         |\n\n## Polyfills\n\n| Polyfills   | Solution                              |\n| ----------- | ------------------------------------- |\n| Array map() | [Array map()](./polyfills/map.js)     |\n| Promise     | [Promise](./polyfills/promise.js)     |\n| Promise.all | [Promise](./polyfills/promise.all.js) |\n| Reduce      | [Promise](./polyfills/reduce.js)      |\n\n## Solved Leet Problems\n\n| Leet Problems                                                 | Solution                                                                          |\n| ------------------------------------------------------------- | --------------------------------------------------------------------------------- |\n| 844. Backspace String Compare                                 | [Code](./leet-solution/844.BackspaceStringCompare.js)                             |\n| 905. Sort Array By Parity                                     | [Code](./leet-solution/905.SortArrayByParity.js)                                  |\n| 581. Shortest Unsorted Continuous Subarray                    | [Code](./leet-solution/581.ShortestUnsortedContinuousSubarray)                    |\n| 1679. Max Number of K-Sum Pairs                               | [Code](./leet-solution/1679.MaxNumberofK-SumPairs.js)                             |\n| 1. Two Sum                                                    | [Code](./leet-solution/1.TwoSum.js)                                               |\n| 15. Three Sum                                                 | [Code](./leet-solution/15.3Sum.js)                                                |\n| 225. Implement Stack using Queues                             | [Code](./leet-solution/225.ImplementStackusingQueues.js)                          |\n| 1209. Remove All Adjacent Duplicates in String II             | [Code](./leet-solution/1209.RemoveAllAdjacentDuplicatesinStringII.js)             |\n| 9. Palindrome Number                                          | [Code](./leet-solution/9.PalindromeNumber.js)                                     |\n| 341. Flatten Nested List Iterator                             | [Code](./leet-solution/341.FlattenNestedListIterator.js)                          |\n| 63. Unique Paths II                                           | [Code](./leet-solution/63.UniquePathsII.js)                                       |\n| 62. Unique Paths                                              | [Code](./leet-solution/62.UniquePaths.js)                                         |\n| 322. Coin Change                                              | [Code](./leet-solution/322.CoinChange.js)                                         |\n| 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | [Code](./leet-solution/1689.PartitioningIntoMinimumNumberOfDeci-BinaryNumbers.js) |\n| 26. Remove Duplicates from Sorted Array                       | [Code](./leet-solution/26.Remove_Duplicates_from_Sorted_Array.js)                 |\n| 27. Remove Elements                                           | [Code](./leet-solution/27.Remove_Element.js)                                      |\n| 682. Baseball Game                                            | [Code](./leet-solution/682.Baseball_Game.js)                                      |\n| 707. Design Linked List                                       | [Code](./leet-solution/707.Design_Linked_List.js)                                 |\n| 1472. Design Browser History                                  | [Code](./leet-solution/1472.Design_Browser_History.js)                            |\n| 125. Valid Palindrome                                         | [Code](./leet-solution/125.Valid_Palindrome.js)                                   |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftanishraj%2Fdata-structures-using-javascript","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftanishraj%2Fdata-structures-using-javascript","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftanishraj%2Fdata-structures-using-javascript/lists"}