LeetCode and GeeksforGeeks Solutions

Welcome to my repository dedicated to LeetCode and GeeksforGeeks problem solutions! 🚀

This repository contains a collection of carefully crafted solutions to LeetCode and GeeksforGeeks coding challenges. It's designed to help aspiring developers and coding enthusiasts in their journey to ace technical interviews and improve problem-solving skills.

Key Features

Diverse Problem Set: Dive into various algorithmic problems sourced from LeetCode and GeeksforGeeks to enhance your coding abilities.
Easy-to-Understand Solutions: Detailed explanations and well-commented code snippets to aid comprehension and learning.
Constant Updates: Regularly updated with new problems and optimized solutions.

How to Use

Explore by Questions: Navigate through folders categorized by questions of interest.
Review Solutions: Access detailed explanations and optimized code snippets for each problem.
Contribute: Share your solutions, improvements, or additional problem solutions via pull requests.

Getting Started

Clone the Repository: git clone https://github.com/AmanJee-BITS/leetcode-gfg-solutions.git
Choose a Problem: Explore the problem sets within the categorized folders.
Review the Solutions: Dive into the problem description and associated solution files.
Contribute: Share your innovative solutions or improvements by creating a pull request.

Contribution Guidelines

Contributions to this repository are highly encouraged! Feel free to contribute if you have a more efficient solution, discover a bug, or want to add new problems.

Please follow these guidelines:

Create a separate branch for your changes.
Provide clear and concise commit messages.
Ensure code readability and add comments if necessary.
Test your solutions thoroughly before submitting a pull request.

Happy Coding! 🌟

