GFG-POTD

The repository contains the solutions to the problems of the day that I solve on geeksforgeeks to improve my problem solving skills.

Name		Name	Last commit message	Last commit date
Latest commit History 1,145 Commits
0004-median-of-two-sorted-arrays		0004-median-of-two-sorted-arrays
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0018-4sum		0018-4sum
0034-find-first-and-last-position-of-element-in-sorted-array		0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position		0035-search-insert-position
0039-combination-sum		0039-combination-sum
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree		0110-balanced-binary-tree
0119-pascals-triangle-ii		0119-pascals-triangle-ii
0135-candy		0135-candy
0179-largest-number		0179-largest-number
0198-house-robber		0198-house-robber
0205-isomorphic-strings		0205-isomorphic-strings
0287-find-the-duplicate-number		0287-find-the-duplicate-number
0332-reconstruct-itinerary		0332-reconstruct-itinerary
0341-flatten-nested-list-iterator		0341-flatten-nested-list-iterator
0342-power-of-four		0342-power-of-four
0389-find-the-difference		0389-find-the-difference
0392-is-subsequence		0392-is-subsequence
0442-find-all-duplicates-in-an-array		0442-find-all-duplicates-in-an-array
0458-poor-pigs		0458-poor-pigs
0501-find-mode-in-binary-search-tree		0501-find-mode-in-binary-search-tree
0515-find-largest-value-in-each-tree-row		0515-find-largest-value-in-each-tree-row
0652-find-duplicate-subtrees		0652-find-duplicate-subtrees
0724-find-pivot-index		0724-find-pivot-index
0745-find-smallest-letter-greater-than-target		0745-find-smallest-letter-greater-than-target
0747-min-cost-climbing-stairs		0747-min-cost-climbing-stairs
0792-binary-search		0792-binary-search
0795-k-th-symbol-in-grammar		0795-k-th-symbol-in-grammar
0815-champagne-tower		0815-champagne-tower
0843-binary-trees-with-factors		0843-binary-trees-with-factors
0874-backspace-string-compare		0874-backspace-string-compare
0877-shortest-path-visiting-all-nodes		0877-shortest-path-visiting-all-nodes
0916-decoded-string-at-index		0916-decoded-string-at-index
0932-monotonic-array		0932-monotonic-array
0941-sort-array-by-parity		0941-sort-array-by-parity
1073-number-of-enclaves		1073-number-of-enclaves
1129-longest-string-chain		1129-longest-string-chain
1185-find-in-mountain-array		1185-find-in-mountain-array
1285-balance-a-binary-search-tree		1285-balance-a-binary-search-tree
1286-constrained-subsequence-sum		1286-constrained-subsequence-sum
1332-count-vowels-permutation		1332-count-vowels-permutation
1398-number-of-ways-to-stay-in-the-same-place-after-some-steps		1398-number-of-ways-to-stay-in-the-same-place-after-some-steps
1407-group-the-people-given-the-group-size-they-belong-to		1407-group-the-people-given-the-group-size-they-belong-to
1458-sort-integers-by-the-number-of-1-bits		1458-sort-integers-by-the-number-of-1-bits
1463-the-k-weakest-rows-in-a-matrix		1463-the-k-weakest-rows-in-a-matrix
1476-count-negative-numbers-in-a-sorted-matrix		1476-count-negative-numbers-in-a-sorted-matrix
1552-build-an-array-with-stack-operations		1552-build-an-array-with-stack-operations
1569-max-dot-product-of-two-subsequences		1569-max-dot-product-of-two-subsequences
1627-last-moment-before-all-ants-fall-out-of-a-plank		1627-last-moment-before-all-ants-fall-out-of-a-plank
1657-find-the-winner-of-an-array-game		1657-find-the-winner-of-an-array-game
1706-min-cost-to-connect-all-points		1706-min-cost-to-connect-all-points
1753-path-with-minimum-effort		1753-path-with-minimum-effort
1770-minimum-deletions-to-make-character-frequencies-unique		1770-minimum-deletions-to-make-character-frequencies-unique
1776-minimum-operations-to-reduce-x-to-zero		1776-minimum-operations-to-reduce-x-to-zero
1866-restore-the-array-from-adjacent-pairs		1866-restore-the-array-from-adjacent-pairs
1918-maximum-score-of-a-good-subarray		1918-maximum-score-of-a-good-subarray
1955-seat-reservation-manager		1955-seat-reservation-manager
2049-eliminate-maximum-number-of-monsters		2049-eliminate-maximum-number-of-monsters
2119-minimum-number-of-operations-to-make-array-continuous		2119-minimum-number-of-operations-to-make-array-continuous
2176-parallel-courses-iii		2176-parallel-courses-iii
2334-number-of-flowers-in-full-bloom		2334-number-of-flowers-in-full-bloom
2347-count-nodes-equal-to-average-of-subtree		2347-count-nodes-equal-to-average-of-subtree
2519-find-the-original-array-of-prefix-xor		2519-find-the-original-array-of-prefix-xor
2678-design-graph-with-shortest-path-calculator		2678-design-graph-with-shortest-path-calculator
2808-painting-the-walls		2808-painting-the-walls
2887-sort-vowels-in-a-string		2887-sort-vowels-in-a-string
3034-points-that-intersect-with-cars		3034-points-that-intersect-with-cars
3055-maximum-odd-binary-number		3055-maximum-odd-binary-number
3056-determine-if-a-cell-is-reachable-at-a-given-time		3056-determine-if-a-cell-is-reachable-at-a-given-time
AVL Tree Deletion - GFG		AVL Tree Deletion - GFG
Basic		Basic
Binary Tree to BST - GFG		Binary Tree to BST - GFG
Check if Tree is Isomorphic - GFG		Check if Tree is Isomorphic - GFG
Chocolate Distribution Problem - GFG		Chocolate Distribution Problem - GFG
Clone a linked list with next and random pointer - GFG		Clone a linked list with next and random pointer - GFG
Coin Change - GFG		Coin Change - GFG
Column name from a given column number - GFG		Column name from a given column number - GFG
Delete a Node in Single Linked List - GFG		Delete a Node in Single Linked List - GFG
Delete nodes having greater value on right - GFG		Delete nodes having greater value on right - GFG
Difficulty: Basic		Difficulty: Basic
Difficulty: Easy		Difficulty: Easy
Difficulty: Hard		Difficulty: Hard
Difficulty: Medium		Difficulty: Medium
Distance of nearest cell having 1 - GFG		Distance of nearest cell having 1 - GFG
Easy		Easy
Find the string in grid - GFG		Find the string in grid - GFG
Flip Bits - GFG		Flip Bits - GFG
Fraction pairs with sum 1 - GFG		Fraction pairs with sum 1 - GFG
Hard		Hard
Inorder Traversal - GFG		Inorder Traversal - GFG
Insert a node in a BST - GFG		Insert a node in a BST - GFG
Interleaved Strings - GFG		Interleaved Strings - GFG
Is Binary Number Multiple of 3 - GFG		Is Binary Number Multiple of 3 - GFG
Kadane's Algorithm - GFG		Kadane's Algorithm - GFG
Key Pair - GFG		Key Pair - GFG
Kth largest element in BST - GFG		Kth largest element in BST - GFG
Largest prime factor - GFG		Largest prime factor - GFG
Leaders in an array - GFG		Leaders in an array - GFG
Leaf under budget - GFG		Leaf under budget - GFG

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

GFG-POTD

About

Releases

Packages

Languages

License

Sagar-Mondal/GFG-POTD

Folders and files

Latest commit

History

Repository files navigation

GFG-POTD

About

Resources

License

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages