📘 DSA Practice Repository

This repository contains my daily Data Structures and Algorithms (DSA) practice problems.

🚀 Goals

Improve problem-solving skills
Strengthen core DSA concepts
Prepare for coding interviews
Maintain consistency

🛠️ Topics Covered

Arrays
Strings
Linked List
Stack & Queue
Trees
Recursion
Dynamic Programming
Graphs

📅 Practice Platform

Problems are solved from platforms like:

LeetCode
GeeksforGeeks
CodeStudio

💡 Structure

DSA-Practice/ │ ├── Arrays/ ├── Strings/ ├── Trees/ └── ...

Each file includes:

Problem name
Approach
Time & Space Complexity

✨ Consistency > Perfection

Navigation Menu

Repository files navigation

📘 DSA Practice Repository

🚀 Goals

🛠️ Topics Covered

📅 Practice Platform

💡 Structure

About

Releases

Packages

Contributors

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 120 Commits
Arrays		Arrays
Trees		Trees
Add Robot class with movement functionality		Add Robot class with movement functionality
Add Solution class to separate digits from numbers		Add Solution class to separate digits from numbers
Add Solution class with bitwise complement method		Add Solution class with bitwise complement method
Add Solution class with isGood method implementation		Add Solution class with isGood method implementation
Add Solution class with reverseSubmatrix method		Add Solution class with reverseSubmatrix method
Add Stack class implementation in C++		Add Stack class implementation in C++
Create h		Create h
FGHJ		FGHJ
Implement Solution class for calculating waviness		Implement Solution class for calculating waviness
Implement Solution class for earliest finish time		Implement Solution class for earliest finish time
Implement Solution class to solve queries		Implement Solution class to solve queries
Implement XOR after queries solution		Implement XOR after queries solution
Implement binary search to find minimum in rotated array		Implement binary search to find minimum in rotated array
Implement box rotation in Solution class		Implement box rotation in Solution class
Implement canPartitionGrid method in Solution class		Implement canPartitionGrid method in Solution class
Implement canReach method in Solution class		Implement canReach method in Solution class
Implement checkStrings method in Solution class		Implement checkStrings method in Solution class
Implement closestTarget method in Solution class		Implement closestTarget method in Solution class
Implement distance calculation in Solution class		Implement distance calculation in Solution class
Implement finalValueAfterOperations method		Implement finalValueAfterOperations method
Implement findDifferentBinaryString method		Implement findDifferentBinaryString method
Implement furthestDistanceFromOrigin method		Implement furthestDistanceFromOrigin method
Implement getHappyString method in Solution class		Implement getHappyString method in Solution class
Implement getMinDistance method in Solution class		Implement getMinDistance method in Solution class
Implement grid rotation algorithm in Solution class		Implement grid rotation algorithm in Solution class
Implement hasValidPath function for grid navigation		Implement hasValidPath function for grid navigation
Implement largestSubmatrix method in Solution class		Implement largestSubmatrix method in Solution class
Implement matrix rotation comparison solution		Implement matrix rotation comparison solution
Implement maxDistance method in Solution class		Implement maxDistance method in Solution class
Implement maxRotateFunction in Solution class		Implement maxRotateFunction in Solution class
Implement maxStability method in Solution class		Implement maxStability method in Solution class
Implement maximumAmount method in Solution class		Implement maximumAmount method in Solution class
Implement maximumJumps method with DFS		Implement maximumJumps method with DFS
Implement minAbsDiff function in Solution class		Implement minAbsDiff function in Solution class
Implement minFlips method in Solution class		Implement minFlips method in Solution class
Implement minJumps algorithm using prime factorization		Implement minJumps algorithm using prime factorization
Implement minMirrorPairDistance method in Solution class		Implement minMirrorPairDistance method in Solution class
Implement minMoves method in Solution class		Implement minMoves method in Solution class
Implement minOperations function in Solution class		Implement minOperations function in Solution class
Implement minimum cost calculation in Solution class		Implement minimum cost calculation in Solution class
Implement minimumDistance method in Solution class		Implement minimumDistance method in Solution class
Implement minimumDistance solution for word problem		Implement minimumDistance solution for word problem
Implement minimumEffort method in Solution class		Implement minimumEffort method in Solution class
Implement minimumHammingDistance with union-find		Implement minimumHammingDistance with union-find
Implement minimumTotalDistance method for robot assignment		Implement minimumTotalDistance method for robot assignment
Implement numSpecial method for matrix analysis		Implement numSpecial method for matrix analysis
Implement numberOfStableArrays method in Solution class		Implement numberOfStableArrays method in Solution class
Implement numberOfSubmatrices method in Solution class		Implement numberOfSubmatrices method in Solution class
Implement product matrix construction from grid		Implement product matrix construction from grid
Implement robot simulation with obstacle detection		Implement robot simulation with obstacle detection
Implement rotateRight method for linked list		Implement rotateRight method for linked list
Implement solution for surviving robots' healths		Implement solution for surviving robots' healths
Implement strStr function in Solution class		Implement strStr function in Solution class
Implement waviness calculation in Solution class		Implement waviness calculation in Solution class
NEW		NEW
README.md		README.md
VGH		VGH
b		b
bdjash		bdjash
bhb		bhb
binary representation		binary representation
binary tree		binary tree
cfvg		cfvg
class Solution { public int numberOfStableArrays(int zero, int one, int limit) { int MOD = 1_000_000_007; long[][][] dp = new long[zero+1][one+1][2]; for(int i=1;i<=Math.min(zero,limit);i++) dp[i][0][0]=1; for(int j=1;j<=Math.min(one,limit);j++) dp[0][j][1]=1; for(int i=1;i<=zero;i++) for(int j=1;j<=one;j++){ long over0 = (i-limit>=1)?dp[i-limit-1][j][1]:0; long over1 = (j-limit>=1)?dp[i][j-limit-1][0]:0; dp[i][j][0] = (dp[i-1][j][0]+dp[i-1][j][1]-over0+MOD)%MOD; dp[i][j][1] = (dp[i][j-1][0]+dp[i][j-1][1]-over1+MOD)%MOD; } return (int)((dp[zero][one][0]+dp[zero][one][1])%MOD); } }		class Solution { public int numberOfStableArrays(int zero, int one, int limit) { int MOD = 1_000_000_007; long[][][] dp = new long[zero+1][one+1][2]; for(int i=1;i<=Math.min(zero,limit);i++) dp[i][0][0]=1; for(int j=1;j<=Math.min(one,limit);j++) dp[0][j][1]=1; for(int i=1;i<=zero;i++) for(int j=1;j<=one;j++){ long over0 = (i-limit>=1)?dp[i-limit-1][j][1]:0; long over1 = (j-limit>=1)?dp[i][j-limit-1][0]:0; dp[i][j][0] = (dp[i-1][j][0]+dp[i-1][j][1]-over0+MOD)%MOD; dp[i][j][1] = (dp[i][j-1][0]+dp[i][j-1][1]-over1+MOD)%MOD; } return (int)((dp[zero][one][0]+dp[zero][one][1])%MOD); } }
concatination		concatination
er		er
fgthj		fgthj
fh		fh
find the bit in bst		find the bit in bst
hfefej		hfefej
hgju		hgju
hjk		hjk
hygtr		hygtr
java		java
jh		jh
k		k
kajal		kajal
kk		kk
kkl		kkl
knjnjm		knjnjm
minimum number in binary tree		minimum number in binary tree
minimun opration binary tree		minimun opration binary tree
new		new
newo		newo
nhjmk		nhjmk
nk		nk
nmjk		nmjk
nn		nn
nww		nww
sdxcfgvhj		sdxcfgvhj
sql		sql
tg		tg

Folders and files

Latest commit

History

Repository files navigation

📘 DSA Practice Repository

🚀 Goals

🛠️ Topics Covered

📅 Practice Platform

💡 Structure

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages