Skip to content

kashish00208/Daily-Codes

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

90 Commits
POTD-LEETCODE
POTD-LEETCODE
 
 
3sum.cpp
3sum.cpp
 
 
4Sum.cpp
4Sum.cpp
 
 
add-two-numbers.cpp
add-two-numbers.cpp
 
 
asteroid-collision.cpp
asteroid-collision.cpp
 
 
balanced-binary-tree.cpp
balanced-binary-tree.cpp
 
 
best-time-to-buy-and-sell-stock-ii.cpp
best-time-to-buy-and-sell-stock-ii.cpp
 
 
best-time-to-buy-and-sell-stock.cpp
best-time-to-buy-and-sell-stock.cpp
 
 
binary-subarrays-with-sum.cpp
binary-subarrays-with-sum.cpp
 
 
binary-tree-inorder-traversal.cpp
binary-tree-inorder-traversal.cpp
 
 
binary-tree-level-order-traversal.cpp
binary-tree-level-order-traversal.cpp
 
 
binary-tree-maximum-path-sum.cpp
binary-tree-maximum-path-sum.cpp
 
 
binary-tree-postorder-traversal.cpp
binary-tree-postorder-traversal.cpp
 
 
binary-tree-preorder-traversal.cpp
binary-tree-preorder-traversal.cpp
 
 
chocolate-distribution-problem.cpp
chocolate-distribution-problem.cpp
 
 
convert-binary-number-in-a-linked-list-to-integer.cpp
convert-binary-number-in-a-linked-list-to-integer.cpp
 
 
diameter-of-binary-tree.cpp
diameter-of-binary-tree.cpp
 
 
find-all-duplicates-in-an-array.cpp
find-all-duplicates-in-an-array.cpp
 
 
find-the-duplicate-number.cpp
find-the-duplicate-number.cpp
 
 
implement-queue-using-stacks.cpp
implement-queue-using-stacks.cpp
 
 
intersection-of-two-linked-lists.cpp
intersection-of-two-linked-lists.cpp
 
 
largest-rectangle-in-histogram.cpp
largest-rectangle-in-histogram.cpp
 
 
linked-list-cycle.cpp
linked-list-cycle.cpp
 
 
longest-nice-subarray.cpp
longest-nice-subarray.cpp
 
 
longest-repeating-character-replacement.cpp
longest-repeating-character-replacement.cpp
 
 
longest-substring-without-repeating-characters.cpp
longest-substring-without-repeating-characters.cpp
 
 
majority-element.cpp
majority-element.cpp
 
 
max-consecutive-ones-iii.cpp
max-consecutive-ones-iii.cpp
 
 
max-consecutive-ones.cpp
max-consecutive-ones.cpp
 
 
maximal-rectangle.cpp
maximal-rectangle.cpp
 
 
maximum-depth-of-binary-tree.cpp
maximum-depth-of-binary-tree.cpp
 
 
maximum-product-subarray.cpp
maximum-product-subarray.cpp
 
 
merge-intervals.cpp
merge-intervals.cpp
 
 
middle-of-the-linked-list.cpp
middle-of-the-linked-list.cpp
 
 
move-zeros.cpp
move-zeros.cpp
 
 
next-greater-element-i.cpp
next-greater-element-i.cpp
 
 
next-greater-element-ii.cpp
next-greater-element-ii.cpp
 
 
palindrome-linked-list.cpp
palindrome-linked-list.cpp
 
 
pascals-triangle.cpp
pascals-triangle.cpp
 
 
powx-n.cpp
powx-n.cpp
 
 
prime.cpp
prime.cpp
 
 
readme.md
readme.md
 
 
remove-duplicates-from-sorted-array.cpp
remove-duplicates-from-sorted-array.cpp
 
 
remove-duplicates-from-sorted-list.cpp
remove-duplicates-from-sorted-list.cpp
 
 
remove-k-digits.cpp
remove-k-digits.cpp
 
 
remove-linked-list-elements.cpp
remove-linked-list-elements.cpp
 
 
remove-nth-node-from-end-of-list.cpp
remove-nth-node-from-end-of-list.cpp
 
 
reverse-linked-list.cpp
reverse-linked-list.cpp
 
 
reverse-nodes-in-k-group.cpp
reverse-nodes-in-k-group.cpp
 
 
reverse-words-in-a-string.cpp
reverse-words-in-a-string.cpp
 
 
rotate-image.cpp
rotate-image.cpp
 
 
same-tree.cpp
same-tree.cpp
 
 
search-in-rotated-sorted-array.cpp
search-in-rotated-sorted-array.cpp
 
 
set-matrix-zeroes.cpp
set-matrix-zeroes.cpp
 
 
sliding-window-maximum.cpp
sliding-window-maximum.cpp
 
 
sort-colors.cpp
sort-colors.cpp
 
 
sort-list.cpp
sort-list.cpp
 
 
spiral-matrix-ii.cpp
spiral-matrix-ii.cpp
 
 
spiral-matrix.cpp
spiral-matrix.cpp
 
 
split-array-sum.cpp
split-array-sum.cpp
 
 
stackConversions.cpp
stackConversions.cpp
 
 
subsets.cpp
subsets.cpp
 
 
sum-of-subarray-minimums.cpp
sum-of-subarray-minimums.cpp
 
 
sum-of-subarray-ranges.cpp
sum-of-subarray-ranges.cpp
 
 
symmetric-tree.cpp
symmetric-tree.cpp
 
 
valid-parentheses.cpp
valid-parentheses.cpp
 
 

Repository files navigation

DSA Journey Repository

Welcome to my DSA Journey repository!

In this repository, I’ll be documenting and sharing my solutions to various Data Structures and Algorithms (DSA) problems. The goal is to maintain consistency and improve problem-solving skills through continuous practice and learning.

Feel free to explore the solutions, and use them as a reference to enhance your own understanding and skills.

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages