Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/subhash23jan/leetcode-and-gfg
I love problem solving, so I started problem solving in GFG and Leetcode. As of now, I'm using Leetcode for problem solving. Here are some problems solved by me.
https://github.com/subhash23jan/leetcode-and-gfg
coding-challenges datastructures dsa-algorithm geekforgeeks leetcode
Last synced: 8 days ago
JSON representation
I love problem solving, so I started problem solving in GFG and Leetcode. As of now, I'm using Leetcode for problem solving. Here are some problems solved by me.
- Host: GitHub
- URL: https://github.com/subhash23jan/leetcode-and-gfg
- Owner: Subhash23jan
- Created: 2022-12-07T13:46:26.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2024-10-29T08:55:19.000Z (17 days ago)
- Last Synced: 2024-10-29T10:03:28.205Z (17 days ago)
- Topics: coding-challenges, datastructures, dsa-algorithm, geekforgeeks, leetcode
- Language: C++
- Homepage:
- Size: 948 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Leetcode_Programs
# Two Pointers
| |
| ------- |
| [0344-reverse-string](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0344-reverse-string) |
| [2572-append-characters-to-string-to-make-subsequence](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/2572-append-characters-to-string-to-make-subsequence) |
# String
| |
| ------- |
| [0344-reverse-string](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0344-reverse-string) |
| [0402-remove-k-digits](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0402-remove-k-digits) |
| [0409-longest-palindrome](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0409-longest-palindrome) |
| [0648-replace-words](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0648-replace-words) |
| [1044-find-common-characters](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/1044-find-common-characters) |
| [2572-append-characters-to-string-to-make-subsequence](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/2572-append-characters-to-string-to-make-subsequence) |
# Stack
| |
| ------- |
| [0402-remove-k-digits](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0402-remove-k-digits) |
# Greedy
| |
| ------- |
| [0402-remove-k-digits](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0402-remove-k-digits) |
| [0409-longest-palindrome](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0409-longest-palindrome) |
| [0876-hand-of-straights](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0876-hand-of-straights) |
| [2572-append-characters-to-string-to-make-subsequence](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/2572-append-characters-to-string-to-make-subsequence) |
# Monotonic Stack
| |
| ------- |
| [0402-remove-k-digits](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0402-remove-k-digits) |
# Dynamic Programming
| |
| ------- |
| [0124-binary-tree-maximum-path-sum](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0124-binary-tree-maximum-path-sum) |
# Tree
| |
| ------- |
| [0124-binary-tree-maximum-path-sum](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0124-binary-tree-maximum-path-sum) |
# Depth-First Search
| |
| ------- |
| [0124-binary-tree-maximum-path-sum](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0124-binary-tree-maximum-path-sum) |
# Binary Tree
| |
| ------- |
| [0124-binary-tree-maximum-path-sum](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0124-binary-tree-maximum-path-sum) |
# Hash Table
| |
| ------- |
| [0409-longest-palindrome](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0409-longest-palindrome) |
| [0648-replace-words](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0648-replace-words) |
| [0876-hand-of-straights](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0876-hand-of-straights) |
| [1044-find-common-characters](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/1044-find-common-characters) |
# Array
| |
| ------- |
| [0648-replace-words](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0648-replace-words) |
| [0876-hand-of-straights](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0876-hand-of-straights) |
| [1044-find-common-characters](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/1044-find-common-characters) |
# Sorting
| |
| ------- |
| [0876-hand-of-straights](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0876-hand-of-straights) |
# Trie
| |
| ------- |
| [0648-replace-words](https://github.com/Subhash23jan/LEETCODE-AND-GFG/tree/master/0648-replace-words) |