Jobra
🐞Step 1 of Jobra:AI Debugging Rounds
DSA+AIPreparing you for both.
JOBRA · AI DEBUG ROUND (PREVIEW)sum.cpp
// buggy snippet
int total(vector<int>& a, int n) {
    int sum = 0;
    for (int i = 0; i <= n; i++) { // 🐞        sum += a[i];
    }
    return sum;
}
A real codebase. A real bug. You + AI.

Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.

Prompt:Correct the loop condition
Tap 'Let Jobra fix it' below to simulate AI debugging...

How to Crack PayPal: The Software Engineer Intern Interview, From Real Experiences

17 min read

PayPal SWE intern interview guide from six real accounts: OA coin change and music player tasks, linked lists, HashMap internals, HR questions and verified practice links.

In this article
On this page

Last reviewed November 20, 2026 · 25 min read · For candidates targeting Software Engineer and SDE summer internships in India

Researched and written by the Codinzhub Editorial Team from six independent first-hand sources: five candidate write-ups and one archived discussion comment. Five internal full-time PayPal records were reviewed but excluded because they describe SDE roles, not internships. Every question below is a verbatim report or a faithful paraphrase; nothing was invented to fill a round.

The 30-second version: The reported PayPal intern loop is a resume screen, a timed online assessment of MCQs plus one or two coding questions, one technical interview and one HR or managerial round. Assessments ran 60 minutes in two accounts and used HackerRank in three. The technical rounds mix linked-list manipulation, OOP, Java HashMap internals, SQL, graphs and easy-to-medium coding, with one account requiring code on paper and a proof of correctness. HR asks about PayPal, motivation, self-reflection and how you handle unclear or contested solutions. One 2023 campus drive selected 8 interns; one 2024 off-campus candidate was rejected after a positive technical round.

Important things to know before you start

The assessment format varies, but it is always mixed. Accounts report 20 MCQs plus one coding question, 9 MCQs plus one coding question in 60 minutes, 6 MCQs plus two coding questions, and two coding questions with MCQs uncertain. There is no single universal paper.

Linked-list surgery is a recurring theme. Two accounts describe detecting a linked-list cycle, one of them asking for the cycle's start and the other asking for removal and a proof of correctness. A queue built from stacks also appeared.

OOP is examined deeply, not by definition. Candidates were asked for real-life examples of inheritance, polymorphism, abstraction and encapsulation, the types of polymorphism, virtual functions, whether an abstract class can be private, and a 30-minute discussion of Java HashMap internals.

You may have to defend your code on paper. One technical round required linked-list code on paper, edge-case testing and a proof of the solution. Another candidate solved the coding question but could not give an optimised approach.

HR can include a coding question. One account reports an easy array problem solvable with a hashmap in the HR round, alongside a resume walkthrough. Do not treat the final round as purely conversational.

What this guide covers

This guide covers PayPal Software Engineer and SDE summer internship hiring in India, with one older US account used only to show how a loop can differ by region. It is not a guide to PayPal SDE 1, SDE 2, Full Stack Developer or Data Scientist hiring. Those are different role families, and their questions are not mixed into this guide.

Scope: Software Engineer Intern / SDE Summer Intern, India, with evidence published between 2022 and 2025 plus one archived 2017 US comment. Five full-time internal records were excluded from the question counts.

Selected vs. rejected: do this, not that

These habits come from selected and rejected accounts. They are observations from six reports, not a proven formula.

Do thisNot thatWhy it matters
State complexity and discuss optimisation after solving a coding problem.Stop at a working solution and wait to be asked.One candidate solved the problem but struggled with the optimisation discussion.
Know data structure trade-offs, not just definitions.Recite definitions of arrays, trees and graphs without use cases.Two accounts asked for differences, applications and time complexities.
Explain code on paper and test edge cases.Write code without stating invariants or tests.One interviewer asked for a proof of the linked-list solution.
Prepare company answers: why PayPal, unique features, local reach.Give a generic "good company" answer.These appeared verbatim in HR rounds.
Prepare situation stories for unclear requirements and team disagreement.Assume technical rounds are the only scored stage.The managerial round asked directly about both situations.

Round-by-round breakdown

Stage 1: Application

Three routes are attested: an on-campus drive, an application through a university placement process, and the PayPal careers portal. One 2024 account describes an off-campus internship after resume screening. One older US comment describes a phone interview followed by four Skype interviews, but gives no questions.

Stage 2: Shortlisting

Resume screening is the first filter. One campus account says eligibility was based on CGPA up to the fourth semester, with about 400 eligible students and 8 reaching the next round. A 2023 on-campus account reports 20 candidates selected for the technical round and 8 for the internship. These are single-campus funnel numbers, not company-wide rates.

Stage 3: Online assessment

How it works. The assessment combines multiple-choice questions with one or two coding tasks. HackerRank is named in three accounts and PayPal's own interface in one. Two accounts give a 60-minute duration. Coding tasks range from easy array problems to a medium-hard music-player design question.

At a glance: 60 minutes in two accounts, not reported in three; 1 to 2 coding questions plus 6 to 20 MCQs; HackerRank in three accounts, PayPal's own interface in one. Topics: arrays, strings, coin-change DP, class design, DBMS, OS, networks and aptitude.

Question summarySkill or patternReported follow-upLevel / scopePractice link
Find the least number of coins to make an amount using pennies, nickels, dimes and quarters.Greedy or coin-change DPSamples: 30 -> 2, 100 -> 4InternCoin Change
Design a music player based on song preferences.Object-oriented designNot reportedSDE Summer Intern, 2024No verified practice match
A medium-to-hard coding question on arrays and strings.Arrays and stringsNot reportedInternNo verified practice match
Two medium coding questions; statements not reported.General DSANot reportedIntern, 2023No verified practice match
About 20 MCQs on C/C++ input-output, maths, verbal and quantitative aptitude.CS fundamentals and aptitudeNot reportedInternNo verified practice match
MCQs on DBMS, OS, web technology and networks; another account reports aptitude and DSA application MCQs.CS fundamentalsNot reportedIntern, 2023-2024No verified practice match

Reading this table: three rows are topic-level reports because the candidate did not record the full statement. They are included so the round is not understated, but they are not exact questions.

PayPal OA questions on Codinzhub: Browse PayPal questions.

Stage 4: The technical interview

How it works. Most accounts describe one technical round after the assessment. It opens with an introduction, then moves through data structures, OOP, a coding task and projects. One account required code on paper with edge cases and a proof. Another shared a HackerRank link inside the interview. One older US account reports four Skype rounds with algorithms, behavioural and domain questions.

At a glance: about 40 minutes in one account, not reported in others; 4 to 6 named prompts per account; paper, virtual and shared-editor surfaces. Topics: linked lists, OOP, Java HashMap, graphs, SQL, strings, concurrency and CS fundamentals.

Question summarySkill or patternReported follow-upLevel / scopePractice link
Detect and remove a loop in a linked list; write code on paper, test edge cases and prove it.Floyd cycle detectionProve the solutionInternLinked List Cycle II
Distinguish between a hash table and a hash map.Hashing conceptsNot reportedInternNo verified practice match
Explain how HashMap is implemented in Java.Java collections internals30-minute discussionInternNo verified practice match
Explain a single-source shortest path algorithm with an example; no code.Graph algorithmsNot reportedInternNo verified practice match
What are threads? Do they share the same address space, and why?Concurrency and OSNot reportedInternNo verified practice match
Explain arrays, linked lists, trees and graphs with time complexities and use cases.Data structure fundamentalsNot reportedInternNo verified practice match
OOP basics with real-life examples: inheritance, polymorphism, abstraction, encapsulation.OOP fundamentalsReal-life examplesInternNo verified practice match
Types of polymorphism and virtual functions / runtime polymorphism.OOP dispatchNot reportedInternNo verified practice match
What is abstraction? Can an abstract class be private?Java access modifiersNot reportedInternNo verified practice match
Implement a queue using stacks.Stack and queue compositionNot reportedInternImplement Queue using Stacks
Check a linked list for a cycle, then find the start of the cycle.Floyd cycle detectionFind the startInternLinked List Cycle
What is SQL injection?Web and database securityNot reportedInternNo verified practice match
Rewrite a query first answered with inner queries using joins.SQL joinsGive a different answer with joinsInternNo verified practice match
Give an approach to basic string manipulation and state its time complexity.Strings and complexityTime complexityInternNo verified practice match

Stage 5: HR and managerial round

How it works. The final conversation is usually HR or managerial. One account describes a managerial round with nine direct prompts; another asks four company and self-reflection questions. One account reports an easy array coding problem inside the HR round, so prepare for a short technical task as well as conversation.

At a glance: duration not reported; 4 to 9 prompts; conversational, with one reported coding question.

Question summarySkill or patternReported follow-upLevel / scopePractice link
Why PayPal? / What do you know about PayPal?Motivation and researchNot reportedInternNo verified practice match
What is the most challenging thing you have come across?OwnershipNot reportedInternNo verified practice match
What are the unique features of PayPal?Company researchNot reportedInternNo verified practice match
What is the reach of PayPal in your locality?Market awarenessNot reportedInternNo verified practice match
How adaptable are you?AdaptabilityNot reportedInternNo verified practice match
What is your proud moment?AchievementNot reportedInternNo verified practice match
Tell me about a failure in your life.Learning from setbacksNot reportedInternNo verified practice match
Strengths, weaknesses and skills still to develop.Self-awarenessNot reportedInternNo verified practice match
What are your job expectations?Role fitNot reportedInternNo verified practice match
What do you do if you don't understand the problem statement?CommunicationNot reportedInternNo verified practice match
What if your teammates don't like your solution?CollaborationNot reportedInternNo verified practice match
Walk me through your resume in depth.Resume defenceNot reportedInternNo verified practice match
Easy array problem solvable with a hashmap.HashingNot reportedInternTwo Sum

Stage 6: Decision

One 2023 on-campus account reports 8 internship selections including the candidate. One 2024 off-campus candidate was not selected after a positive technical interview, with the reason unknown. No account describes a hiring committee, team match, level change or compensation discussion. One 2017 US comment reports progressing through four Skype interviews, but no outcome.

Candidate experiences reviewed

BackgroundRole and reported outcomeWhat was asked
India campus, CGPA shortlistIntern · outcome not reportedCoin change OA; linked-list loop removal with proof, HashMap internals, shortest path, threads; PayPal HR questions
Second-year student, careers portalIntern · outcome not reported9 MCQs + array/string coding; DS use cases, OOP, optimisation discussion
University applicant, Nov 2023Intern · outcome not reported2 coding OA; OOP, queue using stacks, linked-list cycle; HR resume and array problem
Off-campus 2024SDE Summer Intern · rejectedMCQ + music player design; DS differences, OOP, array problem; HR
On-campus 2023SWE Summer Intern · selected6 MCQs + 2 coding; abstract class, strings, SQL injection, joins, puzzle; nine managerial prompts

The Codinzhub Next-Round Playbook

To get past the online assessment

  1. Practise one coding problem after nine MCQs in 60 minutes. Two accounts describe exactly that format.
  2. Revise coin-change DP and greedy counting. The pennies/nickels/dimes/quarters problem is the only fully specified OA coding task.
  3. Revise CS fundamentals for MCQs: DBMS, OS, computer networks, web technology, C/C++ input-output and aptitude.
  4. Be ready for a design-flavoured task. The music-player prompt was lengthy and required time to understand.

To get past the technical round

  1. Master linked-list cycle problems: detect, find the start and remove the loop. Be able to prove why the fast and slow pointers meet.
  2. Prepare Java HashMap internals to a depth of at least 30 minutes of discussion: hashing, buckets, collisions, resizing and treeification.
  3. Revise OOP with examples and know the difference between an abstract class and an interface, and whether an abstract class can be private.
  4. Practise SQL joins and SQL injection as short verbal answers, plus one query rewrite from a subquery to a join.
  5. Write code on paper and state edge cases, complexity and a short correctness argument.

To get past the HR and managerial round

  1. Prepare four company answers: why PayPal, unique features, local reach, and what you know about the business.
  2. Prepare six STAR stories for challenge, adaptability, proud moment, failure, strengths and weaknesses, and team disagreement.
  3. Rehearse the two situation answers: unclear problem statement, and a teammate rejecting your solution.
  4. Expect a short coding task in some rounds; an easy hashmap-based array problem was reported.

How the loop differs by level

LevelTypical experienceWhat the accounts emphasiseCoding depth
Software Engineer Intern / SDE Summer InternResume screen, timed assessment, one technical round, one HR or managerial roundDSA, OOP, DBMS, company knowledgeEasy to medium, with occasional medium-hard design
SDE 1 / SDE 2 (out of scope)Longer loops with system design and hiring-manager roundsNot covered here; five full-time records were excludedNot combined with intern evidence
US SWE intern, 2017One phone interview plus four Skype interviewsAlgorithms alongside behavioural and domain questionsOne old report, no questions recorded

Do not assume the Indian three-stage pattern applies to every region or year. The US report is eight years older and describes a longer loop.

Most-asked topics

TopicWhat it means in plain EnglishEvidence-backed priorityReported examples
Linked listsRewiring nodes and detecting cycles with two pointers.High - 3 of 4 technical accountsLoop removal with proof; cycle detection and start
OOPClasses, inheritance, polymorphism, abstraction and encapsulation.Very high - 4 of 4 technical accountsReal-life examples, virtual functions, private abstract class
HashingMapping keys to buckets and reasoning about collisions.Medium - 2 of 4 technical accountsHash table vs HashMap, Java implementation, hashmap array problem
Arrays and stringsScanning, frequency maps and complexity of simple approaches.Very high - 4 of 4 technical accountsArray/string OA, string manipulation, array problem, Two Sum-style task
SQL and DBMSJoins, subqueries and injection.Medium - 3 of 4 technical accountsSQL injection, join rewrite, DBMS MCQs
GraphsShortest paths and data structure use cases.Medium - 2 of 4 technical accountsSingle-source shortest path, graph use cases
Concurrency and OSThreads, address spaces and OS fundamentals.Medium - 2 of 4 technical accountsShared address space, OS MCQs
Company and behaviourMotivation, self-reflection and scenario answers.Very high - 4 of 4 accountsWhy PayPal, failure, team disagreement, unclear statement

The question patterns that keep coming back

1. Linked-list cycle reasoning

  • How to recognise it: "detect a loop", "find the start", "remove the loop", "prove it".
  • The invariant: a slow pointer moves one step and a fast pointer two; if they meet, a cycle exists. Resetting one pointer to the head finds the start.
  • Preparation action: write the loop detection, start-finding and removal versions from memory, and explain each in two sentences.

2. Data structure comparisons

  • How to recognise it: "differences between data structures", "time complexities and use cases", "hash table versus hash map".
  • The invariant: compare by access pattern, memory and operation cost, not by definition alone.
  • Preparation action: prepare a four-row table for array, linked list, tree and graph with one use case each.

3. OOP with justification

  • How to recognise it: "real-life example", "types of polymorphism", "can an abstract class be private".
  • The invariant: tie each concept to a language mechanism and a concrete example from your projects.
  • Preparation action: rehearse a single example that demonstrates inheritance, polymorphism, encapsulation and abstraction together.

