Merging Two Sorted Lists - Amazon Top Interview Questions

                        Solution in C++ :

vector<int> solve(vector<int>& a, vector<int>& b) {
    int an = a.size(), bn=b.size();
    int left = 0, right = 0, n=an+bn, k=0;
    vector<int> ans(n);

    while(left<an && right<bn){
        if(a[left]<b[right]) ans[k++] = a[left++];
        else ans[k++] = b[right++];
    }
    while(left<an) ans[k++] = a[left++];
    while(right<bn) ans[k++] = b[right++];
    return ans;
}
                    

                        Solution in Java :

import java.util.*;

class Solution {
    public int[] solve(int[] a, int[] b) {
        int i = 0;
        int j = 0;
        int[] result = new int[a.length + b.length];
        int index = 0;
        while (i < a.length || j < b.length) {
            int num1 = i < a.length ? a[i] : Integer.MAX_VALUE;
            int num2 = j < b.length ? b[j] : Integer.MAX_VALUE;
            if (num1 < num2) {
                result[index++] = num1;
                i++;
            } else {
                result[index++] = num2;
                j++;
            }
        }
        return result;
    }
}
                    

                        Solution in Python : 
                            
class Solution:
    def solve(self, l, r):
        li, ri, result = 0, 0, []
        while li < len(l) and ri < len(r):
            if l[li] <= r[ri]:
                result.append(l[li])
                li += 1
            else:
                result.append(r[ri])
                ri += 1

        return result + l[li:] + r[ri:]