Name		Name	Last commit message	Last commit date
Latest commit History 864 Commits
0012-integer-to-roman		0012-integer-to-roman
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0036-valid-sudoku		0036-valid-sudoku
0038-count-and-say		0038-count-and-say
0049-group-anagrams		0049-group-anagrams
0076-minimum-window-substring		0076-minimum-window-substring
0079-word-search		0079-word-search
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0212-word-search-ii		0212-word-search-ii
0219-contains-duplicate-ii		0219-contains-duplicate-ii
0222-count-complete-tree-nodes		0222-count-complete-tree-nodes
0223-rectangle-area		0223-rectangle-area
0224-basic-calculator		0224-basic-calculator
0263-ugly-number		0263-ugly-number
0279-perfect-squares		0279-perfect-squares
0295-find-median-from-data-stream		0295-find-median-from-data-stream
0345-reverse-vowels-of-a-string		0345-reverse-vowels-of-a-string
0374-guess-number-higher-or-lower		0374-guess-number-higher-or-lower
0380-insert-delete-getrandom-o1		0380-insert-delete-getrandom-o1
0433-minimum-genetic-mutation		0433-minimum-genetic-mutation
0446-arithmetic-slices-ii-subsequence		0446-arithmetic-slices-ii-subsequence
0451-sort-characters-by-frequency		0451-sort-characters-by-frequency
0523-continuous-subarray-sum		0523-continuous-subarray-sum
0587-erect-the-fence		0587-erect-the-fence
0645-set-mismatch		0645-set-mismatch
0692-top-k-frequent-words		0692-top-k-frequent-words
0766-toeplitz-matrix		0766-toeplitz-matrix
0835-image-overlap		0835-image-overlap
0876-middle-of-the-linked-list		0876-middle-of-the-linked-list
0899-orderly-queue		0899-orderly-queue
0901-online-stock-span		0901-online-stock-span
0907-sum-of-subarray-minimums		0907-sum-of-subarray-minimums
0947-most-stones-removed-with-same-row-or-column		0947-most-stones-removed-with-same-row-or-column
100-same-tree		100-same-tree
1002-maximum-width-ramp		1002-maximum-width-ramp
1016-subarray-sums-divisible-by-k		1016-subarray-sums-divisible-by-k
1019-squares-of-a-sorted-array		1019-squares-of-a-sorted-array
1021-distribute-coins-in-binary-tree		1021-distribute-coins-in-binary-tree
1030-smallest-string-starting-from-leaf		1030-smallest-string-starting-from-leaf
1034-subarrays-with-k-different-integers		1034-subarrays-with-k-different-integers
1037-minimum-number-of-k-consecutive-bit-flips		1037-minimum-number-of-k-consecutive-bit-flips
1039-find-the-town-judge		1039-find-the-town-judge
1047-remove-all-adjacent-duplicates-in-string		1047-remove-all-adjacent-duplicates-in-string
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
1114-binary-search-tree-to-greater-sum-tree		1114-binary-search-tree-to-greater-sum-tree
1121-partition-array-for-maximum-sum		1121-partition-array-for-maximum-sum
1137-height-checker		1137-height-checker
1138-grumpy-bookstore-owner		1138-grumpy-bookstore-owner
1145-number-of-submatrices-that-sum-to-target		1145-number-of-submatrices-that-sum-to-target
1196-filling-bookcase-shelves		1196-filling-bookcase-shelves
1197-parsing-a-boolean-expression		1197-parsing-a-boolean-expression
1207-delete-nodes-and-return-forest		1207-delete-nodes-and-return-forest
1207-unique-number-of-occurrences		1207-unique-number-of-occurrences
1212-sequential-digits		1212-sequential-digits
1217-relative-sort-array		1217-relative-sort-array
1224-minimum-falling-path-sum-ii		1224-minimum-falling-path-sum-ii
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
1231-replace-elements-with-greatest-element-on-right-side		1231-replace-elements-with-greatest-element-on-right-side
1235-maximum-profit-in-job-scheduling		1235-maximum-profit-in-job-scheduling
1236-n-th-tribonacci-number		1236-n-th-tribonacci-number
1239-maximum-length-of-a-concatenated-string-with-unique-characters		1239-maximum-length-of-a-concatenated-string-with-unique-characters
1240-stone-game-ii		1240-stone-game-ii
1250-longest-common-subsequence		1250-longest-common-subsequence
1256-rank-transform-of-an-array		1256-rank-transform-of-an-array
1263-number-of-dice-rolls-with-target-sum		1263-number-of-dice-rolls-with-target-sum
1267-remove-zero-sum-consecutive-nodes-from-linked-list		1267-remove-zero-sum-consecutive-nodes-from-linked-list
1285-balance-a-binary-search-tree		1285-balance-a-binary-search-tree
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
1293-shortest-path-in-a-grid-with-obstacles-elimination		1293-shortest-path-in-a-grid-with-obstacles-elimination
1298-reverse-substrings-between-each-pair-of-parentheses		1298-reverse-substrings-between-each-pair-of-parentheses
130-surrounded-regions		130-surrounded-regions
1302-delete-characters-to-make-fancy-string		1302-delete-characters-to-make-fancy-string
1304-longest-happy-string		1304-longest-happy-string
131-palindrome-partitioning		131-palindrome-partitioning
1319-unique-number-of-occurrences		1319-unique-number-of-occurrences
1321-get-equal-substrings-within-budget		1321-get-equal-substrings-within-budget
1323-maximum-69-number		1323-maximum-69-number
1325-path-with-maximum-probability		1325-path-with-maximum-probability
1335-minimum-difficulty-of-a-job-schedule		1335-minimum-difficulty-of-a-job-schedule
1350-remove-sub-folders-from-the-filesystem		1350-remove-sub-folders-from-the-filesystem
1352-maximum-profit-in-job-scheduling		1352-maximum-profit-in-job-scheduling
1354-find-players-with-zero-or-one-losses		1354-find-players-with-zero-or-one-losses
1360-maximum-length-of-a-concatenated-string-with-unique-characters		1360-maximum-length-of-a-concatenated-string-with-unique-characters
1370-count-number-of-nice-subarrays		1370-count-number-of-nice-subarrays
1371-minimum-remove-to-make-valid-parentheses		1371-minimum-remove-to-make-valid-parentheses
1381-maximum-score-words-formed-by-letters		1381-maximum-score-words-formed-by-letters
140-word-break-ii		140-word-break-ii
1402-count-square-submatrices-with-all-ones		1402-count-square-submatrices-with-all-ones
141-linked-list-cycle		141-linked-list-cycle
143-reorder-list		143-reorder-list
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph		1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1450-delete-leaves-with-a-given-value		1450-delete-leaves-with-a-given-value
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance		1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1457-minimum-difficulty-of-a-job-schedule		1457-minimum-difficulty-of-a-job-schedule
1473-find-the-longest-substring-containing-vowels-in-even-counts		1473-find-the-longest-substring-containing-vowels-in-even-counts
1484-linked-list-in-binary-tree		1484-linked-list-in-binary-tree
1496-lucky-numbers-in-a-matrix		1496-lucky-numbers-in-a-matrix
1497-design-a-stack-with-increment-operation		1497-design-a-stack-with-increment-operation
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

LeetCode and GeeksforGeeks Solutions

Key Features

How to Use

Getting Started

Contribution Guidelines

About

Releases

Packages

Languages

AmanJee-BITS/leetcode-gfg-solutions

Folders and files

Latest commit

History

Repository files navigation

LeetCode and GeeksforGeeks Solutions

Key Features

How to Use

Getting Started

Contribution Guidelines

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages