LeetCode Experience

#2040 Kth Smallest Product of Two Sorted Arrays

SWE coding Hard

Sign in to bookmark Original →

Interview Experience

LeetCode #2040: Kth Smallest Product of Two Sorted Arrays. Difficulty: Hard. Topics: Array, Binary Search. Asked at Google in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Arrays Binary Search Heap

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview

← All Google questions Google Software Engineer Questions → All Arrays,Binary Search,Heap Questions →