Paypal

Paypal Software Engineer Onsite Coding Questions

15+ questions from real Paypal Software Engineer Onsite Coding rounds, reported by candidates who interviewed there.

15
Questions
8
Topic Areas
10+
Sources

What does the Paypal Onsite Coding round test?

The Paypal onsite coding round is the core technical evaluation. Software Engineer candidates typically see 2-3 algorithm and data structure problems. Problems range from medium to hard difficulty, and interviewers evaluate both correctness and code quality.

Top Topics in This Round

Paypal Software Engineer Onsite Coding Questions

I\'m having trouble understanding how to solve the following problem: (Appreciate any help with the logic) Problem: You are given a list[list[str]] which represents boarding passes for an itinerary. You optimized...

You have N coins. All are the same weight except for one, which is either heavier or lighter than the others. Design an efficient algorithm to identify the counterfeit coin....

LeetCode #1200: Minimum Absolute Difference. Difficulty: Easy. Topics: Array, Sorting. Asked at PayPal in the last 6 months.

LeetCode #300: Longest Increasing Subsequence. Difficulty: Medium. Topics: Array, Binary Search, Dynamic Programming. Asked at PayPal in the last 6 months.

LeetCode #33: Search in Rotated Sorted Array. Difficulty: Medium. Topics: Array, Binary Search. Asked at PayPal in the last 6 months.

LeetCode #3: Longest Substring Without Repeating Characters. Difficulty: Medium. Topics: Hash Table, String, Sliding Window. Asked at PayPal in the last 6 months.

LeetCode #295: Find Median from Data Stream. Difficulty: Hard. Topics: Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream. Asked at PayPal in the last 6 months.

LeetCode #347: Top K Frequent Elements. Difficulty: Medium. Topics: Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect. Asked at PayPal in the last 6 months.

LeetCode #56: Merge Intervals. Difficulty: Medium. Topics: Array, Sorting. Asked at PayPal in the last 6 months.

LeetCode #2858: Minimum Edge Reversals So Every Node Is Reachable. Difficulty: Hard. Topics: Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory. Asked at PayPal in the last 6 months.

LeetCode #1251: Average Selling Price. Difficulty: Easy. Topics: Database. Asked at PayPal in the last 6 months.

LeetCode #3820: Pythagorean Distance Nodes in a Tree. Difficulty: Medium. Topics: Tree, Breadth-First Search. Asked at PayPal in the last 6 months.

LeetCode #735: Asteroid Collision. Difficulty: Medium. Topics: Array, Stack, Simulation. Asked at PayPal in the last 6 months.

LeetCode #560: Subarray Sum Equals K. Difficulty: Medium. Topics: Array, Hash Table, Prefix Sum. Asked at PayPal in the last 6 months.

LeetCode #121: Best Time to Buy and Sell Stock. Difficulty: Easy. Topics: Array, Dynamic Programming. Asked at PayPal in the last 6 months.

See All 15 Questions from This Round

Full question text, answer context, and frequency data for subscribers.

Get Access