{"id":22038757,"url":"https://github.com/sckonung/grind75","last_synced_at":"2026-02-06T20:02:18.626Z","repository":{"id":179405408,"uuid":"663443782","full_name":"scKonung/Grind75","owner":"scKonung","description":"Leetcode Solutions  for Grind 75","archived":false,"fork":false,"pushed_at":"2024-06-14T07:55:06.000Z","size":110,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-07-26T09:12:18.768Z","etag":null,"topics":["algorithms","csharp","grind75","java","leetcode","leetcode-java","leetcode-python","python"],"latest_commit_sha":null,"homepage":"","language":"Java","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/scKonung.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-07-07T09:55:00.000Z","updated_at":"2024-08-19T13:04:33.000Z","dependencies_parsed_at":null,"dependency_job_id":"6373de2a-8a5b-40ec-adae-3da956480428","html_url":"https://github.com/scKonung/Grind75","commit_stats":null,"previous_names":["sckonung/blind75algorithms"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/scKonung/Grind75","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/scKonung%2FGrind75","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/scKonung%2FGrind75/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/scKonung%2FGrind75/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/scKonung%2FGrind75/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/scKonung","download_url":"https://codeload.github.com/scKonung/Grind75/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/scKonung%2FGrind75/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29174327,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-06T19:56:27.068Z","status":"ssl_error","status_checked_at":"2026-02-06T19:56:18.934Z","response_time":59,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6: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":["algorithms","csharp","grind75","java","leetcode","leetcode-java","leetcode-python","python"],"created_at":"2024-11-30T11:07:42.346Z","updated_at":"2026-02-06T20:02:18.610Z","avatar_url":"https://github.com/scKonung.png","language":"Java","readme":"# Grind 75\nThis repository is a software engineer interview prep and algorithms training that provides solutions to 75 leetcode questions in Java, Python and C#. The original article can be found [here] (https://www.techinterviewhandbook.org/grind75?grouping=topics\u0026order=difficulty\u0026hours=8). The questions can be divided into 15 categories, including: Array, Stack, Linked List, String, Binary Tree, Binary Search, Graph, Dynamic Programming, Binary Search Tree, Hash Table, Binary, Heap, Trie, Recursion, and Matrix.\n\n##### Problem solved 14/75\n\n-   [ ] [Array](#array) (11)\n-   [ ] [Stack](#stack) (7)\n-   [ ] [Linked-List](#linked-list) (5)\n-   [ ] [String](#string) (8)\n-   [ ] [Binary Tree](#binary-tree) (9)\n-   [ ] [Binary Search](#binary-search) (5)\n-   [ ] [Graph](#graph) (10)\n-   [ ] [Dynamic Programming](#dynamic-programming) (5)\n-   [ ] [Binary Search Tree](#binary-search-tree) (3)\n-   [ ] [Hash Table](#hash-table) (1)\n-   [ ] [Binary](#binary) (1)\n-   [ ] [Heap](#heap) (4)\n-   [ ] [Trie](#trie) (2)\n-   [ ] [Recursion](#recursion) (3)\n-   [ ] [Matrix](#matrix) (1)\n\n### Array\n\n-   [x] [Two Sum](https://leetcode.com/problems/two-sum) - [Solution](/Array/1.%20Two%20Sum/)\n-   [x] [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) - [Solution](/Array/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock)\n-   [ ] [Contains Duplicate](https://leetcode.com/problems/contains-duplicate)\n-   [ ] [Majority Element](https://leetcode.com/problems/majority-element)\n-   [ ] [Insert Interval](https://leetcode.com/problems/insert-interval)\n-   [x] [3Sum](https://leetcode.com/problems/3sum/) - [Solution](/Array/15.%203Sum/)\n-   [ ] [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self)\n-   [ ] [Combination Sum](https://leetcode.com/problems/combination-sum)\n-   [ ] [Merge Intervals](https://leetcode.com/problems/merge-intervals)\n-   [ ] [Sort Colors](https://leetcode.com/problems/sort-colors)\n-   [x] [Container With Most Water](https://leetcode.com/problems/container-with-most-water) - [Solution](/Array/11.%20Container%20With%20Most%20Water/)\n\n---\n\n### Stack\n\n-   [x] [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) - [Solution](/Stack/20.%20Valid%20Parentheses)\n-   [ ] [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks)\n-   [ ] [Min Stack](https://leetcode.com/problems/min-stack)\n-   [ ] [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation)\n-   [ ] [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water)\n-   [ ] [Basic Calculator](https://leetcode.com/problems/basic-calculator)\n-   [ ] [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram)\n\n---\n\n### Linked List\n\n-   [x] [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) - [Solution](/Linked%20List/21.%20Merge%20Two%20Sorted%20Lists)\n-   [ ] [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle)\n-   [ ] [Reverse a Linked List](https://leetcode.com/problems/reverse-linked-list)\n-   [ ] [Middle of the Linked List](https://leetcode.com/problems/remove-nth-node-from-end-of-list)\n-   [ ] [LRU Cache](https://leetcode.com/problems/reorder-list)\n\n---\n\n### String\n\n-   [x] [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) - [Solution](/String/125.%20Valid%20Palindrome)\n-   [ ] [Valid Anagram](https://leetcode.com/problems/valid-anagram)\n-   [ ] [Longest Palindrome](https://leetcode.com/problems/longest-palindrome)\n-   [x] [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) - [Solution](/String/3.%20Longest%20Substring%20Without%20Repeating%20Characters)\n-   [x] [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) - [Solution](/String/8.%20String%20to%20Integer%20(atoi))\n-   [x] [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) - [Solution](/String/5.%20Longest%20Palindromic%20Substring)\n-   [ ] [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string)\n-   [ ] [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)\n\n---\n\n### Binary Tree\n\n-   [x] [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) - [Solution](/Binary%20Tree/226.%20Invert%20Binary%20Tree)\n-   [x] [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) - [Solution](/Binary%20Tree/110.%Balanced%20Binary%20Tree)\n-   [ ] [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree)\n-   [ ] [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)\n-   [ ] [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal)\n-   [ ] [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree)\n-   [ ] [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)\n-   [ ] [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal)\n-   [ ] [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree)\n\n---\n\n### Binary Search\n\n-   [ ] [Binary Search](https://leetcode.com/problems/binary-search)\n-   [ ] [First Bad Version](https://leetcode.com/problems/first-bad-version)\n-   [x] [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) - [Solution](/Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array)\n-   [ ] [Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store)\n-   [ ] [Maximum Profit in Job Scheduling](https://leetcode.com/problems/maximum-profit-in-job-scheduling)\n\n---\n\n### Graph\n\n-   [x] [Flood Fill](https://leetcode.com/problems/flood-fill) - [Solution](/Graph/733.%20Flood%20Fill)\n-   [ ] [01 Matrix](https://leetcode.com/problems/01-matrix)\n-   [ ] [Clone Graph](https://leetcode.com/problems/clone-graph)\n-   [ ] [Course Schedule](https://leetcode.com/problems/course-schedule)\n-   [ ] [Number of Islands](https://leetcode.com/problems/number-of-islands)\n-   [ ] [Rotting Oranges](https://leetcode.com/problems/rotting-oranges)\n-   [ ] [Accounts Merge](https://leetcode.com/problems/accounts-merge)\n-   [ ] [Word Search](https://leetcode.com/problems/word-search)\n-   [ ] [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees)\n-   [ ] [Word Ladder](https://leetcode.com/problems/word-ladder)\n\n---\n\n### Dynamic Programming\n\n-   [ ] [Maximum Subarray](https://leetcode.com/problems/maximum-subarray)\n-   [ ] [Climbing Stairs](https://leetcode.com/problems/climbing-stairs)\n-   [ ] [Coin Change](https://leetcode.com/problems/coin-change)\n-   [ ] [Partition Equal Subset Sum](https://leetcode.com/problems/maximum-subarray)\n-   [ ] [Unique Paths](https://leetcode.com/problems/unique-paths)\n\n---\n\n### Binary Search Tree\n\n-   [x] [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) - [Solution](/Binary%20Search%20Tree/235.%20LowestCommon%20Ancestor%20of%20a%20Binary%20Search%20Tree)\n-   [ ] [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree)\n-   [ ] [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst)\n\n---\n\n### Hash Table\n\n-   [ ] [Ransom Note](https://leetcode.com/problems/ransom-note)\n\n---\n\n### Binary\n\n-   [ ] [Add Binary](https://leetcode.com/problems/add-binary)\n\n---\n\n### Heap\n\n-   [ ] [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin)\n-   [ ] [Task Scheduler](https://leetcode.com/problems/task-scheduler)\n-   [ ] [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)\n-   [x] [Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) - [Solution](/Heap/23.%20Merge%20k%20Sorted%20Lists)\n\n---\n\n### Trie\n\n-   [ ] [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree)\n-   [ ] [Word Break](https://leetcode.com/problems/word-break)\n\n---\n\n### Recursion\n\n-   [ ] [Permutations](https://leetcode.com/problems/permutations)\n-   [ ] [Subsets](https://leetcode.com/problems/subsets)\n-   [x] [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) - [Solution](/Recursion/17.%20Letter%20Combinations%20of%20a%20Phone%20Number)\n\n---\n\n### Matrix\n\n-   [ ] [Spiral Matrix](https://leetcode.com/problems/spiral-matrix)\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsckonung%2Fgrind75","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsckonung%2Fgrind75","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsckonung%2Fgrind75/lists"}