Merge Sorted Array LeetCode Java (

Question explanation - 0:03
Approach 1 - 01:50
Three pointer algo - 04:43
Three pointer code - 6:54
📌 ALWAYS check pinned comment.
🔔 TURN ON notification for new video updates.
Join our Patreon for Videos On Demand:
/ edigest
Follow us on linkedIn :
/ engineeringdigest
Join Our Discord:
/ discord
DSA Playlist:
• Playlist
Spring Playlist:
• Spring Tutorial for Be...
Python Playlist:
• Playlist
Sound Effects Source: www.zapsplat.com/
--------------------------------------------------------------------------------------
engineering digest,2022,2023,2024,merge sorted array,leetcode 88,88. merge sorted array,merge sorted array leetcode,leetcode java,data structures,merge sorted arrays,data structures and algorithms in java,88. merge sorted array java,88. merge sorted array javascript,88. merge sorted array js,88. merge sorted array c++,leetcode java problems,leetcode java solution,leetcode java interview questions,leetcode java playlist,data structures playlist,data structures and algorithms in java full course,data structures python playlist,data structures and algorithms in java for beginners,data structures and algorithms javascript playlist,data structures crash course for interview,data structures and algorithms interview questions,data structures and algorithms playlist,leetcode javascript solutions,leetcode javascript interview questions

[@Premchand-ko9fm]

👍

[@sanjaychaharnaturevlogs7077]

Runtime error

[@sanjaychaharnaturevlogs7077]

Error in code

[@poonamshinhapoonamshinha2795]

Error code

[@teju2213]

when u submmit then there is different code

[@EngineeringDigest]

check 9:00

[@shoumomondal7850]

@@EngineeringDigest class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int r1 = m - 1; int r2 = nums2.length - 1; int w = m + n - 1; while (w >= 0) { if (r1 >= 0 && r2 >= 0) { nums1[w] = nums1[r1] > nums2[r2] ? nums1[r1--] : nums2[r2--]; } else if (r1 >= 0) { nums1[w] = nums1[r1--]; } else { nums1[w] = nums2[r2--]; } w--; } } }