{"id":15563176,"url":"https://github.com/tush-tr/ps-practice-to-code","last_synced_at":"2025-03-29T05:13:03.747Z","repository":{"id":46821906,"uuid":"310603109","full_name":"tush-tr/ps-practice-to-code","owner":"tush-tr","description":"Questions for practice in many languages-- C language, C++, Python 3, JavaScript","archived":false,"fork":false,"pushed_at":"2025-03-11T16:32:56.000Z","size":293,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"Leetcode/GFG","last_synced_at":"2025-03-11T17:44:14.178Z","etag":null,"topics":["dsa","dsa-algorithm","dsa-learning-series","dsa-practice","geeksforgeeks","hackerrank","leetcode"],"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/tush-tr.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":"2020-11-06T13:21:19.000Z","updated_at":"2025-03-11T16:32:59.000Z","dependencies_parsed_at":"2024-12-09T03:40:41.882Z","dependency_job_id":"daee47ef-f631-4e36-a5ac-56924b3d6efe","html_url":"https://github.com/tush-tr/ps-practice-to-code","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/tush-tr%2Fps-practice-to-code","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tush-tr%2Fps-practice-to-code/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tush-tr%2Fps-practice-to-code/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tush-tr%2Fps-practice-to-code/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tush-tr","download_url":"https://codeload.github.com/tush-tr/ps-practice-to-code/tar.gz/refs/heads/Leetcode/GFG","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246140592,"owners_count":20729802,"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":["dsa","dsa-algorithm","dsa-learning-series","dsa-practice","geeksforgeeks","hackerrank","leetcode"],"created_at":"2024-10-02T16:20:17.832Z","updated_at":"2025-03-29T05:13:03.741Z","avatar_url":"https://github.com/tush-tr.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cp align=\"center\"\u003e\n  \u003cimg width=\"5%\" src=\"https://user-images.githubusercontent.com/69134468/149906490-2fcac235-bc3e-4d4b-89a1-2cd3064bf1ef.png\"/\u003e\n  \u003cimg width=\"14%\" src=\"https://user-images.githubusercontent.com/69134468/139599658-8471e6db-f919-4606-899c-88d5b6e5d71a.png\"/\u003e\n  \u003cimg width=\"5%\" src=\"https://user-images.githubusercontent.com/69134468/149906490-2fcac235-bc3e-4d4b-89a1-2cd3064bf1ef.png\"/\u003e\n\u003c/p\u003e\n\n\n# Practice to Code\nQuestions for practice picked from Leetcode \u0026 Geeks for Geeks.\n\n\n## \u003ch3\u003e**Time Complexity:** \u003c/h3\u003e\n- [X] Follow the Rule: **10\u003csup\u003e8\u003c/sup\u003e** Operations \n\n\u003cimg align=\"right\" src=\"https://github.com/Iamtripathisatyam/iamtripathisatyam/blob/master/Content/rock.gif\" width=\"200\"/\u003e\n\n| Length of Input (N) | Worst Accepted Algorithm |\n| --------------  | ------------- |\n| **≤ [10..11]**| **O(N!), O(N\u003csup\u003e6\u003c/sup\u003e)** |\n| **≤ [15..18]** | **O(2\u003csup\u003eN\u003c/sup\u003e * N\u003csup\u003e2\u003c/sup\u003e)**  |\n| **≤ [18..22]**  | **O(2\u003csup\u003eN\u003c/sup\u003e * N)** |\n| **≤ 100**   | **O(N\u003csup\u003e4\u003c/sup\u003e)** |\n| **≤ 400**   | **O(N\u003csup\u003e3\u003c/sup\u003e)** |\n| **≤ 2000**   | **O(N\u003csup\u003e2\u003c/sup\u003e * logN)** |\n| **≤ 10\u003csup\u003e4\u003c/sup\u003e**   | **O(N\u003csup\u003e2\u003c/sup\u003e)** |\n| **≤ 10\u003csup\u003e5\u003c/sup\u003e**   |  **O(N * logN)** |\n| **≤ 10\u003csup\u003e6\u003c/sup\u003e**   | **O(N)**, **O(logN)**, **O(1)** |\n\n\u003eReadme Credits: \u003ca href=\"https://github.com/Iamtripathisatyam/\"\u003eSatyam Tripathi\u003c/a\u003e\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/tush-tr/ps-practice-to-code/tree/master/0001-two-sum) |\n| [0217-contains-duplicate](https://github.com/tush-tr/ps-practice-to-code/tree/master/0217-contains-duplicate) |\n| [1392-find-the-difference-of-two-arrays](https://github.com/tush-tr/ps-practice-to-code/tree/master/1392-find-the-difference-of-two-arrays) |\n| [2792-neighboring-bitwise-xor](https://github.com/tush-tr/ps-practice-to-code/tree/master/2792-neighboring-bitwise-xor) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/tush-tr/ps-practice-to-code/tree/master/0001-two-sum) |\n| [0217-contains-duplicate](https://github.com/tush-tr/ps-practice-to-code/tree/master/0217-contains-duplicate) |\n| [1392-find-the-difference-of-two-arrays](https://github.com/tush-tr/ps-practice-to-code/tree/master/1392-find-the-difference-of-two-arrays) |\n## Bit Manipulation\n|  |\n| ------- |\n| [2792-neighboring-bitwise-xor](https://github.com/tush-tr/ps-practice-to-code/tree/master/2792-neighboring-bitwise-xor) |\n## Sorting\n|  |\n| ------- |\n| [0217-contains-duplicate](https://github.com/tush-tr/ps-practice-to-code/tree/master/0217-contains-duplicate) |\n## Two Pointers\n|  |\n| ------- |\n| [0125-valid-palindrome](https://github.com/tush-tr/ps-practice-to-code/tree/master/0125-valid-palindrome) |\n## String\n|  |\n| ------- |\n| [0125-valid-palindrome](https://github.com/tush-tr/ps-practice-to-code/tree/master/0125-valid-palindrome) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftush-tr%2Fps-practice-to-code","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftush-tr%2Fps-practice-to-code","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftush-tr%2Fps-practice-to-code/lists"}