4. SQL alternatives

  • How to recognise it: "give a different answer using joins".
  • The invariant: a subquery and a join can express the same filter; know when each is clearer.
  • Preparation action: rewrite three subquery problems as joins and explain the difference.

5. Situation answers in HR

  • How to recognise it: "what if the statement is unclear", "what if teammates dislike your solution".
  • The invariant: clarify first, state assumptions, propose a small experiment and appeal to evidence rather than authority.
  • Preparation action: prepare a 60-second answer for each using one real project example.

Preparing for the HR and managerial round

The HR and managerial rounds are scored. The prompts are direct: motivation, company knowledge, adaptability, a proud moment, a failure, strengths and weaknesses, job expectations, and two situation questions. One account also reports an easy coding task.

Core themes: motivation, self-awareness, adaptability, collaboration and clarity under ambiguity.

The six STAR stories to prepare

Use STAR: Situation, Task, Action, Result.

#Story promptFocus area
1A time you received unclear requirements and clarified them.Communication
2A teammate disagreed with your technical solution.Collaboration
3A project failure and what changed afterwards.Learning
4A moment you had to adapt quickly to a new tool or domain.Adaptability
5A piece of work you are genuinely proud of.Achievement
6A strength you used and a weakness you are improving.Self-awareness

Practice problems that match these experiences

Note on practice analogues: These problems share the technique named in the accounts. Unless marked "Exact reported problem", they are analogues, not leaked questions.

#Practice problemPatternSeen in these experiences asLink
1Coin ChangeGreedy / DPLeast coins with pennies, nickels, dimes, quartersLeetCode #322
2Linked List Cycle IITwo pointersDetect and remove a loop, with proofLeetCode #142
3Linked List CycleTwo pointersDetect a cycle, then find its startLeetCode #141
4Implement Queue using StacksStack compositionImplement a queue using stacksLeetCode #232
5Two SumHashingEasy array problem solvable with a hashmapLeetCode #1

How to handle a question you have never seen

  1. Restate the problem and ask for constraints before coding.
  2. State the brute-force baseline and its complexity so the interviewer can follow your reasoning.
  3. Name the bottleneck: repeated lookups suggest a hash map, a sequence with a loop suggests two pointers, and independent choices with a target suggest DP or greedy.
  4. Write clean code with edge-case guards first, then trace a small example by hand.
  5. State complexity and one optimisation proactively. One candidate's gap was exactly this step.
  6. If asked to prove a solution, explain the invariant in words before formalising it.

Why candidates were rejected

No recruiter feedback is reported. Two self-reflections are relevant: one candidate solved a coding problem but could not give an optimised approach, and another was not selected after a positive technical round with the reason unknown. Treat these as observations, not as proven causes of rejection.

If you remember only five things

  1. Prepare for 60-minute MCQ-plus-coding assessments with coin-change, arrays and strings, and class design.
  2. Master linked-list cycle detection, including find-the-start and remove-the-loop variants.
  3. Revise OOP and Java HashMap internals deeply, not by definition.
  4. Practise SQL joins and short CS-fundamental answers for technical rounds.
  5. Prepare company and situation answers for HR, and expect a possible easy coding task.

Frequently asked questions (FAQ)

Is this a full-time SDE guide?

No. It covers Software Engineer and SDE summer internships. Five full-time PayPal records were excluded because they are a different role family.

How many rounds does the PayPal intern process have?

The Indian accounts describe three stages after resume screening: an assessment, one technical interview and one HR or managerial round. An older US comment describes a phone interview plus four Skype interviews.

Which platform is used for the assessment?

HackerRank is named in three accounts and PayPal's own interface in one. Two accounts do not name the platform.

Is system design asked in the intern loop?

There is no separate system-design round in these accounts. One OA task asked for a music-player design based on song preferences, and one account was asked to scale a project in a different role family's report, which is not included here.

