## Amazon Interview Question for SDE1s

Team: Machine learning
Country: India
Interview Type: Phone Interview

Comment hidden because of low score. Click to expand.
0
of 0 vote

hmmm, what would work longer with heaps. in your proposed solution complexity is O(k*n), while with heaps in becomes is O(k*n*logk). I don't think it could be made better than O(k*n). Depends on constraints on elements of arrays

Comment hidden because of low score. Click to expand.
0

The first solution is actually O(k^2*n). Using heap will improve it to O(n*k*logk)

Comment hidden because of low score. Click to expand.
0
of 0 vote

def merge(nums1, m, nums2, n)
puts nums1[m..m+n] = nums2
puts nums1.sort!
end

nums1 = [1,2,3,0,0,0]
nums2 = [2,5,6]
m = 3
n = 3

array2 = merge(nums1, m, nums2, n)

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

### Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.