{"id":21125378,"url":"https://github.com/sameerkali/dsa_75","last_synced_at":"2025-08-13T23:10:27.840Z","repository":{"id":173392723,"uuid":"650698279","full_name":"sameerkali/DSA_75","owner":"sameerkali","description":"javascript interview questions by topic","archived":false,"fork":false,"pushed_at":"2025-07-29T17:31:50.000Z","size":3203,"stargazers_count":10,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-08-05T18:38:53.423Z","etag":null,"topics":["dsa","interview","interview-questions","javascript","system-design"],"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/sameerkali.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,"zenodo":null}},"created_at":"2023-06-07T16:02:16.000Z","updated_at":"2025-07-29T17:31:54.000Z","dependencies_parsed_at":null,"dependency_job_id":"e0559116-795a-4acf-a9a1-2b4ea002daeb","html_url":"https://github.com/sameerkali/DSA_75","commit_stats":null,"previous_names":["sameerkali/dsa_75"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sameerkali/DSA_75","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sameerkali%2FDSA_75","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sameerkali%2FDSA_75/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sameerkali%2FDSA_75/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sameerkali%2FDSA_75/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sameerkali","download_url":"https://codeload.github.com/sameerkali/DSA_75/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sameerkali%2FDSA_75/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":270330595,"owners_count":24565816,"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","status":"online","status_checked_at":"2025-08-13T02:00:09.904Z","response_time":66,"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":["dsa","interview","interview-questions","javascript","system-design"],"created_at":"2024-11-20T04:33:17.611Z","updated_at":"2025-08-13T23:10:27.824Z","avatar_url":"https://github.com/sameerkali.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003c!DOCTYPE html\u003e\r\n\u003chtml lang=\"en\"\u003e\r\n\u003chead\r\n  \u003cmeta charset=\"UTF-8\"\u003e\r\n  \u003cmeta http-equiv=\"X-UA-Compatible\" content=\"IE=edge\"\u003e\r\n  \u003cmeta name=\"viewport\" content=\"width=device-width, initial-scale=1.0\"\r\n \u003c/head\u003e\r\n\r\n\u003cbody\u003e\r\n  \u003ch2\u003eDescription\u003c/h2\u003e\r\n  \u003ch4\u003e`https://jsonplaceholder.typicode.com/posts?_page=${page}\u0026_limit=20`\u003c/h4\u003e\r\n  \u003cp\u003eWelcome to the DSA_75 repository! This repository is dedicated to learning and practicing data structures and algorithms using JavaScript. The goal of this repository is to provide a comprehensive collection of 75 common data structure and algorithm problems, along with their solutions, explanations, and test cases.\u003c/p\u003e\r\n  \u003ch2\u003eContents\u003c/h2\u003e\r\n  \u003cp\u003eThe repository contains the following :\u003c/p\u003e\r\n  \u003col\u003e\r\n    \u003cli\u003eProblem Statements: A collection of 75 problem statements that cover various data structures and algorithmic concepts. Each problem statement provides a clear description of the problem to be solved.\u003c/li\u003e\r\n    \u003cli\u003eSolutions: Solutions to the 75 problems are implemented in JavaScript. The solutions aim to provide efficient and optimized approaches to solve the problems.\u003c/li\u003e\r\n    \u003cli\u003eExplanations: Detailed explanations accompany each solution, helping you understand the underlying logic and reasoning behind the code. The explanations also provide insights into the time and space complexity of the solutions.\u003c/li\u003e\r\n    \u003cli\u003eTest Cases: For each problem, a set of test cases is provided to validate the correctness of the solutions. These test cases cover different scenarios and edge cases to ensure the solutions handle a variety of inputs correctly. all questions\u003c/li\u003e\r\n  \u003c/ol\u003e\r\n  \r\n  \u003ch2\u003eGetting Started\u003c/h2\u003e\r\n  \u003cp\u003eTo get started with the DSA_75 repository, follow these steps:\u003c/p\u003e\r\n  \u003col\u003e\r\n    \u003cli\u003eClone the repository to your local machine using the following command:\u003cbr\u003e\u003ccode\u003egit clone \u003ca class=\"link\"\u003ehttps://github.com/sameerkali/DSA_75.git\u003c/a\u003e\u003c/code\u003e\u003c/li\u003e\r\n    \u003cli\u003eNavigate to the cloned repository directory:\u003cbr\u003e\u003ccode\u003ecd DSA_75\u003c/code\u003e\u003c/li\u003e\r\n    \u003cli\u003eChoose a problem of your choice from the problem statements.\u003c/li\u003e\r\n    \u003cli\u003eImplement your solution in JavaScript.\u003c/li\u003e\r\n    \u003cli\u003eTest your solution using the provided test cases to verify its correctness.\u003c/li\u003e\r\n    \u003cli\u003eIf needed, refer to the explanation provided for each solution to gain insights into the approach and optimize it further.\u003c/li\u003e\r\n    \u003cli\u003eRepeat the process for other problems to enhance your understanding of data structures and algorithms.\u003c/li\u003e\r\n  \u003c/ol\u003e\r\n\r\n  \u003ch2\u003eContribution Guidelines\u003c/h2\u003e\r\n  \u003cp\u003eContributions to the DSA_75 repository are welcome! If you would like to contribute, please follow these guidelines:\u003c/p\u003e\r\n  \u003col\u003e\r\n    \u003cli\u003eFork the repository to your own GitHub account.\u003c/li\u003e\r\n    \u003cli\u003eCreate a new branch with a descriptive name for your feature or fix.\u003c/li\u003e\r\n    \u003cli\u003eImplement your changes or additions.\u003c/li\u003e\r\n    \u003cli\u003eTest your changes thoroughly.\u003c/li\u003e\r\n    \u003cli\u003eSubmit a pull request with a clear description of your changes and their purpose.\u003c/li\u003e\r\n    \u003cli\u003eEnsure your code adheres to the repository's coding standards and conventions.\u003c/li\u003e\r\n  \u003c/ol\u003e\r\n\r\n  \u003ch2\u003eStarting Date\u003c/h2\u003e\r\n  \u003cp\u003eThe DSA_75 repository was initiated on 1st June 2023. Feel free to join and start your DSA journey with us!\u003c/p\u003e\r\n\r\n  \u003cp\u003eHappy coding and mastering data structures and algorithms!\u003c/p\u003e\r\n\r\n  \u003ch1\u003eHere all the good questions \u003c/h1\u003e\r\n    - 🔭 if yor're Passionate [DSA_75] (https://docs.google.com/spreadsheets/d/1A2PaQKcdwO_lwxz9bAnxXnIQayCouZP6d-ENrBz_NXc/htmlview)\r\n  \u003ch2\u003eTwo Sum\u003c/h2\u003e\r\n\u003ch2\u003eBest Time to Buy and Sell Stock\u003c/h2\u003e\r\n\u003ch2\u003eContains Duplicate\u003c/h2\u003e\r\n\u003ch2\u003eProduct of Array Except Self\u003c/h2\u003e\r\n\u003ch2\u003eMaximum Subarray\u003c/h2\u003e\r\n\u003ch2\u003eMaximum Product Subarray\u003c/h2\u003e\r\n\u003ch2\u003eFind Minimum in Rotated Sorted Array\u003c/h2\u003e\r\n\u003ch2\u003eSearch in Rotated Sorted Array\u003c/h2\u003e\r\n\u003ch2\u003e3Sum\u003c/h2\u003e\r\n\u003ch2\u003eContainer With Most Water\u003c/h2\u003e\r\n\u003ch2\u003eSum of Two Integers\u003c/h2\u003e\r\n\u003ch2\u003eNumber of 1 Bits\u003c/h2\u003e\r\n\u003ch2\u003eCounting Bits\u003c/h2\u003e\r\n\u003ch2\u003eMissing Number\u003c/h2\u003e\r\n\u003ch2\u003eReverse Bits\u003c/h2\u003e\r\n\u003ch2\u003eClimbing Stairs\u003c/h2\u003e\r\n\u003ch2\u003eCoin Change\u003c/h2\u003e\r\n\u003ch2\u003eLongest Increasing Subsequence\u003c/h2\u003e\r\n\u003ch2\u003eLongest Common Subsequence\u003c/h2\u003e\r\n\u003ch2\u003eWord Break Problem\u003c/h2\u003e\r\n\u003ch2\u003eCombination Sum\u003c/h2\u003e\r\n\u003ch2\u003eHouse Robber\u003c/h2\u003e\r\n\u003ch2\u003eHouse Robber II\u003c/h2\u003e\r\n\u003ch2\u003eDecode Ways\u003c/h2\u003e\r\n\u003ch2\u003eUnique Paths\u003c/h2\u003e\r\n\u003ch2\u003eJump Game\u003c/h2\u003e\r\n\u003ch2\u003eClone Graph\u003c/h2\u003e\r\n\u003ch2\u003eCourse Schedule\u003c/h2\u003e\r\n\u003ch2\u003ePacific Atlantic Water Flow\u003c/h2\u003e\r\n\u003ch2\u003eNumber of Islands\u003c/h2\u003e\r\n\u003ch2\u003eLongest Consecutive Sequence\u003c/h2\u003e\r\n\u003ch2\u003eAlien Dictionary (Leetcode Premium)\u003c/h2\u003e\r\n\u003ch2\u003eGraph Valid Tree (Leetcode Premium)\u003c/h2\u003e\r\n\u003ch2\u003eNumber of Connected Components in an Undirected Graph (Leetcode Premium)\u003c/h2\u003e\r\n\u003ch2\u003eInsert Interval\u003c/h2\u003e\r\n\u003ch2\u003eMerge Intervals\u003c/h2\u003e\r\n\u003ch2\u003eNon-overlapping Intervals\u003c/h2\u003e\r\n\u003ch2\u003eMeeting Rooms\u003c/h2\u003e\r\n\u003ch2\u003eMeeting Rooms II\u003c/h2\u003e\r\n\u003ch2\u003eReverse a Linked List\u003c/h2\u003e\r\n\u003ch2\u003eDetect Cycle in a Linked List\u003c/h2\u003e\r\n\u003ch2\u003eMerge Two Sorted Lists\u003c/h2\u003e\r\n\u003ch2\u003eMerge K Sorted Lists\u003c/h2\u003e\r\n\u003ch2\u003eRemove Nth Node From End Of List\u003c/h2\u003e\r\n\u003ch2\u003eReorder List\u003c/h2\u003e\r\n\u003ch2\u003eSet Matrix Zeroes\u003c/h2\u003e\r\n\u003ch2\u003eSpiral Matrix\u003c/h2\u003e\r\n\u003ch2\u003eRotate Image\u003c/h2\u003e\r\n\u003ch2\u003eWord Search\u003c/h2\u003e\r\n\u003ch2\u003eLongest Substring Without Repeating Characters\u003c/h2\u003e\r\n\u003ch2\u003eLongest Repeating Character Replacement\u003c/h2\u003e\r\n\u003ch2\u003eMinimum Window Substring\u003c/h2\u003e\r\n\u003ch2\u003eValid Anagram\u003c/h2\u003e\r\n\u003ch2\u003eGroup Anagrams\u003c/h2\u003e\r\n\u003ch2\u003eValid Parentheses\u003c/h2\u003e\r\n\u003ch2\u003eValid Palindrome\u003c/h2\u003e\r\n\u003ch2\u003eLongest Palindromic Substring\u003c/h2\u003e\r\n\u003ch2\u003ePalindromic Substrings\u003c/h2\u003e\r\n\u003ch2\u003eEncode and Decode Strings (Leetcode Premium)\u003c/h2\u003e\r\n\u003ch2\u003eMaximum Depth of Binary Tree\u003c/h2\u003e\r\n\u003ch2\u003eSame Tree\u003c/h2\u003e\r\n\u003ch2\u003eInvert/Flip Binary Tree\u003c/h2\u003e\r\n\u003ch2\u003eBinary Tree Maximum Path Sum\u003c/h2\u003e\r\n\u003ch2\u003eBinary Tree Level Order Traversal\u003c/h2\u003e\r\n\u003ch2\u003eSerialize and Deserialize Binary Tree\u003c/h2\u003e\r\n  \u003ch2\u003eSubtree of Another Tree\u003c/h2\u003e\r\n\u003ch2\u003eConstruct Binary Tree from Preorder and Inorder Traversal\u003c/h2\u003e\r\n\u003ch2\u003eValidate Binary Search Tree\u003c/h2\u003e\r\n\u003ch2\u003eKth Smallest Element in a BST\u003c/h2\u003e\r\n\u003ch2\u003eLowest Common Ancestor of BST\u003c/h2\u003e\r\n\u003ch2\u003eImplement Trie (Prefix Tree)\u003c/h2\u003e\r\n\u003ch2\u003eAdd and Search Word\u003c/h2\u003e\r\n\u003ch2\u003eWord Search II\u003c/h2\u003e\r\n\u003ch2\u003eMerge K Sorted Lists\u003c/h2\u003e\r\n\u003ch2\u003eTop K Frequent Elements\u003c/h2\u003e\r\n  \u003ch1\u003eThanks \u0026 tegards\u003c/h1\u003e 😮‍💨\r\n\u003c/\r\n  \r\n### i dont know tree structure\r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsameerkali%2Fdsa_75","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsameerkali%2Fdsa_75","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsameerkali%2Fdsa_75/lists"}