main

BranchesTags

Go to file

Code

Open more actions menu

Latest commit

 

History

300 Commits

300 Commits

Folders and files

Name		Name	Last commit message	Last commit date
0 - 1 Knapsack Problem - GFG		0 - 1 Knapsack Problem - GFG
0001-two-sum		0001-two-sum
0002-add-two-numbers		0002-add-two-numbers
0007-reverse-integer		0007-reverse-integer
0014-longest-common-prefix		0014-longest-common-prefix
0020-valid-parentheses		0020-valid-parentheses
0028-find-the-index-of-the-first-occurrence-in-a-string		0028-find-the-index-of-the-first-occurrence-in-a-string
0058-length-of-last-word		0058-length-of-last-word
0061-rotate-list		0061-rotate-list
0118-pascals-triangle		0118-pascals-triangle
0125-valid-palindrome		0125-valid-palindrome
0136-single-number		0136-single-number
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0155-min-stack		0155-min-stack
0169-majority-element		0169-majority-element
0191-number-of-1-bits		0191-number-of-1-bits
0206-reverse-linked-list		0206-reverse-linked-list
0231-power-of-two		0231-power-of-two
0242-valid-anagram		0242-valid-anagram
0338-counting-bits		0338-counting-bits
0344-reverse-string		0344-reverse-string
0392-is-subsequence		0392-is-subsequence
0496-next-greater-element-i		0496-next-greater-element-i
0605-can-place-flowers		0605-can-place-flowers
0680-valid-palindrome-ii		0680-valid-palindrome-ii
0682-baseball-game		0682-baseball-game
0838-design-linked-list		0838-design-linked-list
0908-middle-of-the-linked-list		0908-middle-of-the-linked-list
100-same-tree		100-same-tree
101-symmetric-tree		101-symmetric-tree
1019-next-greater-node-in-linked-list		1019-next-greater-node-in-linked-list
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
107-binary-tree-level-order-traversal-ii		107-binary-tree-level-order-traversal-ii
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
110-balanced-binary-tree		110-balanced-binary-tree
118-pascals-triangle		118-pascals-triangle
1231-replace-elements-with-greatest-element-on-right-side		1231-replace-elements-with-greatest-element-on-right-side
125-valid-palindrome		125-valid-palindrome
13-roman-to-integer		13-roman-to-integer
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1580-shuffle-the-array		1580-shuffle-the-array
175-combine-two-tables		175-combine-two-tables
176-second-highest-salary		176-second-highest-salary
1894-merge-strings-alternately		1894-merge-strings-alternately
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
199-binary-tree-right-side-view		199-binary-tree-right-side-view
2-add-two-numbers		2-add-two-numbers
20-valid-parentheses		20-valid-parentheses
2058-concatenation-of-array		2058-concatenation-of-array
206-reverse-linked-list		206-reverse-linked-list
21-merge-two-sorted-lists		21-merge-two-sorted-lists
2112-minimum-difference-between-highest-and-lowest-of-k-scores		2112-minimum-difference-between-highest-and-lowest-of-k-scores
226-invert-binary-tree		226-invert-binary-tree
23-merge-k-sorted-lists		23-merge-k-sorted-lists
234-palindrome-linked-list		234-palindrome-linked-list
237-delete-node-in-a-linked-list		237-delete-node-in-a-linked-list
27-remove-element		27-remove-element
326-power-of-three		326-power-of-three
344-reverse-string		344-reverse-string
345-reverse-vowels-of-a-string		345-reverse-vowels-of-a-string
509-fibonacci-number		509-fibonacci-number
543-diameter-of-binary-tree		543-diameter-of-binary-tree
637-average-of-levels-in-binary-tree		637-average-of-levels-in-binary-tree
7-reverse-integer		7-reverse-integer
746-min-cost-climbing-stairs		746-min-cost-climbing-stairs
83-remove-duplicates-from-sorted-list		83-remove-duplicates-from-sorted-list
876-middle-of-the-linked-list		876-middle-of-the-linked-list
94-binary-tree-inorder-traversal		94-binary-tree-inorder-traversal
Detect Loop in linked list - GFG		Detect Loop in linked list - GFG
Difficulty: Basic		Difficulty: Basic
Difficulty: Easy		Difficulty: Easy
Difficulty: Medium/Sieve of Eratosthenes		Difficulty: Medium/Sieve of Eratosthenes
Medium		Medium
Number of Coins - GFG		Number of Coins - GFG
Parenthesis Checker - GFG		Parenthesis Checker - GFG
Subset Sum Problem - GFG		Subset Sum Problem - GFG
Number of provinces		Number of provinces
bfs		bfs
dfs		dfs
job assignment problem.cpp		job assignment problem.cpp
no of islands		no of islands
remove-element adv		remove-element adv
View all files

About

No description, website, or topics provided.

Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks

Report repository

Releases

Packages

Contributors

Languages