{"id":25814623,"url":"https://github.com/sunthecoder/study","last_synced_at":"2026-02-09T04:37:22.414Z","repository":{"id":275841780,"uuid":"927196762","full_name":"SunTheCoder/Study","owner":"SunTheCoder","description":"Study Repo","archived":false,"fork":false,"pushed_at":"2025-02-08T17:43:28.000Z","size":368,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-08-01T22:58:29.967Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/SunTheCoder.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":"2025-02-04T15:08:41.000Z","updated_at":"2025-02-08T17:43:31.000Z","dependencies_parsed_at":"2025-02-04T21:39:54.438Z","dependency_job_id":"2b0af61e-5dd3-4e3a-adb1-5f06545612ab","html_url":"https://github.com/SunTheCoder/Study","commit_stats":null,"previous_names":["sunthecoder/study"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/SunTheCoder/Study","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SunTheCoder%2FStudy","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SunTheCoder%2FStudy/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SunTheCoder%2FStudy/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SunTheCoder%2FStudy/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SunTheCoder","download_url":"https://codeload.github.com/SunTheCoder/Study/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SunTheCoder%2FStudy/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29256713,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-09T04:11:57.159Z","status":"ssl_error","status_checked_at":"2026-02-09T04:11:56.117Z","response_time":56,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":[],"created_at":"2025-02-28T03:31:18.794Z","updated_at":"2026-02-09T04:37:22.366Z","avatar_url":"https://github.com/SunTheCoder.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# Study\n\n- \u003cspan style=\"color: red;\"\u003eResizing Arrays is expensive\u003c/span\u003e\n\n## Linked List\n\n[Linked List](LinkedList.md)\n\n[Middle of the Linked List](MiddleOfTheLinkedList.md)\n\n[Linked List Cycle](LinkedListCycle.md)\n\n[Delete Middle Node of a Linked List](DeleteMiddleNodeOfaLinkedList.md)\n\n[Remove Duplicates from Sorted List](RemoveDuplicatesFromSortedList.md)\n\n\n## Sieve of Eratosthenes\n\n\u003cspan style=\"color: red;\"\u003ePriority: High\u003c/span\u003e\n\n[Sieve of Eratosthenes](SieveOfEratosthenes.md)\n\n- Time Complexity: O(n log log n)\n- Space Complexity: O(n)\n- Used to find all prime numbers up to a given limit\n\n```javascript\nfunction sieveOfEratosthenes(n) {\n  const isPrime = new Array(n + 1).fill(true);\n  isPrime[0] = isPrime[1] = false;\n\n  for (let i = 2; i * i \u003c= n; i++) {\n    if (isPrime[i]) {\n      for (let j = i * i; j \u003c= n; j += i) {\n        isPrime[j] = false;\n      }\n    }\n  } \n\n  const primes = [];\n  for (let i = 2; i \u003c= n; i++) {\n    if (isPrime[i]) {\n      primes.push(i);\n    }\n  } \n\n  return primes;\n}   \n``` \n## Tuple Same Product\n\n\u003cspan style=\"color: red;\"\u003ePriority: High\u003c/span\u003e\n\n[Tuple Same Product](TupleSameProduct.md)\n\n\n## Sliding Window\n\n\u003cspan style=\"color: red;\"\u003ePriority: High\u003c/span\u003e\n\n[Find Index of First Occurence in a String](FindIndexOfFirstOccurenceInAString.md)\n\n### Distint Numbers in Each Subarray\n\n\u003cspan style=\"color: red;\"\u003ePriority: High\u003c/span\u003e\n\n[Distinct Numbers in Each Subarray](DistinctNumbersInEachSubArray.md)\n\n- Time Complexity: O(n)\n- Space Complexity: O(n)\n- Used to find the number of distinct numbers in each subarray\n\n## Two Pointers\n\n[Two Pointers](TwoPointers.md)\n\n\n\n## Prefix Sum\n\n\n## Hash Table\n\n\u003cspan style=\"color: red;\"\u003ePriority: High\u003c/span\u003e\n\n[Sentence Similarity](SentenceSimilarity.md)\n\n[Next Greater Element](NextGreaterElement.md)\n\n## Stacks\n\n\u003cspan style=\"color: red;\"\u003ePriority: High\u003c/span\u003e\n\n[Stacks](Stacks.md)\n\n[Simplify Path](SimplifyPath.md)\n\n[IsValid](IsValid.md)\n\n[Reverse Prefix of Word](ReversePrefixOfWord.md)\n\n[Next Greater Element](NextGreaterElement.md)\n\n[Moving Average from Data Stream](MovingAverageFromDataStream.md)\n\n## Queue\n\n[Queue](Queue.md)\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsunthecoder%2Fstudy","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsunthecoder%2Fstudy","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsunthecoder%2Fstudy/lists"}