DSA Practice Repository

This repository contains solutions to various Data Structures and Algorithms (DSA) problems that I have solved during my practice sessions. The problems are sourced from different platforms like LeetCode, HackerRank, Codeforces, and more.

🛠️ Technologies

Programming Language: [Python/JavaScript/Java] (whichever language you're using)
Platforms:
- LeetCode
- HackerRank
- Codeforces
- GeeksforGeeks
- InterviewBit

💡 How to Use

Clone the repository
Navigate to the desired category to find the problem and its solution.
Solutions are provided in the form of code files (.py/.js/.java).

🚀 Contribution

If you'd like to contribute by adding new problems or improving existing solutions:

Fork this repository.
Create a new branch with your changes.
Submit a pull request, explaining the changes you've made.

📞 Contact

Feel free to reach out to me for any queries:

Name		Name	Last commit message	Last commit date
Latest commit History 344 Commits
2 Keys Keyboard		2 Keys Keyboard
2 Sum \| InterviewBit		2 Sum \| InterviewBit
All factors \| InterviewBit		All factors \| InterviewBit
Amazing Subarrays \| InterviewBit		Amazing Subarrays \| InterviewBit
Armstrong Number \| InterviewBit		Armstrong Number \| InterviewBit
Array to BST		Array to BST
Balanced Parenthesis \| InterviewBit		Balanced Parenthesis \| InterviewBit
Best t8ime to buy and sell stocks \| InterviewBit		Best t8ime to buy and sell stocks \| InterviewBit
Binary Represenation \| InterviewBit		Binary Represenation \| InterviewBit
Bit Flipping \| InterviewBit		Bit Flipping \| InterviewBit
Blindfolded Coin Toss \| InterviewBit		Blindfolded Coin Toss \| InterviewBit
Breaking Chocolate Bars \| InterviewBit		Breaking Chocolate Bars \| InterviewBit
Check Palindrome \| InterviewBit		Check Palindrome \| InterviewBit
Chips Factory \| InterviewBit		Chips Factory \| InterviewBit
Circular Sentence - Leetcode		Circular Sentence - Leetcode
Collatz Conjecture \| InterviewBit		Collatz Conjecture \| InterviewBit
Color of the Bear \| InterviewBit		Color of the Bear \| InterviewBit
Color of the last ball II \| InterviewBit		Color of the last ball II \| InterviewBit
Color of the last ball \| InterviewBit		Color of the last ball \| InterviewBit
Combination Sum II		Combination Sum II
Convert to Palindrome \| InterviewBit		Convert to Palindrome \| InterviewBit
Count Number of Teams		Count Number of Teams
Counter - II \| Leetcode		Counter - II \| Leetcode
Cross the Bridge II \| InterviewBit		Cross the Bridge II \| InterviewBit
Cross the Bridge \| InterviewBit		Cross the Bridge \| InterviewBit
Delete Characters to Make Fancy String		Delete Characters to Make Fancy String
Digital Root \| InterviewBit		Digital Root \| InterviewBit
Dinner Hand Shakes \| InterviewBit		Dinner Hand Shakes \| InterviewBit
Divide Gold Bar \| InterviewBit		Divide Gold Bar \| InterviewBit
Divide Intervals Into Minimum Number of Groups		Divide Intervals Into Minimum Number of Groups
End of File \| Java		End of File \| Java
Equilateral Triangles using Toothpicks \| InterviewBit		Equilateral Triangles using Toothpicks \| InterviewBit
Excel Column Number \| InterviewBit		Excel Column Number \| InterviewBit
Extracting Numbers \| InterviewBit		Extracting Numbers \| InterviewBit
FInd Duplicate in Array \| InterviewBit		FInd Duplicate in Array \| InterviewBit
Fake Note \| InterviewBit		Fake Note \| InterviewBit
Fastest Horses \| InterviewBit		Fastest Horses \| InterviewBit
Filling Bookcase Shelves		Filling Bookcase Shelves
Find K-th Smallest Pair Distance		Find K-th Smallest Pair Distance
Find Variance \| InterviewBit		Find Variance \| InterviewBit
Find the City With the Smallest Number of Neighbors at a Threshold Distance		Find the City With the Smallest Number of Neighbors at a Threshold Distance
First Index \| InterviewBit		First Index \| InterviewBit
FizzBuzz \| InterviewBit		FizzBuzz \| InterviewBit
Form a Palindrome		Form a Palindrome
Frequency of Characters \| InterviewBit		Frequency of Characters \| InterviewBit
Gas Station \| InterviewBit		Gas Station \| InterviewBit
Gates of Heaven \| InterviewBit		Gates of Heaven \| InterviewBit
Generate all Parentheses \| InterviewBit		Generate all Parentheses \| InterviewBit
Genie and Hats \| InterviewBit		Genie and Hats \| InterviewBit
Greater of Lesser \| InterviewBit		Greater of Lesser \| InterviewBit
Greater than All \| InterviewBit		Greater than All \| InterviewBit
Helium Balloons \| InterviewBit		Helium Balloons \| InterviewBit
Highest Product \| InterviewBit		Highest Product \| InterviewBit
Identical Binary Trees \| InterviewBit		Identical Binary Trees \| InterviewBit
Integer to English Words		Integer to English Words
Intersection of Sorted Arrays \| InterviewBit		Intersection of Sorted Arrays \| InterviewBit
Invert the Binary Tree \| InterviewBit		Invert the Binary Tree \| InterviewBit
Is Rectangle? \| InterviewBit		Is Rectangle? \| InterviewBit
Java Datatypes		Java Datatypes
Java If-Else		Java If-Else
Java Loops 1		Java Loops 1
Java Output Formatting		Java Output Formatting
Java Stdin and Stdout I		Java Stdin and Stdout I
Java Stdin and Stdout II		Java Stdin and Stdout II
K Largest Elements		K Largest Elements
K-Pangrams		K-Pangrams
Kingdom of Friendship \| InterviewBit		Kingdom of Friendship \| InterviewBit
Kth Distinct String in an Array		Kth Distinct String in an Array
Kth Largest Element in a Stream		Kth Largest Element in a Stream
Kth Row of Pascal's Traingle \| InterviewBit		Kth Row of Pascal's Traingle \| InterviewBit
Last digit K count \| InterviewBit		Last digit K count \| InterviewBit
Leaders in a Array \| InterviewBit		Leaders in a Array \| InterviewBit
Leap Year \| InterviewBit		Leap Year \| InterviewBit
Lemonade Change		Lemonade Change
Length of Last Word \| InterviewBit		Length of Last Word \| InterviewBit
Longest Common Prefix \| InterviewBit		Longest Common Prefix \| InterviewBit
Longest Increasing Subsequence \| InterviewBit		Longest Increasing Subsequence \| InterviewBit
Lowest Common Multiple \| InterviewBit		Lowest Common Multiple \| InterviewBit
Magic Squares In Grid		Magic Squares In Grid
Majority Element \| InterviewBit		Majority Element \| InterviewBit
Make Two Arrays Equal by Reversing Subarrays		Make Two Arrays Equal by Reversing Subarrays
Max Min \| InterviewBit		Max Min \| InterviewBit
Max Sum Contiguous Subarray \| InterviewBit		Max Sum Contiguous Subarray \| InterviewBit
Maximum Distance in Arrays		Maximum Distance in Arrays
Maximum Number of Points with Cost		Maximum Number of Points with Cost
Maximum Substring \| InterviewBit		Maximum Substring \| InterviewBit
Maximun height of staircase \| InterviewBit		Maximun height of staircase \| InterviewBit
Merge Two Sorted Lists II \| InterviewBit		Merge Two Sorted Lists II \| InterviewBit
Min Steps in Infinite Grid \| InterviewBit		Min Steps in Infinite Grid \| InterviewBit
Min Sum Path in Matrix		Min Sum Path in Matrix
Minimum Deletions to make string balanced		Minimum Deletions to make string balanced
Minimum Number of Changes to Make Binary String Beautiful \| Leetcode		Minimum Number of Changes to Make Binary String Beautiful \| Leetcode
Minimum Number of Pushes to Type Word II		Minimum Number of Pushes to Type Word II
Minimum Parantheses! \| InterviewBit		Minimum Parantheses! \| InterviewBit
Minimum Swaps to Group All 1's together		Minimum Swaps to Group All 1's together
Nearest Smaller Element \| InterviewBit		Nearest Smaller Element \| InterviewBit
Next Number II \| InterviewBit		Next Number II \| InterviewBit
Number Complement		Number Complement
Number of 1 Bits \| InterviewBits		Number of 1 Bits \| InterviewBits
Number of Senior Citizens		Number of Senior Citizens

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

DSA Practice Repository

🛠️ Technologies

💡 How to Use

🚀 Contribution

📞 Contact

About

Contributors 2

Languages

adityaranjan2005/Data-Structures-and-Algorithms

Folders and files

Latest commit

History

Repository files navigation

DSA Practice Repository

🛠️ Technologies

💡 How to Use

🚀 Contribution

📞 Contact

About

Topics

Resources

Stars

Watchers

Forks

Contributors 2

Languages