https://github.com/sckonung/grind75
Leetcode Solutions for Grind 75
https://github.com/sckonung/grind75
algorithms csharp grind75 java leetcode leetcode-java leetcode-python python
Last synced: 4 months ago
JSON representation
Leetcode Solutions for Grind 75
- Host: GitHub
- URL: https://github.com/sckonung/grind75
- Owner: scKonung
- Created: 2023-07-07T09:55:00.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-06-14T07:55:06.000Z (over 1 year ago)
- Last Synced: 2025-03-31T23:56:40.799Z (8 months ago)
- Topics: algorithms, csharp, grind75, java, leetcode, leetcode-java, leetcode-python, python
- Language: Java
- Homepage:
- Size: 107 KB
- Stars: 0
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Grind 75
This 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&order=difficulty&hours=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.
##### Problem solved 14/75
- [ ] [Array](#array) (11)
- [ ] [Stack](#stack) (7)
- [ ] [Linked-List](#linked-list) (5)
- [ ] [String](#string) (8)
- [ ] [Binary Tree](#binary-tree) (9)
- [ ] [Binary Search](#binary-search) (5)
- [ ] [Graph](#graph) (10)
- [ ] [Dynamic Programming](#dynamic-programming) (5)
- [ ] [Binary Search Tree](#binary-search-tree) (3)
- [ ] [Hash Table](#hash-table) (1)
- [ ] [Binary](#binary) (1)
- [ ] [Heap](#heap) (4)
- [ ] [Trie](#trie) (2)
- [ ] [Recursion](#recursion) (3)
- [ ] [Matrix](#matrix) (1)
### Array
- [x] [Two Sum](https://leetcode.com/problems/two-sum) - [Solution](/Array/1.%20Two%20Sum/)
- [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)
- [ ] [Contains Duplicate](https://leetcode.com/problems/contains-duplicate)
- [ ] [Majority Element](https://leetcode.com/problems/majority-element)
- [ ] [Insert Interval](https://leetcode.com/problems/insert-interval)
- [x] [3Sum](https://leetcode.com/problems/3sum/) - [Solution](/Array/15.%203Sum/)
- [ ] [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self)
- [ ] [Combination Sum](https://leetcode.com/problems/combination-sum)
- [ ] [Merge Intervals](https://leetcode.com/problems/merge-intervals)
- [ ] [Sort Colors](https://leetcode.com/problems/sort-colors)
- [x] [Container With Most Water](https://leetcode.com/problems/container-with-most-water) - [Solution](/Array/11.%20Container%20With%20Most%20Water/)
---
### Stack
- [x] [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) - [Solution](/Stack/20.%20Valid%20Parentheses)
- [ ] [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks)
- [ ] [Min Stack](https://leetcode.com/problems/min-stack)
- [ ] [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation)
- [ ] [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water)
- [ ] [Basic Calculator](https://leetcode.com/problems/basic-calculator)
- [ ] [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram)
---
### Linked List
- [x] [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) - [Solution](/Linked%20List/21.%20Merge%20Two%20Sorted%20Lists)
- [ ] [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle)
- [ ] [Reverse a Linked List](https://leetcode.com/problems/reverse-linked-list)
- [ ] [Middle of the Linked List](https://leetcode.com/problems/remove-nth-node-from-end-of-list)
- [ ] [LRU Cache](https://leetcode.com/problems/reorder-list)
---
### String
- [x] [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) - [Solution](/String/125.%20Valid%20Palindrome)
- [ ] [Valid Anagram](https://leetcode.com/problems/valid-anagram)
- [ ] [Longest Palindrome](https://leetcode.com/problems/longest-palindrome)
- [x] [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) - [Solution](/String/3.%20Longest%20Substring%20Without%20Repeating%20Characters)
- [x] [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) - [Solution](/String/8.%20String%20to%20Integer%20(atoi))
- [x] [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) - [Solution](/String/5.%20Longest%20Palindromic%20Substring)
- [ ] [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string)
- [ ] [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)
---
### Binary Tree
- [x] [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) - [Solution](/Binary%20Tree/226.%20Invert%20Binary%20Tree)
- [x] [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) - [Solution](/Binary%20Tree/110.%Balanced%20Binary%20Tree)
- [ ] [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree)
- [ ] [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)
- [ ] [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal)
- [ ] [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree)
- [ ] [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)
- [ ] [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal)
- [ ] [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree)
---
### Binary Search
- [ ] [Binary Search](https://leetcode.com/problems/binary-search)
- [ ] [First Bad Version](https://leetcode.com/problems/first-bad-version)
- [x] [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) - [Solution](/Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array)
- [ ] [Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store)
- [ ] [Maximum Profit in Job Scheduling](https://leetcode.com/problems/maximum-profit-in-job-scheduling)
---
### Graph
- [x] [Flood Fill](https://leetcode.com/problems/flood-fill) - [Solution](/Graph/733.%20Flood%20Fill)
- [ ] [01 Matrix](https://leetcode.com/problems/01-matrix)
- [ ] [Clone Graph](https://leetcode.com/problems/clone-graph)
- [ ] [Course Schedule](https://leetcode.com/problems/course-schedule)
- [ ] [Number of Islands](https://leetcode.com/problems/number-of-islands)
- [ ] [Rotting Oranges](https://leetcode.com/problems/rotting-oranges)
- [ ] [Accounts Merge](https://leetcode.com/problems/accounts-merge)
- [ ] [Word Search](https://leetcode.com/problems/word-search)
- [ ] [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees)
- [ ] [Word Ladder](https://leetcode.com/problems/word-ladder)
---
### Dynamic Programming
- [ ] [Maximum Subarray](https://leetcode.com/problems/maximum-subarray)
- [ ] [Climbing Stairs](https://leetcode.com/problems/climbing-stairs)
- [ ] [Coin Change](https://leetcode.com/problems/coin-change)
- [ ] [Partition Equal Subset Sum](https://leetcode.com/problems/maximum-subarray)
- [ ] [Unique Paths](https://leetcode.com/problems/unique-paths)
---
### Binary Search Tree
- [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)
- [ ] [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree)
- [ ] [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst)
---
### Hash Table
- [ ] [Ransom Note](https://leetcode.com/problems/ransom-note)
---
### Binary
- [ ] [Add Binary](https://leetcode.com/problems/add-binary)
---
### Heap
- [ ] [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin)
- [ ] [Task Scheduler](https://leetcode.com/problems/task-scheduler)
- [ ] [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)
- [x] [Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) - [Solution](/Heap/23.%20Merge%20k%20Sorted%20Lists)
---
### Trie
- [ ] [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree)
- [ ] [Word Break](https://leetcode.com/problems/word-break)
---
### Recursion
- [ ] [Permutations](https://leetcode.com/problems/permutations)
- [ ] [Subsets](https://leetcode.com/problems/subsets)
- [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)
---
### Matrix
- [ ] [Spiral Matrix](https://leetcode.com/problems/spiral-matrix)