Java Solution || Easy understanding ✔
class Solution {\n    public int maxDistance(int[] nums1, int[] nums2) {\n        \n        int i = 0, j = 0, ans = 0;\n        while(i < nums1.length && j < nu
class Solution {\n    public int maxDistance(int[] nums1, int[] nums2) {\n        \n        int i = 0, j = 0, ans = 0;\n        while(i < nums1.length && j < nums2.length){\n            if(nums1[i] > nums2[j])\n                i++;\n            else{\n                ans = Math.max(ans, j-i);\n                j++;\n            }\n        }\n        return ans;\n    }\n}
['Binary Tree', 'Java']