dsa-practice

🚀 Daily DSA Practice

This repository is my personal log of Daily DSA (Data Structures & Algorithms) practice.
I upload the problems I solve on a regular basis to keep track of my consistency and progress.

📌 About

Problems come from different platforms (LeetCode, Codeforces, GeeksforGeeks, etc.).
The uploads are not strictly structured — this is more of a practice archive than a curated set.
Code is focused on solving the problem first; may or may not include extra comments/optimizations.

🎯 Purpose

Maintain a habit of daily problem solving.
Track my journey and improvement in DSA.
Build confidence for coding interviews and contests.

🛠️ Note

Since this is a practice repo:

You might find repeated problems with different approaches.
File names may directly reflect the problem name or platform ID.
The goal is consistency > perfection.

📬 Connect

If you’re also practicing DSA, feel free to connect and share ideas:

LinkedIn: www.linkedin.com/in/vivek-kurapati-100a4430b

✨ This repo is not meant to be a polished library, but a practice log.
Consistency today = Stronger skills tomorrow 🚀

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

dsa-practice

🚀 Daily DSA Practice

📌 About

🎯 Purpose

🛠️ Note

📬 Connect

About

Uh oh!

Releases

Packages

Name		Name	Last commit message	Last commit date
Latest commit History 152 Commits
Minimum Operations to Equalize Array		Minimum Operations to Equalize Array
README.md		README.md
day 001.1 - Find the Minimum Area to Cover All Ones I		day 001.1 - Find the Minimum Area to Cover All Ones I
day 002.1 - Minimum Size Subarray Sum		day 002.1 - Minimum Size Subarray Sum
day 003.1 - GCD of Odd and Even Sums		day 003.1 - GCD of Odd and Even Sums
day 003.2 - Longest Subarray of 1's After Deleting One Element		day 003.2 - Longest Subarray of 1's After Deleting One Element
day 003.3 - Partition Array Into K-Distinct Groups		day 003.3 - Partition Array Into K-Distinct Groups
day 004.1 - Diagonal Traverse		day 004.1 - Diagonal Traverse
day 004.2 - Rabin Karp String Matching Algorithm bookmark_border		day 004.2 - Rabin Karp String Matching Algorithm bookmark_border
day 005.1 - Maximum Area of Longest Diagonal Rectangle		day 005.1 - Maximum Area of Longest Diagonal Rectangle
day 006.1 - Prime Love		day 006.1 - Prime Love
day 007.1 - Sort Matrix by Diagonals		day 007.1 - Sort Matrix by Diagonals
day 008.1- Alice and Bob Playing Flower Game		day 008.1- Alice and Bob Playing Flower Game
day 009.1 - Find The Least Frequent Digit		day 009.1 - Find The Least Frequent Digit
day 009.2 - Valid Sudoku		day 009.2 - Valid Sudoku
day 010.1 - Restore Finishing Order		day 010.1 - Restore Finishing Order
day 011.1 - Maximum Gap		day 011.1 - Maximum Gap
day 012.1 - Find the Number of Ways to Place People I		day 012.1 - Find the Number of Ways to Place People I
day 013.1 - Subsequence Sum		day 013.1 - Subsequence Sum
day 014.1 - Merge Sorted Array		day 014.1 - Merge Sorted Array
day 015.1 - Strictly Palindromic Number		day 015.1 - Strictly Palindromic Number
day 016.1 - Top K Frequent Elements		day 016.1 - Top K Frequent Elements
day 017.1 - Minimum Operations to Transform String		day 017.1 - Minimum Operations to Transform String
day 018.1 - Find All Duplicates in an Array		day 018.1 - Find All Duplicates in an Array
day 019.1 - Search a 2D Matrix		day 019.1 - Search a 2D Matrix
day 019.2 - Search a 2D Matrix II		day 019.2 - Search a 2D Matrix II
day 020.1 - Longest Common Prefix – Find Prefix Among Strings		day 020.1 - Longest Common Prefix – Find Prefix Among Strings
day 021.1 - Sort Vowels in a String		day 021.1 - Sort Vowels in a String
day 022.1 - Find Most Frequent Vowel and Consonant		day 022.1 - Find Most Frequent Vowel and Consonant
day 023.1 - Maximum Number of Words You Can Type		day 023.1 - Maximum Number of Words You Can Type
day 024.1 - Max Consecutive Ones		day 024.1 - Max Consecutive Ones
day 025.1 - Nim Game		day 025.1 - Nim Game
day 026.1 - Missing Number		day 026.1 - Missing Number
day 027.1 - Maximum Total Subarray Value I		day 027.1 - Maximum Total Subarray Value I
day 028.1 - Count Elements With Maximum Frequency		day 028.1 - Count Elements With Maximum Frequency
day 029.1 - First Unique Character in a String		day 029.1 - First Unique Character in a String
day 030.1- Triangle		day 030.1- Triangle
day 031.1 - Largest Triangle Area		day 031.1 - Largest Triangle Area
day 032.1 - compute decimal representation		day 032.1 - compute decimal representation
day 033.1 - To Lower Case		day 033.1 - To Lower Case
day 034.1 - Water Bottles		day 034.1 - Water Bottles
day 035.1 - Container With Most Water		day 035.1 - Container With Most Water
day 036.1 - Longest Subsequence With Non-Zero Bitwise XOR		day 036.1 - Longest Subsequence With Non-Zero Bitwise XOR
day 037.1 - Remove Duplicates from Sorted List II		day 037.1 - Remove Duplicates from Sorted List II
day 038.1 - Reorder List		day 038.1 - Reorder List
day 038.2 - Delete Node in a Linked List		day 038.2 - Delete Node in a Linked List
day 038.3 - Middle of the Linked List		day 038.3 - Middle of the Linked List
day 039.1 - Reverse Nodes in Even Length Groups		day 039.1 - Reverse Nodes in Even Length Groups
day 039.2 - Delete Nodes From Linked List Present in Array		day 039.2 - Delete Nodes From Linked List Present in Array
day 039.3 - Swap Nodes in Pairs		day 039.3 - Swap Nodes in Pairs
day 039.4 - Swapping Nodes in a Linked List		day 039.4 - Swapping Nodes in a Linked List
day 039.5 - Split Linked List in Parts		day 039.5 - Split Linked List in Parts
day 040.1 - Add Two Numbers II		day 040.1 - Add Two Numbers II
day 040.2 - Reverse Linked List II		day 040.2 - Reverse Linked List II
day 041.1 - Taking Maximum Energy From the Mystic Dungeon		day 041.1 - Taking Maximum Energy From the Mystic Dungeon
day 041.2 - Populating Next Right Pointers in Each Node II		day 041.2 - Populating Next Right Pointers in Each Node II
day 041.3 - Merge k Sorted Lists		day 041.3 - Merge k Sorted Lists
day 042.1 - Score Balance		day 042.1 - Score Balance
day 042.2 - Longest Fibonacci-like Subarray		day 042.2 - Longest Fibonacci-like Subarray
day 043.1 - Longest Balanced Substring I		day 043.1 - Longest Balanced Substring I
day 043.2 - Sum of Elements Divisible by K		day 043.2 - Sum of Elements Divisible by K
day 044.1 - Copy List with Random Pointer		day 044.1 - Copy List with Random Pointer
day 044.2 - Partition List		day 044.2 - Partition List
day 045.1 - Maximum Number of Bottles You Can Drink		day 045.1 - Maximum Number of Bottles You Can Drink
day 046.1 - Max Increasing Subarrays		day 046.1 - Max Increasing Subarrays
day 046.2 - Binary Tree Level Order Traversal		day 046.2 - Binary Tree Level Order Traversal
day 047.1 - Find the Smallest Missing Non-Negative Integer with Modulo Constraint		day 047.1 - Find the Smallest Missing Non-Negative Integer with Modulo Constraint
day 048.1 - Find Bottom Left Tree Value		day 048.1 - Find Bottom Left Tree Value
day 048.2 - Maximum Level Sum of a Binary Tree		day 048.2 - Maximum Level Sum of a Binary Tree
day 048.3 - Find Largest Value in Each Tree Row		day 048.3 - Find Largest Value in Each Tree Row
day 049.1 - Binary Tree Inorder Traversal		day 049.1 - Binary Tree Inorder Traversal
day 050.1 - Longest Balanced Subarray		day 050.1 - Longest Balanced Subarray
day 051.1- Final value after operations		day 051.1- Final value after operations
day 052.1- Binary tree inorder traversal		day 052.1- Binary tree inorder traversal
day 053.1 - Binary Tree Postorder Traversal		day 053.1 - Binary Tree Postorder Traversal
day 054.1 - Check if a String of Digits Reduces to Two Equal Digits		day 054.1 - Check if a String of Digits Reduces to Two Equal Digits
day 055.1 - Next Beautiful Number		day 055.1 - Next Beautiful Number
day 056.1 - Calculate Money in Leetcode Bank		day 056.1 - Calculate Money in Leetcode Bank
day 057.1 - Maximum Alternating Sum		day 057.1 - Maximum Alternating Sum
day 058.1 - Number of Laser Beams in a Bank		day 058.1 - Number of Laser Beams in a Bank
day 059.1 - Binary Search Tree to Greater Sum Tree		day 059.1 - Binary Search Tree to Greater Sum Tree
day 060.1 - Smallest Number Greater Than or Equal to n by Powers of Two		day 060.1 - Smallest Number Greater Than or Equal to n by Powers of Two
day 060.2 - Level Order Traversal of an N-ary Tree		day 060.2 - Level Order Traversal of an N-ary Tree
day 060.3 - Lowest Common Ancestor in a Binary Search Tree (BST)		day 060.3 - Lowest Common Ancestor in a Binary Search Tree (BST)
day 060.4 - Construct Maximum Binary Tree		day 060.4 - Construct Maximum Binary Tree
day 061.1 - Minimum Number of Increments to Form Target Array		day 061.1 - Minimum Number of Increments to Form Target Array
day 062.1 - Get Sneaky Numbers		day 062.1 - Get Sneaky Numbers
day 062.2 - Insert into a Binary Search Tree		day 062.2 - Insert into a Binary Search Tree
day 062.3 - Binary Tree Pruning		day 062.3 - Binary Tree Pruning
day 062.4 - Trim a Binary Search Tree		day 062.4 - Trim a Binary Search Tree
day 062.5 - Delete Leaves With a Given Value		day 062.5 - Delete Leaves With a Given Value
day 063.1 - Convert BST to Greater Tree		day 063.1 - Convert BST to Greater Tree
day 064.1 - Minimum Time to Make Rope Colorful		day 064.1 - Minimum Time to Make Rope Colorful
day 065.1 - Smaller Numbers Than Current Number		day 065.1 - Smaller Numbers Than Current Number
day 066.1 - Count Negative Numbers in a Sorted Grid		day 066.1 - Count Negative Numbers in a Sorted Grid

vivek221510/dsa-practice

Folders and files

Latest commit

History

Repository files navigation

dsa-practice

🚀 Daily DSA Practice

📌 About

🎯 Purpose

🛠️ Note

📬 Connect

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Packages