LeetCode
Question
·
Aug 2021
Improve the Time Complexity Facebook
123 views
2 replies
Question Details
Given two unsorted arrays A1 and A2 containing negative and positive integers of different lengths, find the kth maximum product of A1[i] A2[j] ( a number from A1 number from A2) Example:...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Arrays
Strings
More from Meta
Reddit
Leetcode is cooked in 2026 and we don't hire people who only grind leetcode.
Reddit
Returning to SWE work after 3 years of cancer treatment
Reddit
2026 New Grad Recap
Reddit
Most likely failed meta phone screen
Reddit
Targeting OpenAI SWE Roles? Insights on what to expect from recent system design loops