LeetCode Question · Dec 2024

OA questions

4 upvotes 574 views 6 replies

Question Details

1) From google OA (26th october): You are given an array A, find number of ways to choose subsequence of length 4 (i,j,k,l) such that A[i]xA[k]=A[j]xA[l], A[i]<=10^9 and N<=1000...

Full Details

🔒

Unlock all Google questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a google interview for a swe role during the oa round reported in 2024.

It covers the following topics: Arrays, Binary Search, Oop .