DSA Java Practice Repository

Welcome to the DSA Java Practice Repository! This repository is dedicated to practicing Data Structures and Algorithms (DSA) in Java. Below, you will find an organized index of problems and questions implemented in this repository.

Table of Contents

Array Problems

1. Average of Array Elements
2. Multiply each element of array by 10
3. Liner Search an element in Array
4. Find the maximum element in and Array
5. Return sum of +ve and -ve numbers
6. Count the number of Zeros and Ones
7. Swap Alternate Elements in an Array
8. Print Array Intersection Element
9. Print Alternate Extreme Elements of an Array
10. Reverse an Array
11. Shift Array Elements By 1 Position
12. Find mode of Array
13. Find Highest and Lowest Frequency of an Array
14. Mode of Array
15. Sort an Array of 0s and 1s
16. Missing Number
17. Two Sum
18. 3 Sum
19. Find First Repeating Element
20. Find Pivot Index
21. Maximum Subarray: Kadane's Algorithm
22. 2-D Array Sum of each row in a 2D array
23. 2-D Array Sum of each column in a 2D array
24. Wave Print Matrix (Snake Like)
25. Sorting Algorithms
26. Binary Search Implementation
27. Upper bound and lower bound

How to Use

1. Clone the repository:

   git clone <repository-url>

2. Open the project in your favorite IDE (e.g., IntelliJ IDEA).
3. Navigate to the src folder to explore the solutions.

Contribution

Feel free to contribute by adding new problems or improving existing solutions. Make sure to follow the existing folder structure and naming conventions.

License

This repository is for personal practice and learning purposes. No license is applied.