ankitapuri / DSA-guide

Trying to cover important DSA
MIT License
49 stars 113 forks source link

Merge two sorted arrays without using extra space #289

Open kiruba-r11 opened 3 years ago

kiruba-r11 commented 3 years ago

💥 Proposal

Two sorted arrays would be given and those arrays should be merged without using extra space. For example: Array - 1 = [0 , 2 , 4 , 6] Array - 2 = [1 , 3 , 5 , 7 , 9]

Since, extra space should not be used, the result should be store in input array itself like,

Array - 1 = [0 , 1 , 2 , 3] Array - 2 = [4 , 5 , 6 , 7 , 9]

Have you read the Contributing Guidelines on Pull Requests ?

Yes

kiruba-r11 commented 3 years ago

@ankitapuri Can i work on this in C++ under CrossWoc

pri1311 commented 3 years ago

Would like to do it in python

abhinav5481 commented 3 years ago

Hi @ankitapuri I would like to solve it in javascript. Please assign it to me in Java

rish-singhal commented 3 years ago

I would like to do this in python if possible assign me.

ankitapuri commented 3 years ago

I would like to do this in python if possible assign me.

yeah sure

ASLManasa commented 3 years ago

I would like to do it in java could you please assign me this. Thanks

Mudit-Jxin7 commented 1 year ago

Hi I would like to contribute to this issue if anyone else is not working on it C++ language