Skip to content
BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

314 Commits
01-matrix
01-matrix
 
 
average-of-levels-in-binary-tree
average-of-levels-in-binary-tree
 
 
best-time-to-buy-and-sell-stock
best-time-to-buy-and-sell-stock
 
 
binary-search
binary-search
 
 
binary-tree-inorder-traversal
binary-tree-inorder-traversal
 
 
binary-tree-level-order-traversal-ii
binary-tree-level-order-traversal-ii
 
 
binary-tree-level-order-traversal
binary-tree-level-order-traversal
 
 
binary-tree-postorder-traversal
binary-tree-postorder-traversal
 
 
binary-tree-preorder-traversal
binary-tree-preorder-traversal
 
 
climbing-stairs
climbing-stairs
 
 
combinations
combinations
 
 
contains-duplicate
contains-duplicate
 
 
count-complete-tree-nodes
count-complete-tree-nodes
 
 
delete-node-in-a-linked-list
delete-node-in-a-linked-list
 
 
duplicate-zeros
duplicate-zeros
 
 
factorial-trailing-zeroes
factorial-trailing-zeroes
 
 
fibonacci-number
fibonacci-number
 
 
find-numbers-with-even-number-of-digits
find-numbers-with-even-number-of-digits
 
 
find-the-duplicate-number
find-the-duplicate-number
 
 
first-bad-version
first-bad-version
 
 
first-unique-character-in-a-string
first-unique-character-in-a-string
 
 
fizz-buzz
fizz-buzz
 
 
flatten-binary-tree-to-linked-list
flatten-binary-tree-to-linked-list
 
 
flood-fill
flood-fill
 
 
generate-parentheses
generate-parentheses
 
 
house-robber
house-robber
 
 
implement-queue-using-stacks
implement-queue-using-stacks
 
 
insert-into-a-binary-search-tree
insert-into-a-binary-search-tree
 
 
intersection-of-two-arrays-ii
intersection-of-two-arrays-ii
 
 
intersection-of-two-arrays
intersection-of-two-arrays
 
 
intersection-of-two-linked-lists
intersection-of-two-linked-lists
 
 
invert-binary-tree
invert-binary-tree
 
 
kth-largest-element-in-an-array
kth-largest-element-in-an-array
 
 
letter-case-permutation
letter-case-permutation
 
 
linked-list-cycle-ii
linked-list-cycle-ii
 
 
linked-list-cycle
linked-list-cycle
 
 
longest-substring-without-repeating-characters
longest-substring-without-repeating-characters
 
 
lowest-common-ancestor-of-a-binary-search-tree
lowest-common-ancestor-of-a-binary-search-tree
 
 
majority-element
majority-element
 
 
matrix-diagonal-sum
matrix-diagonal-sum
 
 
max-area-of-island
max-area-of-island
 
 
max-consecutive-ones
max-consecutive-ones
 
 
maximum-depth-of-binary-tree
maximum-depth-of-binary-tree
 
 
maximum-level-sum-of-a-binary-tree
maximum-level-sum-of-a-binary-tree
 
 
maximum-subarray
maximum-subarray
 
 
merge-sorted-array
merge-sorted-array
 
 
merge-two-binary-trees
merge-two-binary-trees
 
 
merge-two-sorted-lists
merge-two-sorted-lists
 
 
middle-of-the-linked-list
middle-of-the-linked-list
 
 
move-zeroes
move-zeroes
 
 
n-th-tribonacci-number
n-th-tribonacci-number
 
 
number-of-1-bits
number-of-1-bits
 
 
palindrome-linked-list
palindrome-linked-list
 
 
palindrome-number
palindrome-number
 
 
partition-list
partition-list
 
 
pascals-triangle
pascals-triangle
 
 
path-sum
path-sum
 
 
permutation-in-string
permutation-in-string
 
 
permutations
permutations
 
 
populating-next-right-pointers-in-each-node
populating-next-right-pointers-in-each-node
 
 
power-of-two
power-of-two
 
 
powx-n
powx-n
 
 
ransom-note
ransom-note
 
 
remove-duplicates-from-sorted-array
remove-duplicates-from-sorted-array
 
 
remove-duplicates-from-sorted-list-ii
remove-duplicates-from-sorted-list-ii
 
 
remove-duplicates-from-sorted-list
remove-duplicates-from-sorted-list
 
 
remove-element
remove-element
 
 
remove-linked-list-elements
remove-linked-list-elements
 
 
remove-nth-node-from-end-of-list
remove-nth-node-from-end-of-list
 
 
reshape-the-matrix
reshape-the-matrix
 
 
reverse-bits
reverse-bits
 
 
reverse-linked-list-ii
reverse-linked-list-ii
 
 
reverse-linked-list
reverse-linked-list
 
 
reverse-string
reverse-string
 
 
reverse-words-in-a-string-iii
reverse-words-in-a-string-iii
 
 
reverse-words-in-a-string
reverse-words-in-a-string
 
 
rotate-array
rotate-array
 
 
rotate-list
rotate-list
 
 
rotting-oranges
rotting-oranges
 
 
search-a-2d-matrix
search-a-2d-matrix
 
 
search-in-a-binary-search-tree
search-in-a-binary-search-tree
 
 
search-insert-position
search-insert-position
 
 
single-number
single-number
 
 
sort-colors
sort-colors
 
 
sqrtx
sqrtx
 
 
squares-of-a-sorted-array
squares-of-a-sorted-array
 
 
swapping-nodes-in-a-linked-list
swapping-nodes-in-a-linked-list
 
 
symmetric-tree
symmetric-tree
 
 
transpose-matrix
transpose-matrix
 
 
triangle
triangle
 
 
two-sum-ii-input-array-is-sorted
two-sum-ii-input-array-is-sorted
 
 
two-sum-iv-input-is-a-bst
two-sum-iv-input-is-a-bst
 
 
two-sum
two-sum
 
 
valid-anagram
valid-anagram
 
 
valid-parentheses
valid-parentheses
 
 
valid-sudoku
valid-sudoku
 
 
validate-binary-search-tree
validate-binary-search-tree
 
 
README.md
README.md
 
 
another-soln.cpp
another-soln.cpp
 
 
selfcheck.md
selfcheck.md
 
 

Repository files navigation

Competitive Programming Solutions

Practicing problems from LeetCode

Topic number Topic name
1 Arrays
2 Matrix
3 String
4 Search & sort
5 Linked List
6 Binary Trees
7 BST
8 Greedy
9 Backtracking
10 Stacks & Queues
11 Heap
12 Graph
13 Trie
14 Dynamic Programming
15 Bit Manipulation
16 Math


👨 Repository Created & Maintained By -

Built with ❤️ by Jayvardhan Rathi

About

Practicing problems from LeetCode and other related platforms

Topics

algorithmsdata-structureshackerrankleetcodeleetcode-cppleetcode-pythonleetcode-solutions

Resources

Readme
Activity

Stars

6 stars

Watchers

0 watching

Forks

1 fork
Report repository

Releases

Packages

Contributors

Languages