LeetCode
Question
·
Jun 2021
·
San Francisco
PayPal | OA | SDE
8 upvotes
5,187 views
14 replies
Question Details
Round was on Hackerearth platform having two coding questions. Duration: 1 hour 20 minutes. 1) Maximum Triangular Subsequence: Given an array of integers A, find the length of largest triangular subsequence. A...
Full Details
🔒
Unlock all Paypal 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 paypal interview for a swe role during the oa round reported in 2021.
It covers the following topics: Arrays, Binary Search, Recursion, Strings .