Most are analogues. A queue using stacks, the linked-list cycle problems and Two Sum match reported prompts closely; the coin-change page is an analogue for the named coin denominations problem.

Why are some OA rows topic-level?

Because the candidates did not record the full statements. The guide says so in the table and does not invent wording.


About this guide and methodology

This guide was compiled by the Codinzhub Editorial Team from six first-hand sources: five candidate write-ups and one archived discussion comment. Full-time SDE, SDE 2, Full Stack Developer and Data Scientist accounts were excluded. No external research URLs, internal record identifiers or private ledgers appear in this article. Practice links are verified analogue or exact-problem pages.

Disclaimer: Hiring processes change over time and vary by campus, team and region. This guide reflects reported historical experiences and is not an official statement from PayPal. Confirm the current format with your recruiter.


Other company and role guides


Search the question bank

The questions from each round above, with practice links for similar problems. Log in to search every question we collected for this role, including questions shared on Codinzhub.

Showing 20 of 74 questions

  • Find the least number of coins to make an amount using pennies, nickels, dimes and quarters.

    Level: Samples: 30 -> 2, 100 -> 4.

    Greedy or coin-change DPCodingOnline assessment
  • Design a music player based on song preferences.

    Level: Not reported.

    Object-oriented designCodingOnline assessment
  • A medium-to-hard coding question on arrays and strings.

    Level: Not reported.

    Arrays and stringsCodingOnline assessment
  • Two medium coding questions; statements not reported.

    Level: Not reported.

    General DSACodingOnline assessment
  • About 20 MCQs on C/C++ input-output, maths, verbal and quantitative aptitude.

    Level: Not reported.

    CS fundamentals and aptitudeCodingOnline assessment
  • MCQs on DBMS, OS, web technology and networks; another account reports aptitude and DSA application MCQs.

    Level: Not reported.

    CS fundamentalsCodingOnline assessment
  • Detect and remove a loop in a linked list; write code on paper, test edge cases and prove it.

    Level: Prove the solution.

    Floyd cycle detectionCodingRound not stated
  • Distinguish between a hash table and a hash map.

    Level: Not reported.

    Hashing conceptsCodingRound not stated
  • Explain how HashMap is implemented in Java.

    Level: 30-minute discussion.

    Java collections internalsCodingRound not stated
  • Explain a single-source shortest path algorithm with an example; no code.

    Level: Not reported.

    Graph algorithmsCodingRound not stated
  • What are threads? Do they share the same address space, and why?

    Level: Not reported.

    Concurrency and OSCodingRound not stated
  • Explain arrays, linked lists, trees and graphs with time complexities and use cases.

    Level: Not reported.

    Data structure fundamentalsCodingRound not stated
  • OOP basics with real-life examples: inheritance, polymorphism, abstraction, encapsulation.

    Level: Real-life examples.

    OOP fundamentalsCodingRound not stated
  • Types of polymorphism and virtual functions / runtime polymorphism.

    Level: Not reported.

    OOP dispatchCodingRound not stated
  • What is abstraction? Can an abstract class be private?

    Level: Not reported.

    Java access modifiersCodingRound not stated
  • Implement a queue using stacks.

    Level: Not reported.

    Stack and queue compositionCodingRound not stated
  • Check a linked list for a cycle, then find the start of the cycle.

    Level: Find the start.

    Floyd cycle detectionCodingRound not stated
  • What is SQL injection?

    Level: Not reported.

    Web and database securityCodingRound not stated
  • Rewrite a query first answered with inner queries using joins.

    Level: Give a different answer with joins.

    SQL joinsCodingRound not stated
  • Give an approach to basic string manipulation and state its time complexity.

    Level: Time complexity.

    Strings and complexityCodingRound not stated
Page 1 of 4

Keep preparing on Codinzhub

Ready for the next topic?

Keep track of what you’ve learned.