{"id":22579438,"url":"https://github.com/nkz-soft/leetcode","last_synced_at":"2025-06-30T21:34:03.228Z","repository":{"id":267017723,"uuid":"900023651","full_name":"nkz-soft/leetcode","owner":"nkz-soft","description":"LeetCode Problems' Solutions","archived":false,"fork":false,"pushed_at":"2025-01-05T12:24:08.000Z","size":22,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-28T16:21:48.401Z","etag":null,"topics":["algorithms","csharp","data-structures","interview","leetcode","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"C#","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/nkz-soft.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":"2024-12-07T16:53:39.000Z","updated_at":"2025-01-05T12:24:12.000Z","dependencies_parsed_at":"2024-12-24T13:38:03.622Z","dependency_job_id":"a5ebc12e-90aa-4fe3-a6eb-31f12c259c95","html_url":"https://github.com/nkz-soft/leetcode","commit_stats":null,"previous_names":["nkz-soft/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/nkz-soft/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nkz-soft%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nkz-soft%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nkz-soft%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nkz-soft%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nkz-soft","download_url":"https://codeload.github.com/nkz-soft/leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nkz-soft%2Fleetcode/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":262853996,"owners_count":23375040,"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":["algorithms","csharp","data-structures","interview","leetcode","leetcode-solutions"],"created_at":"2024-12-08T05:07:32.642Z","updated_at":"2025-06-30T21:34:03.107Z","avatar_url":"https://github.com/nkz-soft.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"LeetCode\n========\n\n### LeetCode Algorithm\n\n\n| #   | Title                                       | Solution                     | Difficulty |\n|-----|---------------------------------------------|------------------------------|------------|\n| 1   | [Two Sum](https://leetcode.com/problems/two-sum/) | [C#](./csharp/_1_Two_Sum/Solution.cs) | Easy |\n| 19  | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | [C#](./csharp/_19_Remove_Nth_Node_From_End_of_List/Solution.cs) | Medium |\n| 20  | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | [C#](./csharp/_20_Valid_Parentheses/Solution.cs)  | Easy |\n| 100 | [Same Tree](https://leetcode.com/problems/same-tree/) | [C#](./csharp/_100_Same_Tree/Solution.cs) | Easy |\n| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | [C#](./csharp/_108_Convert_Sorted_Array_to_Binary_Search_Tree/Solution.cs) | Easy |\n| 112 | [Path Sum](https://leetcode.com/problems/path-sum/) | [C#](./csharp/_112_Path_Sum/Solution.cs) | Easy |\n| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [C#](./csharp/_217_Contains Duplicate/Solution.cs) | Easy |\n| 304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) | [C#](./csharp/_304_Range_Sum_Query_2D_Immutable/Solution.cs) | Medium |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnkz-soft%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnkz-soft%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnkz-soft%2Fleetcode/lists"}