rohan472000 / java-dsa-interviewprep Goto Github PK

Hi Contributors,

This Repository is open for Hactoberfest2023, will be awaiting for your PRs, in case if any queries you can discuss here in this issue.

If no issue is there, then make a issue which you think is good to raise.

We will be accepting code and no-code PRs.

hello i am adding bellman ford algorithm code in existing graph folder pls assign me that

Hello, sir, I want to add Disjoint set Data structure template, please assign me with this task.

I would like to add implementation of graph in java..Please add hacktoberfest label and assign me

can someone fix/update its README.md as many topics are not included in it.

Also, put algo which are outside of folder to required folder.

@charlie8658 @rohit777anand look into this issue

Hey! @rohan472000! The purpose of a Table of Contents is to provide readers with a quick and efficient way to navigate through the document's content. However, in its current state, the Table of Contents fails to fulfill this essential role. When readers click on the links or page numbers listed in the Table of Contents, they do not get redirected to the corresponding topics within the document.

I want to work on this Issue, Can you assign this to me?

I'd like to add merge sort under sorting sub folder.

Hi @rohan472000 ,
i have raised PR for it.

Fix any code issue/errors

hello want to add segment tree algorithm .please assign me this under hactoberfest label

assign me this work I can create a folder that have 40+different types of sorting algorithm.

and I ensure that you will be happy with my work.

@rohan472000 assign me this issue

I want to make a folder on String where I will update top String problem.
As I requested previously under Hactoberfest issue please assign me this.
Thank you

In this repo, many files are outside of the directory, which is not a good practice to keep, kindly someone raise a PR for putting those files in their appropriate directory.

#include
#include

// Function to merge two sorted subarrays into a single sorted array
void merge(std::vector& arr, int left, int mid, int right) {
int n1 = mid - left + 1;
int n2 = right - mid;

// Create temporary arrays
std::vector<int> leftArr(n1);
std::vector<int> rightArr(n2);

// Copy data to temporary arrays leftArr[] and rightArr[]
for (int i = 0; i < n1; i++) {
    leftArr[i] = arr[left + i];
}
for (int i = 0; i < n2; i++) {
    rightArr[i] = arr[mid + 1 + i];
}

// Merge the temporary arrays back into arr[left..right]
int i = 0, j = 0, k = left;
while (i < n1 && j < n2) {
    if (leftArr[i] <= rightArr[j]) {
        arr[k++] = leftArr[i++];
    } else {
        arr[k++] = rightArr[j++];
    }
}

// Copy the remaining elements of leftArr[], if any
while (i < n1) {
    arr[k++] = leftArr[i++];
}

// Copy the remaining elements of rightArr[], if any
while (j < n2) {
    arr[k++] = rightArr[j++];
}

}

// Main function to perform Merge Sort
void mergeSort(std::vector& arr, int left, int right) {
if (left < right) {
int mid = left + (right - left) / 2;

    // Recursively divide the array into two halves
    mergeSort(arr, left, mid);
    mergeSort(arr, mid + 1, right);

    // Merge the sorted halves
    merge(arr, left, mid, right);
}

}

int main() {
int n;
std::cout << "Enter the number of elements: ";
std::cin >> n;

std::vector<int> arr(n);

std::cout << "Enter " << n << " elements: ";
for (int i = 0; i < n; i++) {
    std::cin >> arr[i];
}

std::cout << "Original array: ";
for (int num : arr) {
    std::cout << num << " ";
}
std::cout << std::endl;

mergeSort(arr, 0, arr.size() - 1);

std::cout << "Sorted array: ";
for (int num : arr) {
    std::cout << num << " ";
}
std::cout << std::endl;

return 0;

}

For this repo, I need a good PR template which has all necessary checkboxes so that every PR will be easily understandable to viewers.