There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). You may assume nums1 and nums2 cannot be both empty. Example 1: nums1 = [1, 3] nums2 = [2] The median is 2.0 Example 2: nums1 = [1, 2] nums2 = [3,…… Continue reading Leetcode 4 Median of Two Sorted Arrays Java Solution
Tag: Amazon Interview Question
Leetcode 3 Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. Example 1: Input: “abcabcbb” Output: 3 Explanation: The answer is “abc”, with the length of 3. Example 2: Input: “bbbbb” Output: 1 Explanation: The answer is “b”, with the length of 1. Example 3: Input: “pwwkew” Output: 3 Explanation: The answer is “wke”, with…… Continue reading Leetcode 3 Longest Substring Without Repeating Characters
Leetcode 2 Add Two Numbers Java Solution
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself. Example: Input: (2 ->…… Continue reading Leetcode 2 Add Two Numbers Java Solution
Trapping Rain Water Problem LeetCode Java Solution
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. Example: Input: [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6 class Solution { public int trap(int[] height) { int arrLength = height.length; int total = 0; if(arrLength<=2) return total; int[] leftMaxArr = new int[arrLength]; int[]…… Continue reading Trapping Rain Water Problem LeetCode Java Solution