Track: SDE-2

PayPal – SDE-2 Role Interview Briefing

Round Breakdown

The hiring process consists of three technical rounds followed by a managerial round.

Round 1: Technical (DSA + Java Fundamentals)

• Focus: Array-based problems with a mathematical approach and Java fundamentals.
• Difficulty: LeetCode Easy to Medium.

Questions Asked

1. Array (Maths-based)
   • Solve problems involving mathematical operations on arrays (e.g., sliding window, prefix sums).
2. Java Fundamentals
   • Core Java concepts (e.g., collections, multithreading basics, exception handling).

Round 2: Technical (DSA + Brain Teaser)

• Focus: Array-based problems (LeetCode Easy) combined with a brain teaser puzzle.
• Difficulty: Mixed (Easy to Hard).

Questions Asked

1. Array (LeetCode Easy)
   • Problems like two-sum, reverse an array, or sliding window maximum.
2. Brain Teaser (Hard)
   • Logical puzzles to assess problem-solving under constraints (e.g., "100 prisoners and a light bulb").

Round 3: Managerial (Hiring Manager Round)

• Focus: Cultural fit, leadership, and role-specific expectations.
• Format: Discussion with the hiring manager.

Questions Asked

• Behavioral and situational questions (e.g., "Describe a challenging project and how you handled it.").

Source: LeetCode Discussion

Track: Intern

PayPal – Intern Role Interview Briefing

Technical Phone Interview

• Duration: 1 hour
• Focus Areas: Java theory, data structures, algorithms, and coding.

Topics Covered

• Java Theory: Design Patterns, OO Concepts (e.g., inheritance, polymorphism) with examples.
• Data Structures: Hashing, popular sorting/searching algorithms, and their time/space complexities.
• Algorithms: Problem-solving using arrays, strings, and basic DSA concepts.

Questions Asked

1. Java Theory

   • Design Patterns (e.g., Singleton, Factory)
   • Object-Oriented Concepts (e.g., Abstraction, Encapsulation) with real-world examples.

2. Data Structures

   • Explain Hashing and its applications.
   • Compare sorting algorithms (e.g., QuickSort vs. MergeSort) and their complexities.

3. Coding Question

   • Valid Anagram: Determine if two strings are anagrams (LeetCode-style problem).

Source: LeetCode Discussion