Problem Statement Given two sorted arrays arr1[] and arr2[] and an integer k , return the kth smallest element from the combined sorted array. Brute Force Intuition In an interview, you can explain it like this: Since both arrays are sorted, we can merge them similar to Merge Sort. While merging, keep counting elements. The moment we reach the kth element, return it. Complexity Time Complexity: O(N + M) Space Complexity: O(N + M) Brute Force Code int [] merged = new int [ n + m ]; // Merge both