{"id":21315491,"url":"https://github.com/rajsoni03/leetcode","last_synced_at":"2025-03-15T21:26:25.802Z","repository":{"id":44151976,"uuid":"447548762","full_name":"Rajsoni03/LeetCode","owner":"Rajsoni03","description":null,"archived":false,"fork":false,"pushed_at":"2022-07-08T17:41:28.000Z","size":85,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-22T10:32:19.780Z","etag":null,"topics":["competitive-programming","cpp","dynamic-programming","leetcode"],"latest_commit_sha":null,"homepage":"https://leetcode.com/Rajsoni03/","language":"C++","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/Rajsoni03.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}},"created_at":"2022-01-13T10:01:49.000Z","updated_at":"2022-06-18T16:55:28.000Z","dependencies_parsed_at":"2022-09-05T06:41:39.990Z","dependency_job_id":null,"html_url":"https://github.com/Rajsoni03/LeetCode","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/Rajsoni03%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Rajsoni03%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Rajsoni03%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Rajsoni03%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Rajsoni03","download_url":"https://codeload.github.com/Rajsoni03/LeetCode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243791648,"owners_count":20348493,"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":["competitive-programming","cpp","dynamic-programming","leetcode"],"created_at":"2024-11-21T18:20:48.549Z","updated_at":"2025-03-15T21:26:25.762Z","avatar_url":"https://github.com/Rajsoni03.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode\n\u003c!-- \n## **Easy Problems**\n\n| Problem Name  | Code  | Topic | Tagline |\n| :------------ |:---------------:| :---------------:| -----:|\n| [1. Two Sum](https://leetcode.com/problems/two-sum/) | [solution](1-two-sum.cpp) | Array, Map | None |\n| [9. Palindrome Number](https://leetcode.com/problems/palindrome-number/) | [solution](9-palindrome-number.cpp) | int | Mod and Divide |\n| [14. Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | [solution](14-longest-common-prefix.cpp) | int | Mod and Divide |\n\n\n## **Medium Problems**\n\n| Problem Name  | Code  | Topic | Tagline |\n| :------------ |:---------------:| :---------------:| -----:|\n| [2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [solution](2-add-two-numbers.cpp) | Linked List | parallel addition with reminders |\n| [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [solution](3-longest-substring-without-repeating-characters.cpp) | String, Map | None |\n| [7. Reverse Integer](https://leetcode.com/problems/reverse-integer/) | [solution](7-reverse-integer.cpp) | Int | abs |\n| [137. Single Number II](https://leetcode.com/problems/single-number-ii/) | [solution](137-single-number-ii.cpp) | Bitwise | XOR and AND |\n\n\n\n## **Hard Problems**\n\n| Problem Name  | Code  | Topic | Tagline |\n| :------------ |:---------------:| :---------------:| -----:|\n|               |                 |                  |       |\n\n\n# Dynamic Programming \n\n1 - Fibonacci Series\n2 - [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)\n3 - [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/)\n4 - [N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)\n\n --\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frajsoni03%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frajsoni03%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frajsoni03%2Fleetcode/lists"}