Merge 2 Sorted array without using Extra Space | Love Babbar DSA Sheet Q12 | Arrays

Показать описание

✅ Useful Links

SUBSCRIBE AND HIT BELL ICON TO CHECK MORE OF MY CONTENT

Merge 2 Sorted array without using Extra Space | Love Babbar DSA Sheet Q12 | Arrays

𝐌𝐔𝐒𝐈𝐂 𝐂𝐑𝐄𝐃𝐈𝐓
Track: Julius Dreisig & Zeus X Crona - Invisible [NCS Release]
Music provided by NoCopyrightSounds.

Track: Axollo - Silence (ft. Josh Bogert) [NCS Release]
Music provided by NoCopyrightSounds.

Рекомендации по теме

Комментарии

Thank you so much for this solution I tried to get it from various websites, even leetcode discussion i was not able to understand. Thanks for clarifying.
God Bless Everyone😇

sakshiaggarwal

you can optimize this fixArray function by introducing a bool variable cause you are iterating the full array but need to iterate till the elements shifts though on gfg it will give error cause it, for gfg cycle sort approach will work and one another thing you have used bubble sort approach in code not insertion sort

rahulprasad

i never know ki arrays aise bhi print ki ja sakti thi.... thanks a lot...

aniruddhachunne

bhai doing great work .just keep it up

omkarbarbadikar

bhai tum while loop me function call kr re ho aur uske TC O(n) hai to TC in total O(n*m) hogai, ye to heavy hai time complexity ke hisab se . Not and optimized solution.

urge-bull

for some reason its giving TLE to me:

Test Cases Passed:
1110 /1119

Here is the Code:

class Solution
{
//Function to merge the arrays.
public static void merge(long arr1[], long arr2[], int n, int m)
{
// code here
int i=0, j=0;
long temp=0;
while(i<n){
if(arr1[i]>arr2[j]){
temp=arr1[i];
arr1[i]=arr2[j];
arr2[j]=temp;
fixArray2(arr2, m);
}
i++;
}
}
static void fixArray2(long arr2[], int m){
long temp=0;
for(int i=1; i<m; i++){
if(arr2[i]<arr2[i-1]){
temp=arr2[i];
arr2[i]=arr2[i-1];
arr2[i-1]=temp;
}
}
}

}

rahulgupta

public static void merge(long arr1[], long arr2[], int n, int m)
{
// code here
int left = n-1;
int right = 0;
while(left >=0 && right <m){
if(arr1[left] > arr2[right]){
long temp = arr1[left];
arr1[left] = arr2[right];
arr2[right] = temp;
left--;
right++;
}else{
break;
}

}
Arrays.sort(arr1);
Arrays.sort(arr2);
}
}

anushkaagrawal

U didn't merge the elements into a single array

bhushanp

Bekr hai bhai ye TLE dega iska code isiliye isne gfg pai nahi run Kiya code apne ide mai chala rha hai🧐

bartosz

Merge 2 Sorted array without using Extra Space | Love Babbar DSA Sheet Q12 | Arrays

Merge Sorted Array - Leetcode 88 - Python

Merge Sorted Arrays Without Extra Space | 2 Optimal Solution

Merge 2 sorted arrays without extra space

Merge two sorted Arrays into a third Sorted array

Merge Sorted Array | Live Coding with Explanation | Leetcode - 88

Merge 2 Sorted array without using Extra Space | Love Babbar DSA Sheet Q12 | Arrays

Median of Two Sorted Arrays - Binary Search - Leetcode 4

Merge Two Sorted Arrays | C Programming Example

Merge Two Sorted Lists - Leetcode 21 - Python

Lecture 20: Solving LeetCode/CodeStudio Questions [Arrays]

Merge Sorted Array | Leetcode 88

How to merge two sorted arrays

Merge 2 Sorted Lists - A Fundamental Merge Sort Subroutine ('Merge Two Sorted Lists' on Le...

Google Coding Interview Question - Merge Two Sorted Lists - Leetcode 21

Merge Sorted Array - Leetcode 88 - Arrays & Strings (Python)

How to merge two sorted arrays? MySirG

Merge Two Sorted Arrays into a Third Sorted Array

Merge Two Sorted Arrays | GeeksforGeeks

Merge Two Sorted Arrays Without Extra Space

Merge Sorted Arrays Problem and Next Permutation Problem | DSA Series

Merge Two Sorted Arrays Without Extra Space | Leetcode Problem and Solution

Merge Sorted Array - LeetCode 88 - Java

BS-21. Median of two Sorted Arrays of Different Sizes | Binary Search Approach With Intuition

Merge two sorted arrays in O(1) space | GFG | C++ and Java | Brute-Better-Optimal