Skip to content

I tried to save my code of doing problem solving in for maintain track about my progress.Moreover this will help me to revision purpose.

Notifications You must be signed in to change notification settings

Habib-Un-Hemel/DSA_Practice

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

DSA Practice Log

I am maintaining this document to track my problem-solving progress, which will help with revision and improvement over time.


📌 DSA Problem Tracking Table

# Question Question Link Complexity Notes Topic Name
1 Two Sum LeetCode #1 O(n) Used HashMap for optimization Two-Pointer
2 Add Two Numbers LeetCode #2 O(n) Linked List manipulation Two-Pointer
3 Sort 0s, 1s (Dutch National Flag Algorithm) - O(n) Used two-pointer approach Two-Pointer
4 Sort Odd and Even Numbers - O(n) Partitioned array into odd and even Two-Pointer
5 Two Sum in Sorted Array - O(n) Used two-pointer approach Two-Pointer
6 Three Sum - O(n^2) Used sorting and two-pointer approach Two-Pointer
7 Container with Most Water - O(n) Maximized area using two pointers Two-Pointer
8 Reverse an Array - O(n) Swapped elements using two-pointer technique Two-Pointer
9 Palindrome Check - O(n) Compared characters from both ends Two-Pointer
10 Find Pairs with a Given Difference - O(n) Used HashSet to store values Two-Pointer
11 Count Unique Pairs with a Given Difference (K-diff pairs) - O(n) Used HashSet to find unique pairs Two-Pointer

📌 Resources for Practice


About

I tried to save my code of doing problem solving in for maintain track about my progress.Moreover this will help me to revision purpose.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published