https://github.com/sandyg6/problem-solving
Problem solving
https://github.com/sandyg6/problem-solving
c cpp java python
Last synced: 3 months ago
JSON representation
Problem solving
- Host: GitHub
- URL: https://github.com/sandyg6/problem-solving
- Owner: sandyg6
- Created: 2024-05-03T04:15:31.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2024-05-22T15:24:23.000Z (about 2 years ago)
- Last Synced: 2024-05-22T15:39:17.932Z (about 2 years ago)
- Topics: c, cpp, java, python
- Language: Java
- Homepage:
- Size: 124 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Problem-Solving
Practicing LeetCode Problems
# LeetCode Topics
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/sandyg6/Problem-Solving/tree/master/0001-two-sum) |
| [0004-median-of-two-sorted-arrays](https://github.com/sandyg6/Problem-Solving/tree/master/0004-median-of-two-sorted-arrays) |
| [0011-container-with-most-water](https://github.com/sandyg6/Problem-Solving/tree/master/0011-container-with-most-water) |
| [0027-remove-element](https://github.com/sandyg6/Problem-Solving/tree/master/0027-remove-element) |
| [0048-rotate-image](https://github.com/sandyg6/Problem-Solving/tree/master/0048-rotate-image) |
| [0049-group-anagrams](https://github.com/sandyg6/Problem-Solving/tree/master/0049-group-anagrams) |
| [0084-largest-rectangle-in-histogram](https://github.com/sandyg6/Problem-Solving/tree/master/0084-largest-rectangle-in-histogram) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0134-gas-station](https://github.com/sandyg6/Problem-Solving/tree/master/0134-gas-station) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/sandyg6/Problem-Solving/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0283-move-zeroes](https://github.com/sandyg6/Problem-Solving/tree/master/0283-move-zeroes) |
| [0645-set-mismatch](https://github.com/sandyg6/Problem-Solving/tree/master/0645-set-mismatch) |
| [1319-unique-number-of-occurrences](https://github.com/sandyg6/Problem-Solving/tree/master/1319-unique-number-of-occurrences) |
| [1505-create-target-array-in-the-given-order](https://github.com/sandyg6/Problem-Solving/tree/master/1505-create-target-array-in-the-given-order) |
| [2058-concatenation-of-array](https://github.com/sandyg6/Problem-Solving/tree/master/2058-concatenation-of-array) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/sandyg6/Problem-Solving/tree/master/0001-two-sum) |
| [0049-group-anagrams](https://github.com/sandyg6/Problem-Solving/tree/master/0049-group-anagrams) |
| [0141-linked-list-cycle](https://github.com/sandyg6/Problem-Solving/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/sandyg6/Problem-Solving/tree/master/0142-linked-list-cycle-ii) |
| [0160-intersection-of-two-linked-lists](https://github.com/sandyg6/Problem-Solving/tree/master/0160-intersection-of-two-linked-lists) |
| [0202-happy-number](https://github.com/sandyg6/Problem-Solving/tree/master/0202-happy-number) |
| [0387-first-unique-character-in-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0387-first-unique-character-in-a-string) |
| [0645-set-mismatch](https://github.com/sandyg6/Problem-Solving/tree/master/0645-set-mismatch) |
| [1319-unique-number-of-occurrences](https://github.com/sandyg6/Problem-Solving/tree/master/1319-unique-number-of-occurrences) |
## Stack
| |
| ------- |
| [0084-largest-rectangle-in-histogram](https://github.com/sandyg6/Problem-Solving/tree/master/0084-largest-rectangle-in-histogram) |
| [0094-binary-tree-inorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0094-binary-tree-inorder-traversal) |
| [0144-binary-tree-preorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0145-binary-tree-postorder-traversal) |
| [0225-implement-stack-using-queues](https://github.com/sandyg6/Problem-Solving/tree/master/0225-implement-stack-using-queues) |
| [0234-palindrome-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0234-palindrome-linked-list) |
## Monotonic Stack
| |
| ------- |
| [0084-largest-rectangle-in-histogram](https://github.com/sandyg6/Problem-Solving/tree/master/0084-largest-rectangle-in-histogram) |
## String
| |
| ------- |
| [0049-group-anagrams](https://github.com/sandyg6/Problem-Solving/tree/master/0049-group-anagrams) |
| [0125-valid-palindrome](https://github.com/sandyg6/Problem-Solving/tree/master/0125-valid-palindrome) |
| [0151-reverse-words-in-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0151-reverse-words-in-a-string) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0344-reverse-string](https://github.com/sandyg6/Problem-Solving/tree/master/0344-reverse-string) |
| [0345-reverse-vowels-of-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0345-reverse-vowels-of-a-string) |
| [0387-first-unique-character-in-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0387-first-unique-character-in-a-string) |
| [3636-check-balanced-string](https://github.com/sandyg6/Problem-Solving/tree/master/3636-check-balanced-string) |
## Queue
| |
| ------- |
| [0225-implement-stack-using-queues](https://github.com/sandyg6/Problem-Solving/tree/master/0225-implement-stack-using-queues) |
| [0387-first-unique-character-in-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0387-first-unique-character-in-a-string) |
## Counting
| |
| ------- |
| [0387-first-unique-character-in-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0387-first-unique-character-in-a-string) |
## Design
| |
| ------- |
| [0225-implement-stack-using-queues](https://github.com/sandyg6/Problem-Solving/tree/master/0225-implement-stack-using-queues) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0297-serialize-and-deserialize-binary-tree) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/sandyg6/Problem-Solving/tree/master/0011-container-with-most-water) |
| [0134-gas-station](https://github.com/sandyg6/Problem-Solving/tree/master/0134-gas-station) |
## Two Pointers
| |
| ------- |
| [0011-container-with-most-water](https://github.com/sandyg6/Problem-Solving/tree/master/0011-container-with-most-water) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/sandyg6/Problem-Solving/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0027-remove-element](https://github.com/sandyg6/Problem-Solving/tree/master/0027-remove-element) |
| [0125-valid-palindrome](https://github.com/sandyg6/Problem-Solving/tree/master/0125-valid-palindrome) |
| [0141-linked-list-cycle](https://github.com/sandyg6/Problem-Solving/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/sandyg6/Problem-Solving/tree/master/0142-linked-list-cycle-ii) |
| [0151-reverse-words-in-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0151-reverse-words-in-a-string) |
| [0160-intersection-of-two-linked-lists](https://github.com/sandyg6/Problem-Solving/tree/master/0160-intersection-of-two-linked-lists) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/sandyg6/Problem-Solving/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0202-happy-number](https://github.com/sandyg6/Problem-Solving/tree/master/0202-happy-number) |
| [0234-palindrome-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0234-palindrome-linked-list) |
| [0283-move-zeroes](https://github.com/sandyg6/Problem-Solving/tree/master/0283-move-zeroes) |
| [0344-reverse-string](https://github.com/sandyg6/Problem-Solving/tree/master/0344-reverse-string) |
| [0345-reverse-vowels-of-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0345-reverse-vowels-of-a-string) |
| [0908-middle-of-the-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0908-middle-of-the-linked-list) |
## Linked List
| |
| ------- |
| [0019-remove-nth-node-from-end-of-list](https://github.com/sandyg6/Problem-Solving/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0021-merge-two-sorted-lists](https://github.com/sandyg6/Problem-Solving/tree/master/0021-merge-two-sorted-lists) |
| [0083-remove-duplicates-from-sorted-list](https://github.com/sandyg6/Problem-Solving/tree/master/0083-remove-duplicates-from-sorted-list) |
| [0141-linked-list-cycle](https://github.com/sandyg6/Problem-Solving/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/sandyg6/Problem-Solving/tree/master/0142-linked-list-cycle-ii) |
| [0160-intersection-of-two-linked-lists](https://github.com/sandyg6/Problem-Solving/tree/master/0160-intersection-of-two-linked-lists) |
| [0206-reverse-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0234-palindrome-linked-list) |
| [0908-middle-of-the-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0908-middle-of-the-linked-list) |
## Recursion
| |
| ------- |
| [0021-merge-two-sorted-lists](https://github.com/sandyg6/Problem-Solving/tree/master/0021-merge-two-sorted-lists) |
| [0050-powx-n](https://github.com/sandyg6/Problem-Solving/tree/master/0050-powx-n) |
| [0206-reverse-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0234-palindrome-linked-list) |
## Binary Search
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/sandyg6/Problem-Solving/tree/master/0004-median-of-two-sorted-arrays) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/sandyg6/Problem-Solving/tree/master/0167-two-sum-ii-input-array-is-sorted) |
## Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0094-binary-tree-inorder-traversal) |
| [0102-binary-tree-level-order-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0102-binary-tree-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0104-maximum-depth-of-binary-tree) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0110-balanced-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0110-balanced-binary-tree) |
| [0112-path-sum](https://github.com/sandyg6/Problem-Solving/tree/master/0112-path-sum) |
| [0144-binary-tree-preorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0145-binary-tree-postorder-traversal) |
| [0199-binary-tree-right-side-view](https://github.com/sandyg6/Problem-Solving/tree/master/0199-binary-tree-right-side-view) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0450-delete-node-in-a-bst](https://github.com/sandyg6/Problem-Solving/tree/master/0450-delete-node-in-a-bst) |
| [0637-average-of-levels-in-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0637-average-of-levels-in-binary-tree) |
| [0783-search-in-a-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0783-search-in-a-binary-search-tree) |
## Depth-First Search
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0094-binary-tree-inorder-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0104-maximum-depth-of-binary-tree) |
| [0110-balanced-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0110-balanced-binary-tree) |
| [0112-path-sum](https://github.com/sandyg6/Problem-Solving/tree/master/0112-path-sum) |
| [0144-binary-tree-preorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0145-binary-tree-postorder-traversal) |
| [0199-binary-tree-right-side-view](https://github.com/sandyg6/Problem-Solving/tree/master/0199-binary-tree-right-side-view) |
| [0207-course-schedule](https://github.com/sandyg6/Problem-Solving/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/sandyg6/Problem-Solving/tree/master/0210-course-schedule-ii) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0637-average-of-levels-in-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0637-average-of-levels-in-binary-tree) |
| [0813-all-paths-from-source-to-target](https://github.com/sandyg6/Problem-Solving/tree/master/0813-all-paths-from-source-to-target) |
## Binary Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0094-binary-tree-inorder-traversal) |
| [0102-binary-tree-level-order-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0102-binary-tree-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0104-maximum-depth-of-binary-tree) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0110-balanced-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0110-balanced-binary-tree) |
| [0112-path-sum](https://github.com/sandyg6/Problem-Solving/tree/master/0112-path-sum) |
| [0144-binary-tree-preorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0145-binary-tree-postorder-traversal) |
| [0199-binary-tree-right-side-view](https://github.com/sandyg6/Problem-Solving/tree/master/0199-binary-tree-right-side-view) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0450-delete-node-in-a-bst](https://github.com/sandyg6/Problem-Solving/tree/master/0450-delete-node-in-a-bst) |
| [0637-average-of-levels-in-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0637-average-of-levels-in-binary-tree) |
| [0783-search-in-a-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0783-search-in-a-binary-search-tree) |
## Breadth-First Search
| |
| ------- |
| [0102-binary-tree-level-order-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0102-binary-tree-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0104-maximum-depth-of-binary-tree) |
| [0112-path-sum](https://github.com/sandyg6/Problem-Solving/tree/master/0112-path-sum) |
| [0199-binary-tree-right-side-view](https://github.com/sandyg6/Problem-Solving/tree/master/0199-binary-tree-right-side-view) |
| [0207-course-schedule](https://github.com/sandyg6/Problem-Solving/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/sandyg6/Problem-Solving/tree/master/0210-course-schedule-ii) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0637-average-of-levels-in-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0637-average-of-levels-in-binary-tree) |
| [0813-all-paths-from-source-to-target](https://github.com/sandyg6/Problem-Solving/tree/master/0813-all-paths-from-source-to-target) |
## Binary Search Tree
| |
| ------- |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0450-delete-node-in-a-bst](https://github.com/sandyg6/Problem-Solving/tree/master/0450-delete-node-in-a-bst) |
| [0783-search-in-a-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0783-search-in-a-binary-search-tree) |
## Math
| |
| ------- |
| [0009-palindrome-number](https://github.com/sandyg6/Problem-Solving/tree/master/0009-palindrome-number) |
| [0048-rotate-image](https://github.com/sandyg6/Problem-Solving/tree/master/0048-rotate-image) |
| [0050-powx-n](https://github.com/sandyg6/Problem-Solving/tree/master/0050-powx-n) |
| [0202-happy-number](https://github.com/sandyg6/Problem-Solving/tree/master/0202-happy-number) |
## Divide and Conquer
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/sandyg6/Problem-Solving/tree/master/0004-median-of-two-sorted-arrays) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
## Graph
| |
| ------- |
| [0207-course-schedule](https://github.com/sandyg6/Problem-Solving/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/sandyg6/Problem-Solving/tree/master/0210-course-schedule-ii) |
| [0813-all-paths-from-source-to-target](https://github.com/sandyg6/Problem-Solving/tree/master/0813-all-paths-from-source-to-target) |
## Topological Sort
| |
| ------- |
| [0207-course-schedule](https://github.com/sandyg6/Problem-Solving/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/sandyg6/Problem-Solving/tree/master/0210-course-schedule-ii) |
## Matrix
| |
| ------- |
| [0048-rotate-image](https://github.com/sandyg6/Problem-Solving/tree/master/0048-rotate-image) |
## Simulation
| |
| ------- |
| [1505-create-target-array-in-the-given-order](https://github.com/sandyg6/Problem-Solving/tree/master/1505-create-target-array-in-the-given-order) |
| [2058-concatenation-of-array](https://github.com/sandyg6/Problem-Solving/tree/master/2058-concatenation-of-array) |
## Backtracking
| |
| ------- |
| [0813-all-paths-from-source-to-target](https://github.com/sandyg6/Problem-Solving/tree/master/0813-all-paths-from-source-to-target) |
## Bit Manipulation
| |
| ------- |
| [0645-set-mismatch](https://github.com/sandyg6/Problem-Solving/tree/master/0645-set-mismatch) |
## Sorting
| |
| ------- |
| [0049-group-anagrams](https://github.com/sandyg6/Problem-Solving/tree/master/0049-group-anagrams) |
| [0645-set-mismatch](https://github.com/sandyg6/Problem-Solving/tree/master/0645-set-mismatch) |