https://github.com/thushar003/leetcode-and-stuff
LeetCode solutions, programming contest and small sized programs. (Solutions sync to this repo using LeetHub)
https://github.com/thushar003/leetcode-and-stuff
cpp leetcode python
Last synced: 3 months ago
JSON representation
LeetCode solutions, programming contest and small sized programs. (Solutions sync to this repo using LeetHub)
- Host: GitHub
- URL: https://github.com/thushar003/leetcode-and-stuff
- Owner: thushar003
- Created: 2024-07-25T22:22:22.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2025-04-02T23:51:52.000Z (7 months ago)
- Last Synced: 2025-04-03T00:27:34.905Z (7 months ago)
- Topics: cpp, leetcode, python
- Language: C++
- Homepage:
- Size: 90.8 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# leetcode-and-stuff
Just contains solutions to problems from LeetCode (and other such stuff).
1. Solutions to easy/medium/hard(?) problems from LeetCode
2. Code from programming competitions, etc.
3. Experiments that aren't complete programs, but I want to add here anyway
# LeetCode Topics
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/thushar003/cplusplus-mini-projects/tree/master/0002-add-two-numbers) |
| [0007-reverse-integer](https://github.com/thushar003/leetcode-and-stuff/tree/master/0007-reverse-integer) |
| [0009-palindrome-number](https://github.com/thushar003/cplusplus-mini-projects/tree/master/0009-palindrome-number) |
| [0013-roman-to-integer](https://github.com/thushar003/leetcode-and-stuff/tree/master/0013-roman-to-integer) |
| [0029-divide-two-integers](https://github.com/thushar003/cplusplus-mini-projects/tree/master/0029-divide-two-integers) |
| [0066-plus-one](https://github.com/thushar003/leetcode-and-stuff/tree/master/0066-plus-one) |
| [0150-evaluate-reverse-polish-notation](https://github.com/thushar003/leetcode-and-stuff/tree/master/0150-evaluate-reverse-polish-notation) |
| [1146-greatest-common-divisor-of-strings](https://github.com/thushar003/leetcode-and-stuff/tree/master/1146-greatest-common-divisor-of-strings) |
| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/thushar003/cplusplus-mini-projects/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/thushar003/cplusplus-mini-projects/tree/master/0002-add-two-numbers) |
| [0206-reverse-linked-list](https://github.com/thushar003/leetcode-and-stuff/tree/master/0206-reverse-linked-list) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/thushar003/cplusplus-mini-projects/tree/master/0002-add-two-numbers) |
| [0206-reverse-linked-list](https://github.com/thushar003/leetcode-and-stuff/tree/master/0206-reverse-linked-list) |
## Bit Manipulation
| |
| ------- |
| [0029-divide-two-integers](https://github.com/thushar003/cplusplus-mini-projects/tree/master/0029-divide-two-integers) |
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/thushar003/cplusplus-mini-projects/tree/master/0001-two-sum) |
| [0004-median-of-two-sorted-arrays](https://github.com/thushar003/leetcode-and-stuff/tree/master/0004-median-of-two-sorted-arrays) |
| [0011-container-with-most-water](https://github.com/thushar003/leetcode-and-stuff/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/thushar003/leetcode-and-stuff/tree/master/0015-3sum) |
| [0036-valid-sudoku](https://github.com/thushar003/leetcode-and-stuff/tree/master/0036-valid-sudoku) |
| [0042-trapping-rain-water](https://github.com/thushar003/leetcode-and-stuff/tree/master/0042-trapping-rain-water) |
| [0049-group-anagrams](https://github.com/thushar003/leetcode-and-stuff/tree/master/0049-group-anagrams) |
| [0051-n-queens](https://github.com/thushar003/leetcode-and-stuff/tree/master/0051-n-queens) |
| [0066-plus-one](https://github.com/thushar003/leetcode-and-stuff/tree/master/0066-plus-one) |
| [0074-search-a-2d-matrix](https://github.com/thushar003/leetcode-and-stuff/tree/master/0074-search-a-2d-matrix) |
| [0128-longest-consecutive-sequence](https://github.com/thushar003/leetcode-and-stuff/tree/master/0128-longest-consecutive-sequence) |
| [0150-evaluate-reverse-polish-notation](https://github.com/thushar003/leetcode-and-stuff/tree/master/0150-evaluate-reverse-polish-notation) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/thushar003/leetcode-and-stuff/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0217-contains-duplicate](https://github.com/thushar003/leetcode-and-stuff/tree/master/0217-contains-duplicate) |
| [0238-product-of-array-except-self](https://github.com/thushar003/leetcode-and-stuff/tree/master/0238-product-of-array-except-self) |
| [0347-top-k-frequent-elements](https://github.com/thushar003/leetcode-and-stuff/tree/master/0347-top-k-frequent-elements) |
| [0792-binary-search](https://github.com/thushar003/leetcode-and-stuff/tree/master/0792-binary-search) |
| [1468-check-if-n-and-its-double-exist](https://github.com/thushar003/leetcode-and-stuff/tree/master/1468-check-if-n-and-its-double-exist) |
| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/thushar003/cplusplus-mini-projects/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/thushar003/cplusplus-mini-projects/tree/master/0001-two-sum) |
| [0003-longest-substring-without-repeating-characters](https://github.com/thushar003/leetcode-and-stuff/tree/master/0003-longest-substring-without-repeating-characters) |
| [0013-roman-to-integer](https://github.com/thushar003/leetcode-and-stuff/tree/master/0013-roman-to-integer) |
| [0036-valid-sudoku](https://github.com/thushar003/leetcode-and-stuff/tree/master/0036-valid-sudoku) |
| [0049-group-anagrams](https://github.com/thushar003/leetcode-and-stuff/tree/master/0049-group-anagrams) |
| [0128-longest-consecutive-sequence](https://github.com/thushar003/leetcode-and-stuff/tree/master/0128-longest-consecutive-sequence) |
| [0217-contains-duplicate](https://github.com/thushar003/leetcode-and-stuff/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/thushar003/leetcode-and-stuff/tree/master/0242-valid-anagram) |
| [0347-top-k-frequent-elements](https://github.com/thushar003/leetcode-and-stuff/tree/master/0347-top-k-frequent-elements) |
| [1468-check-if-n-and-its-double-exist](https://github.com/thushar003/leetcode-and-stuff/tree/master/1468-check-if-n-and-its-double-exist) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/thushar003/leetcode-and-stuff/tree/master/0015-3sum) |
| [0049-group-anagrams](https://github.com/thushar003/leetcode-and-stuff/tree/master/0049-group-anagrams) |
| [0217-contains-duplicate](https://github.com/thushar003/leetcode-and-stuff/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/thushar003/leetcode-and-stuff/tree/master/0242-valid-anagram) |
| [0347-top-k-frequent-elements](https://github.com/thushar003/leetcode-and-stuff/tree/master/0347-top-k-frequent-elements) |
| [1468-check-if-n-and-its-double-exist](https://github.com/thushar003/leetcode-and-stuff/tree/master/1468-check-if-n-and-its-double-exist) |
| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/thushar003/cplusplus-mini-projects/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |
## Matrix
| |
| ------- |
| [0036-valid-sudoku](https://github.com/thushar003/leetcode-and-stuff/tree/master/0036-valid-sudoku) |
| [0074-search-a-2d-matrix](https://github.com/thushar003/leetcode-and-stuff/tree/master/0074-search-a-2d-matrix) |
| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/thushar003/cplusplus-mini-projects/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |
## String
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/thushar003/leetcode-and-stuff/tree/master/0003-longest-substring-without-repeating-characters) |
| [0005-longest-palindromic-substring](https://github.com/thushar003/leetcode-and-stuff/tree/master/0005-longest-palindromic-substring) |
| [0013-roman-to-integer](https://github.com/thushar003/leetcode-and-stuff/tree/master/0013-roman-to-integer) |
| [0020-valid-parentheses](https://github.com/thushar003/leetcode-and-stuff/tree/master/0020-valid-parentheses) |
| [0049-group-anagrams](https://github.com/thushar003/leetcode-and-stuff/tree/master/0049-group-anagrams) |
| [0242-valid-anagram](https://github.com/thushar003/leetcode-and-stuff/tree/master/0242-valid-anagram) |
| [0647-palindromic-substrings](https://github.com/thushar003/leetcode-and-stuff/tree/master/0647-palindromic-substrings) |
| [1146-greatest-common-divisor-of-strings](https://github.com/thushar003/leetcode-and-stuff/tree/master/1146-greatest-common-divisor-of-strings) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/thushar003/leetcode-and-stuff/tree/master/0020-valid-parentheses) |
| [0042-trapping-rain-water](https://github.com/thushar003/leetcode-and-stuff/tree/master/0042-trapping-rain-water) |
| [0150-evaluate-reverse-polish-notation](https://github.com/thushar003/leetcode-and-stuff/tree/master/0150-evaluate-reverse-polish-notation) |
| [0155-min-stack](https://github.com/thushar003/leetcode-and-stuff/tree/master/0155-min-stack) |
## Sliding Window
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/thushar003/leetcode-and-stuff/tree/master/0003-longest-substring-without-repeating-characters) |
## Divide and Conquer
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/thushar003/leetcode-and-stuff/tree/master/0004-median-of-two-sorted-arrays) |
| [0347-top-k-frequent-elements](https://github.com/thushar003/leetcode-and-stuff/tree/master/0347-top-k-frequent-elements) |
## Heap (Priority Queue)
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/thushar003/leetcode-and-stuff/tree/master/0347-top-k-frequent-elements) |
## Bucket Sort
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/thushar003/leetcode-and-stuff/tree/master/0347-top-k-frequent-elements) |
## Counting
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/thushar003/leetcode-and-stuff/tree/master/0347-top-k-frequent-elements) |
## Quickselect
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/thushar003/leetcode-and-stuff/tree/master/0347-top-k-frequent-elements) |
## Binary Search
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/thushar003/leetcode-and-stuff/tree/master/0004-median-of-two-sorted-arrays) |
| [0074-search-a-2d-matrix](https://github.com/thushar003/leetcode-and-stuff/tree/master/0074-search-a-2d-matrix) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/thushar003/leetcode-and-stuff/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0792-binary-search](https://github.com/thushar003/leetcode-and-stuff/tree/master/0792-binary-search) |
| [1468-check-if-n-and-its-double-exist](https://github.com/thushar003/leetcode-and-stuff/tree/master/1468-check-if-n-and-its-double-exist) |
## Backtracking
| |
| ------- |
| [0051-n-queens](https://github.com/thushar003/leetcode-and-stuff/tree/master/0051-n-queens) |
## Two Pointers
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/thushar003/leetcode-and-stuff/tree/master/0005-longest-palindromic-substring) |
| [0011-container-with-most-water](https://github.com/thushar003/leetcode-and-stuff/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/thushar003/leetcode-and-stuff/tree/master/0015-3sum) |
| [0042-trapping-rain-water](https://github.com/thushar003/leetcode-and-stuff/tree/master/0042-trapping-rain-water) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/thushar003/leetcode-and-stuff/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0647-palindromic-substrings](https://github.com/thushar003/leetcode-and-stuff/tree/master/0647-palindromic-substrings) |
| [1468-check-if-n-and-its-double-exist](https://github.com/thushar003/leetcode-and-stuff/tree/master/1468-check-if-n-and-its-double-exist) |
## Prefix Sum
| |
| ------- |
| [0238-product-of-array-except-self](https://github.com/thushar003/leetcode-and-stuff/tree/master/0238-product-of-array-except-self) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/thushar003/leetcode-and-stuff/tree/master/0128-longest-consecutive-sequence) |
## Design
| |
| ------- |
| [0155-min-stack](https://github.com/thushar003/leetcode-and-stuff/tree/master/0155-min-stack) |
## Dynamic Programming
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/thushar003/leetcode-and-stuff/tree/master/0005-longest-palindromic-substring) |
| [0042-trapping-rain-water](https://github.com/thushar003/leetcode-and-stuff/tree/master/0042-trapping-rain-water) |
| [0647-palindromic-substrings](https://github.com/thushar003/leetcode-and-stuff/tree/master/0647-palindromic-substrings) |
## Monotonic Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/thushar003/leetcode-and-stuff/tree/master/0042-trapping-rain-water) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/thushar003/leetcode-and-stuff/tree/master/0011-container-with-most-water) |
## Tree
| |
| ------- |
| [0104-maximum-depth-of-binary-tree](https://github.com/thushar003/leetcode-and-stuff/tree/master/0104-maximum-depth-of-binary-tree) |
| [0226-invert-binary-tree](https://github.com/thushar003/leetcode-and-stuff/tree/master/0226-invert-binary-tree) |
## Depth-First Search
| |
| ------- |
| [0104-maximum-depth-of-binary-tree](https://github.com/thushar003/leetcode-and-stuff/tree/master/0104-maximum-depth-of-binary-tree) |
| [0226-invert-binary-tree](https://github.com/thushar003/leetcode-and-stuff/tree/master/0226-invert-binary-tree) |
## Breadth-First Search
| |
| ------- |
| [0104-maximum-depth-of-binary-tree](https://github.com/thushar003/leetcode-and-stuff/tree/master/0104-maximum-depth-of-binary-tree) |
| [0226-invert-binary-tree](https://github.com/thushar003/leetcode-and-stuff/tree/master/0226-invert-binary-tree) |
## Binary Tree
| |
| ------- |
| [0104-maximum-depth-of-binary-tree](https://github.com/thushar003/leetcode-and-stuff/tree/master/0104-maximum-depth-of-binary-tree) |
| [0226-invert-binary-tree](https://github.com/thushar003/leetcode-and-stuff/tree/master/0226-invert-binary-tree) |