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

[@GregHogg]

Master Data Structures & Algorithms for FREE at AlgoMap.io/

[@tradeiteasyy]

Please explain brute, better and optimised approaches so that it would be beneficial more in solving problem..thanks for your teaching,its awesome 😊

[@surajbkunte7672]

void merge(vector& nums1, int m, vector& nums2, int n) { for(int i = m; i

[@W16-1]

Thanks, it really helped : )

[@s.gveeronstart4794]

Sir can u upload free python tutorial 0 to hero with DSA

[@GregHogg]

algomap.io has all of this

[@rdubb77]

This should be a medium. 3 pointers, reverse iteration, sorting…For christ sake “length of last word” is an easy 😂

[@theognis1002]

exactly. good luck solving in an interview question (if uve never seen it before)

[@Everafterbreak_]

i've solved hard problems easier than this one for sure

[@veotic2728]

@@Everafterbreak_ leetcode difficulty is not accurate MOST of the time. there's TONs of easy questions that are harder than mediums

[@HarunFarah]

I know its not in the spirit of the problem but wouldn't this work nums1[m:] = nums2 nums1.sort()

[@harshagrawal6378]

yeah absolutely it works

[@wanderlust1814]

class Solution(object): def merge(self, nums1, m, nums2, n): for i in range(n): nums1[m+i]=nums2[i] nums1.sort() can you please explain this 🥺

[@whitetiger1810]

What about: def merge(self, nums1, m, nums2, n): nums1[m:] = nums2 nums1.sort()

[@axpg1297]

obviously works but you aren't passing an interview with that.

[@whitetiger1810]

@axpg1297 as if anyone gives interviews anymore

[@krishshroff5719]

@@axpg1297 why not