How to Crack Paytm: The Software Engineer (SDE 1) Interview, From Real Experiences
Paytm SDE 1 interview guide: reported OA, technical and HR rounds, real coding questions, SQL and Java topics, practice links and an honest coverage check.
On this page
Last reviewed November 19, 2026 · 30 min read · For candidates targeting SDE 1 / new-grad Software Engineer roles in India
Researched and written by the Codinzhub Editorial Team from nine independent sources: three Codinzhub records, five public candidate accounts and one public assessment catalogue. Every question below is a verbatim report or a faithful paraphrase; nothing was invented to fill a round. Hiring formats change by team and year, so confirm your loop with your recruiter.
The 30-second version: In the reviewed SDE 1 accounts, the path usually starts with an online assessment (OA) of two or three coding questions in 60 to 90 minutes; one 2025 campus assessment added two SQL queries. That is followed by one to three technical rounds of roughly 45 to 60 minutes, then a short HR or VP conversation. The technical rounds are not pure LeetCode: they mix DSA with a project deep dive and CS fundamentals, especially SQL, DBMS, Java internals and operating systems. One 2025 account wrote C++ in the interviewer's IDE over Google Meet. The highest-leverage habit: agree on the approach and state the complexity before you write a line, and know your projects well enough to defend their design.
Important things to know before you start
The OA is a multi-problem speed test. The reviewed accounts report two coding questions in 90 minutes (2021 campus), three in 70 minutes (2021 SDE), three in 60 minutes (2024 Software Engineer), and three coding plus two SQL queries (2025 intern+FTE). The constant is time pressure across independent problems, not one hard puzzle.
SQL and Java are part of the technical bar. SQL schema design, joins, indexes and second-highest-salary queries appeared in three accounts. Java HashMap internals, streams, lambdas, garbage collection, multithreading and the Object class appeared in four, including candidates who did not list Java as their primary language.
Your projects are examined, not just listed. Four accounts spend part of a technical round on projects, technology choices, optimisation or scaling. One 2021 account asked the candidate to open a hosted project and explain how it would scale.
The loop length is not fixed. One off-campus account was rejected in its first technical round. Two campus accounts describe two technical rounds. A 2024 Software Engineer account describes three technical rounds plus HR, and a 2026 account describes a third round with Java, resume questions and Kafka. Prepare for the longer shape, but do not assume every loop has it.
You may code in the interviewer's editor. One 2025 campus account used Google Meet with the interviewer's IDE and screen sharing, writing functional C++ and explaining time and space complexity for every solution. Practise writing code without autocomplete and narrating while you type.
What this guide is, and what it is not
Paytm's SDE 1 loop can look inconsistent: two rounds here, four there, an HR call in one account and a VP conversation in another. The reports still show a repeatable core: a timed assessment, one or two DSA-heavy technical rounds with CS fundamentals, and a final conversation about motivation and fit.
This guide is built from nine independent sources covering Paytm Software Engineer, SDE and SDE 1 hiring in India from 2021 to 2026. Three are Codinzhub records, five are public first-hand candidate accounts, and one is a dated public catalogue of assessment items used only for OA examples. It is not a leaked question bank, an official statement, or a pass-rate estimate. Funnel numbers such as "25 selected, then 10, then 5" describe one campus drive, not the company.
Scope: Software Engineer / SDE 1 / new-grad roles in India. The 2025 SDE Intern + FTE campus track is included because it shares the same assessment and interview structure. Senior Software Engineer and SSE/SDE-2 records were reviewed only to describe level differences and are excluded from the question counts.
Selected vs. rejected: do this, not that
These habits come from selected and rejected accounts. No candidate described a flawless interview; the difference was disciplined habits.
| Do this (selected candidates) | Not that (rejected candidates) | Why it matters |
|---|---|---|
| Clarify constraints and state the approach first. | Start typing immediately and discover the edge cases while coding. | Interviewers asked for approach and complexity explicitly. |
| Code in the language you can write cleanly by hand, and say why you chose it. | List Java on your resume and then stall on HashMap internals or threading. | Java was probed in four accounts. |
| Treat SQL as a first-class skill: schema, keys, joins and indexes. | Memorise query syntax only and freeze on "design the tables". | Three accounts asked for schema design, not just a query. |
| Know one project end to end: architecture, your contribution, trade-offs and scaling. | Give a feature list and stall on "how would you scale this?". | Projects were a proxy for ownership. |
| Ship a working baseline, then optimise when asked. | Chase the optimal trick first, get stuck and lose the round. | A baseline proves competence; optimisation proves depth. |
Round-by-round breakdown
The order comes from candidate accounts, not a published official sequence. Campus drives compress the loop; off-campus loops can add a recruiter screen and a third technical round.
Stage 1: Application
Most reviewed candidates entered through a campus drive. A smaller number were contacted by a recruiter, and one applied directly.
| Channel | What candidates reported |
|---|---|
| On-campus drive | The dominant route. BIT Mesra in September 2021, a 2021 SDE drive, and ABES Ghaziabad in March 2025. |
| Recruiter outreach | One Noida SDE 1 candidate was contacted by a recruiter; a 2026 Software Engineer spoke with a recruiter before the DSA screen. |
| Direct application | One 2024 Software Engineer account describes an online application but does not name the portal. |
| Employee referral | Not reported in any in-scope SDE 1 account. |
What helped: a resume with projects you can defend and a clear primary language. The 2021 campus shortlist explicitly valued hands-on web development, machine learning and DSA, with an eligibility bar of CGPA 7.00 and 70% throughout including classes 10 and 12.
Stage 2: Shortlisting
Shortlisting was driven by resume screening and the assessment. No in-scope SDE 1 account describes a separate live phone screen before the OA.
- Resume shortlist: campus eligibility and resume screening decide who receives the test. One 2021 account reports a 25-candidate cut after the OA.
- Recruiter screen: two off-campus accounts describe a conversation about background, projects and the Paytm tech stack before any coding.
- Assessment cutoff: candidates who solved the problems moved to interviews. One 2021 campus account reports 25 after the OA, 10 after the first technical round and 5 at HR.
These are individual campus reports, not company-wide conversion rates.
Stage 3: Online assessment (OA)
How it works. The OA is a timed test with multiple independent problems. Two accounts say HackerRank; the rest do not name the platform. The 2021 BIT Mesra account reports two questions in 90 minutes, the 2021 SDE account three in 70 minutes, the 2024 Software Engineer account three in 60 minutes, and the 2025 intern+FTE account three coding questions plus two SQL queries. Difficulty clusters around medium, with at least one graph-level or hard problem in the mix. The 2024 account calls it an elimination round.
At a glance: 60 to 90 minutes; 2 to 3 coding questions, with one 2025 assessment adding 2 SQL queries; HackerRank where named. Topics: strings, graph traversal, arrays, linked lists, dynamic programming and SQL.
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Practice link |
|---|---|---|---|---|
| Merge two sorted linked lists into one list sorted in decreasing order. | Linked-list merging | Not reported | Role not stated (undated account) | Merge Two Sorted Lists |
| Return every leader in an array: an element greater than everything to its right. | Right-to-left scan | Not reported | Role not stated (undated account) | Leaders in an array |
| Count subarrays containing at least one "bad pair", where x is left of y and x % y = k. | Prefix counting | Not reported | Role not stated (undated account) | No verified practice match |
| Minimum swaps to turn one permutation into another. | Cycle decomposition | Not reported | 2026 assessment catalogue | No verified practice match |
| Customers and products with no recorded sale. | SQL anti-join | Not reported | 2026 assessment catalogue | No verified practice match |
| Inorder traversal of a nine-node binary tree. | Tree traversal | Not reported | 2026 assessment catalogue | Binary Tree Inorder Traversal |
| Top and bottom of the stack before the second multiplication in a postfix scan. | Stack simulation | Not reported | 2026 assessment catalogue | No verified practice match |
Reading the catalogue rows: four OA rows come from a dated public catalogue of Paytm assessment items. They are included because they are concrete and recent, but they carry no candidate narrative. Treat them as pattern practice, not as certain questions for your test.
Paytm OA questions shared on Codinzhub:
| Question | Drive | Topic |
|---|---|---|
| Bank Transactions On Campus | IIT Kharagpur | Simulation, arrays |
| Visiting Cities | IIT (ISM) Dhanbad | Graph traversal |
| Bank Transactions | Not stated | Simulation, arrays |
| SQL: Customers and Products Without Sales | Not stated | SQL joins |
| Paytm Online Assessment Set | BIT Mesra | CS fundamentals, DSA |
| Modify the String | Not stated | Strings |
Full Paytm interview experiences on Codinzhub: SDE 1, DTU (2026), SDE interview experience.
More Codinzhub questions: Browse Paytm questions.
Stage 4: The interview loop
How it works. The first technical round is usually an introduction or resume deep dive, two or three coding questions, and a block of CS fundamentals. The second goes deeper into data structures, Java or DBMS, and sometimes a design discussion. In longer loops, a third round adds harder DSA and a system-design prompt. The final conversation is HR, managerial or with a VP.
Round 1: Technical round 1
How it works. About 60 minutes in the three accounts that give a length. It opens with an introduction or project discussion, then moves to coding. The 2025 campus account used Google Meet, the interviewer's IDE and screen sharing, with functional C++ required. The 2024 account asked for the approach, code and complexity of a next-greater-element problem. The 2021 SDE account spent an hour on two coding questions plus Java and OS theory.
At a glance: about 60 minutes; 2 to 3 coding questions plus theory; Google Meet with the interviewer's IDE in 2025, other platforms not reported. Topics: linked lists, strings, BSTs, arrays, SQL, Java, operating systems and projects.
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Practice link |
|---|---|---|---|---|
| Reverse a linked list first with recursion, then with pointers and no extra data structure. | Linked-list reversal | Recursion stack; O(1)-space version | Intern, 2025 | Reverse Linked List |
| Find the first non-repeating character in a string. | Frequency map | Not reported | Intern, 2025 | First Unique Character in a String |
| Find the lowest common ancestor of two nodes in a BST. | BST ordering | Not reported | Intern, 2025 | LCA of a BST |
| For every element, find the next greater element to its right. | Monotonic stack | Explain time and space complexity | New grad, 2024 | Next Greater Element I |
| Delete a node given a random pointer and no head pointer. | Pointer rewiring | Not reported | New grad, 2021 | No verified practice match |
| Construct a height-balanced BST from a sorted array. | Divide and conquer | Not reported | New grad, 2021 | Convert Sorted Array to BST |
| Find all anagrams of a pattern in a string. | Fixed sliding window | Basic OS questions followed | New grad, 2021 | Find All Anagrams in a String |
| Design user and passport tables, with multiple passports per user, then query them. | SQL schema | MySQL queries on the schema | SDE 1 (1.5 years) | No verified practice match |
| Return the second-highest salary, handling ties and missing rows. | SQL subquery | Not reported | SDE 1 (1.5 years) | Second Highest Salary |
| Count distinct account numbers in a transactions table. | SQL aggregation | Not reported | SDE 1 (1.5 years) | No verified practice match |
| Rotten Oranges: multi-source BFS on a grid. | BFS | Write the code in Java | SDE 1 (1.5 years) | Rotting Oranges |
| Implement binary search over a sorted array. | Binary search | Write the code in Java | SDE 1 (1.5 years) | Binary Search |
| KMP pattern matching, then a version that reports only non-overlapping matches. | String matching | Non-overlapping variant | Role not stated | KMP Algorithm |
| Diagonal traversal of a binary tree. | Tree BFS | Not reported | Role not stated | Diagonal Traversal |
| Pairwise swap linked-list nodes by changing links, not data. | Pointer rewiring | Not reported | New grad, 2025 | Swap Nodes in Pairs |
| Maximum runs a batsman can score in a one-day international with no extras or overthrows. | Constrained arithmetic | Not reported | New grad, 2025 | No verified practice match |
The full list, including Java, OOP and OS theory questions, is in the question bank at the end.
Round 2: Technical round 2
How it works. This round is less uniform. Two accounts give 45 to 60 minutes. It combines one or two coding problems with a deeper Java or DBMS discussion. In the 2025 intern account it covered Kadane, an LRU cache, ACID, indexes, keys, BFS versus DFS and polymorphism. In the 2021 SDE account it was 45 minutes of project discussion, scaling and two coding questions. In the experienced SDE 1 account it covered minimum platforms, HashMap internals, comparator sorting and a broad Java and DBMS theory block.
Some loops add a third technical round. The 2024 Software Engineer account adds longest substring without repeating characters, longest increasing subsequence and a Paytm Wallet design discussion; the 2026 account adds a medium-to-hard tree problem, wallet design and a Java/resume/Kafka round. Those questions are listed here rather than in a separate section because only two accounts report the third round.
At a glance: 45 to 60 minutes; 2 to 3 coding questions plus Java, DBMS or design; video call, platform not reported. Topics: DP, trees, linked lists, heaps, Java internals, SQL, OS and low-level design.
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Practice link |
|---|---|---|---|---|
| A hard-level Tries problem. | Trie | Not reported | New grad, 2021 | Implement Trie |
| Maximum subarray sum with Kadane's algorithm. | Running-sum DP | Not reported | Intern, 2025 | Maximum Subarray |
| Implement an LRU cache with O(1) get and put. | Hash map + linked list | Not reported | Intern, 2025 | LRU Cache |
| Minimum platforms required so that no train waits. | Sorting / sweep line | Not reported | SDE 1 (1.5 years) | Minimum Platforms |
| Explain how HashMap works internally, including Java 8 treeification. | Hashing internals | Load factor; HashMap vs Hashtable | SDE 1 (1.5 years) | No verified practice match |
| Sort students by marks with a custom comparator. | Comparator design | Not reported | SDE 1 (1.5 years) | No verified practice match |
| Detect a linked-list cycle with Floyd's algorithm, then with a hash set. | Two pointers / hashing | Compare O(1) and O(N^2) space | New grad, 2024 | Linked List Cycle II |
| Explain Java 8 streams, lambdas and garbage collection. | Functional Java / memory | Not reported | New grad, 2024 | No verified practice match |
| Check whether a string is a palindrome. | Two pointers | Not reported | New grad, 2021 | Valid Palindrome |
| Convert a number to words. | Recursive grouping | Not reported | New grad, 2021 | Integer to English Words |
| Longest substring without repeating characters. | Variable sliding window | Not reported | New grad, 2024 (third round) | Longest Substring Without Repeating Characters |
| Longest increasing subsequence. | DP / patience sorting | Optimise beyond O(N^2) | New grad, 2024 (third round) | Longest Increasing Subsequence |
| Design a scalable Paytm Wallet service, covering storage, caching and load balancing. | System design | Databases, caching, load balancing | New grad, 2024 and 2026 | No verified practice match |
| Dice throw: count ways to reach a target sum with n dice of m faces. | DP | Not reported | Role not stated | Dice Throw |
| Maximum distinct elements after removing exactly k elements. | Greedy + heap | Not reported | Role not stated | Maximum distinct elements |
| Tower of Hanoi. | Recursion | Not reported | Role not stated | Tower of Hanoi |
| Normalise a table to third normal form. | Functional dependencies | Why the conversion is needed | Role not stated | No verified practice match |
| OS scheduling, starvation, deadlock and semaphores. | Operating systems | Not reported | Role not stated | No verified practice match |
| Design the five-table database for a shopping-cart project. | Schema modelling | Justify attributes and data types | Role not stated | No verified practice match |
Round 3: HR and managerial
How it works. The final conversation is conversational, not a coding test. The 2024 account describes a relaxed discussion of personality, aspirations, culture fit, strengths, weaknesses and pressure. The experienced SDE 1 account describes a short, friendly VP round on work experience, motivation, challenges, favourite project, team conflict, strengths and location. The 2021 campus account says the candidate asked about tech stack, working culture and feedback. One undated account describes a more personal HR conversation about family background and previous interviews.
At a glance: short, conversational; 6 to 10 questions; no coding.
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Practice link |
|---|---|---|---|---|
| Tell me about yourself. | Self-introduction | Not reported | Intern and new grad | No verified practice match |
| Why do you want to join Paytm? | Motivation | Not reported | New grad, 2024 | No verified practice match |
| What are your strengths and weaknesses? | Self-awareness | Not reported | New grad and SDE 1 | No verified practice match |
| How do you handle work under pressure? | Composure | Not reported | New grad, 2024 | No verified practice match |
| Tell me about a team conflict. | Collaboration | Not reported | SDE 1 (1.5 years) | No verified practice match |
| What challenges have you faced so far? | Ownership | Not reported | SDE 1 (1.5 years) | No verified practice match |
| Which project did you like the most, and why? | Project ownership | Not reported | SDE 1 (1.5 years) | No verified practice match |
| Do you have any location constraints? | Logistics | Not reported | SDE 1 (1.5 years) | No verified practice match |
| Why do you want to switch companies? | Motivation | Not reported | SDE 1 (1.5 years) | No verified practice match |
| How would you contribute to the team? | Role fit | Not reported | New grad, 2024 | No verified practice match |
| Do you have any questions for me? | Curiosity | Tech stack, culture, feedback | Intern and new grad | No verified practice match |
| Tell me about your family background and business exposure. | Background | Business strategies | Role not stated | No verified practice match |
| How did the previous interviews go, and what mistakes did you make? | Self-assessment | Probability of selection | Role not stated | No verified practice match |
Stage 5: Decision and offer
How it works. There is no hiring-committee or team-match stage in the reviewed SDE 1 accounts. The decision follows the final conversation or the last technical round.
- Offers: one 2021 campus drive made four offers, and the candidate was one of the four. One experienced SDE 1 candidate was selected after two technical rounds and a VP round.
- Rejections: one off-campus candidate received a rejection email within three hours of the technical round. Another 2026 candidate had "overall feedback positive" but no offer.
- Timing: one 2025 campus assessment declared results after a week and then scheduled the technical interview. No account reports a full application-to-offer duration.
Paytm is a large company with many teams. A payments team, a lending team and a merchant team can run different loops. Treat the campus and off-campus sequences as examples, not a guarantee.
Candidate experiences reviewed
The nine sources span campus and off-campus routes, selected and rejected candidates, and roles titled Software Engineer, SDE, SDE 1 and SDE Intern + FTE. Seven representative entries:
| Background | Role and reported outcome | What was asked |
|---|---|---|
| ABES Ghaziabad · 2025 | SDE Intern + FTE, campus · outcome not reported | 3 coding + 2 SQL in the assessment; linked list, strings, BST, Kadane, LRU, DBMS theory |
| Campus · 2021 | SDE, campus · selected (one of four offers) | 3 coding in 70 minutes; random-pointer deletion, BST from sorted array, Java/OS, palindrome, number to words |
| Not stated · 2024 | Software Engineer · outcome not reported | 3 problems in 60 minutes; NGE, cycle detection, Java 8, longest substring, LIS, wallet design, HR |
| BIT Mesra · 2021 | SDE-1, campus · rejected in round 4 | String and graph OA; anagrams, OS, hard Tries |
| Noida · 1.5 years | SDE 1, Payment Bank · selected | SQL user/passport schema, Rotten Oranges, binary search, minimum platforms, HashMap, Java/DBMS theory, VP round |
| Noida · recruiter | SDE-1 · rejected in round 1 | Cricket puzzle, pairwise linked-list swap, Java object-orientation, Java 8 HashMap internals |
| Noida · 2026 | Software Engineer · no offer | DSA screen, medium-hard tree problem, Paytm Wallet design, Java/resume/Kafka |
The Codinzhub Next-Round Playbook
To get past the online assessment
- Train on three problems in 60 to 90 minutes. Sit one timed set of two medium and one medium-hard problem with no hints. The OA rewards finishing multiple independent tasks.
- Do not skip SQL. One 2025 assessment had two SQL queries alongside three coding problems. Practise schema design, joins,
GROUP BY,COUNT(DISTINCT)and second-highest-salary patterns. - Practise graph traversal and string windows. The 2021 OA included a graph-level question and a string question; later catalogue items include traversal, stack-state and permutation problems.
To get past technical round 1
- Prepare a three-minute project story for every resume bullet: problem, architecture, your contribution, the hardest bug and one change you would make, plus a two-minute scaling answer.
- Revise linked lists, strings, BSTs and monotonic stacks. These supplied most of the first-round coding questions: reverse, delete without head, pairwise swap, anagrams, first non-repeating character, LCA in a BST and next greater element.
- Revise SQL and Java in interview form: primary and foreign keys, joins, indexes, overloading versus overriding, HashMap internals and multithreading.
To get past technical round 2
- Practise DP and design. Kadane, LIS, dice throw, LRU cache and Paytm Wallet design all reward a clear state definition before code.
- Be ready to compare approaches. The 2024 account asked for both Floyd's algorithm and a hash set; the 2021 account asked for recursion and pointer reversal. Name the time and space trade-off.
- Rehearse a 10-minute wallet design. Cover users, wallets, transactions, idempotency, storage, caching, load balancing and what you would monitor. The 2024 and 2026 accounts both describe a wallet prompt.
To get past the HR and managerial round
- Prepare six STAR stories (below) and use "I" for your own contribution.
- Prepare two questions about the team and be direct about location constraints. One VP round asked about them explicitly.
How the loop differs by level
| Level | Typical experience | What the accounts emphasise | System design expectation |
|---|---|---|---|
| SDE Intern + FTE | Current student, 2025 campus | Assessment with 3 coding + 2 SQL; two 1-hour interviews; C++ in the interviewer's IDE. | Not a standalone round; design appears inside coding. |
| SDE 1 / New Grad | 0 to 1 year | OA, one to three technical rounds, then HR; DSA plus SQL, Java and OS. | A wallet or schema design can appear in a later round. |
| SDE 1 with experience | About 1.5 years | Two technical rounds plus a short VP round; deeper resume, Java and DBMS probing. | Project scaling and design discussion, not a full architecture round. |
| SDE 2 / Senior | 3 to 4 years | More system design, monitoring, high-traffic systems and resource calculation. | A substantial part of the loop. |
Campus drives use a resume shortlist, a shared OA and fast technical rounds with a large pool. Off-campus hiring can start with a recruiter call and may add a third technical round. Do not assume the campus sequence applies to an experienced hire.
Most-asked topics
| Topic | What it means in plain English | Evidence-backed priority | Reported examples | Practice |
|---|---|---|---|---|
| Linked lists | Rewiring nodes by changing pointers rather than values. | Very high — 4 of 6 technical accounts | Reverse, delete without head, pairwise swap, Floyd cycle, merge sorted lists | Linked list problems |
| Strings and sliding windows | Scanning a sequence while maintaining a frequency map or window. | Very high — 5 of 6 technical accounts | Anagrams, first non-repeating character, longest substring, palindrome, KMP | Sliding window |
| Trees and BSTs | Recursing over parent-child structures and using ordering invariants. | High — 4 of 6 technical accounts | LCA in BST, BST from sorted array, diagonal traversal, Tries | Tree problems |
| Dynamic programming | Defining a state and reusing overlapping subproblems. | High — 3 of 6 technical accounts | Kadane, LIS, dice throw, number to words | DP problems |
| SQL and DBMS | Modelling tables, writing queries and reasoning about indexes and normal forms. | Very high — 3 of 6 technical accounts | User/passport schema, second salary, joins, ACID, 3NF, clustered indexes | No direct practice link |
| Java and OOP | Language internals and object-oriented design. | Very high — 4 of 6 technical accounts | HashMap, Java 8 streams, GC, multithreading, overloading, polymorphism | No direct practice link |
| Operating systems | Processes, threads, scheduling and synchronisation. | Medium — 2 of 6 technical accounts | Synchronisation, scheduling, starvation, deadlock, semaphores | No direct practice link |
| System design and projects | Explaining how your work scales and how a wallet service is put together. | High — 4 of 6 technical accounts | Paytm Wallet, caching, load balancing, shopping-cart schema | No direct practice link |
The question patterns that keep coming back
1. Linked-list pointer surgery
- How to recognise it: a list, one or two pointers, and a constraint such as "without the head", "swap nodes, not data" or "O(1) space".
- The invariant: draw the nodes and the links before and after the operation. Name the three pointers you will keep. Handle the empty list, one node and the tail.
- Reported examples: reverse a linked list, delete a node with a random pointer and no head, pairwise swap, Floyd cycle detection, merge two sorted lists into decreasing order.
- Preparation action: write the reverse function both iteratively and recursively, then trace a three-node list by hand.
2. String scanning with a window or frequency map
- How to recognise it: "first non-repeating", "all anagrams", "longest substring without repeats" or "pattern matching".
- The invariant: for a fixed window, keep a 26-slot or hash-map count and update it on entry and exit. For a variable window, move the left edge while the condition is violated.
- Reported examples: anagrams, first unique character, longest substring without repeating characters, palindrome, KMP and the non-overlapping variant.
- Preparation action: state whether the window is fixed or variable before writing the loop, then test an empty string and a one-character string.
3. Array scans and prefix aggregation
- How to recognise it: "count subarrays", "maximum sum", "leaders", "minimum platforms" or "maximum distinct after removals".
- The invariant: decide whether you need a running sum, a suffix maximum, a sorted sweep or a frequency map. For "at least one bad pair", count the complement.
- Reported examples: leaders in an array, bad-pair subarrays, Kadane, minimum platforms, maximum distinct elements after k removals.
- Preparation action: write the brute force, then the O(N^2) or O(N^2) version, and say what changed.
4. Tree and BST invariants
- How to recognise it: a binary tree, a BST, a traversal order or a prefix structure.
- The invariant: for a BST, the answer is the first node whose value lies between the two targets. For a balanced BST from a sorted array, the midpoint is the root. For a trie, each node owns a map of children and an end flag.
- Reported examples: LCA in a BST, BST from sorted array, diagonal traversal, a hard Tries problem, inorder traversal of a nine-node tree.
- Preparation action: write the recursive contract in one sentence before coding: "this function returns the LCA of p and q in this subtree, or the node if only one is present."
5. Dynamic programming state design
- How to recognise it: "maximum sum", "number of ways", "longest subsequence" or "minimum cost".
- The invariant: define the state, transition and base case in words. Kadane keeps the best sum ending here; LIS keeps the best length ending at i; dice throw keeps the count for n dice and a target.
- Reported examples: Kadane, LIS, dice throw, number to words, maximum distinct elements after removals.
- Preparation action: write the recurrence before the code and test n = 0, n = 1 and a target that is impossible.
6. SQL schema and query reasoning
- How to recognise it: "design the tables", "write the query", "which index" or "normalise this".
- The invariant: identify entities, keys and cardinality first. Then write the query from the join outward. For indexes, ask which column is used in filtering or joining and how selective it is.
- Reported examples: user/passport one-to-many schema, second-highest salary, distinct accounts, joins, ACID, clustered versus non-clustered indexes, 3NF, shopping-cart schema.
- Preparation action: practise drawing a schema with keys before writing any SQL, and say the cardinality out loud.
7. Java and OOP internals
- How to recognise it: the interviewer sees Java on your resume and moves from syntax to "how does it work inside?".
- The invariant: connect each answer to a data structure or a trade-off. HashMap is an array of buckets with chaining and treeification; GC is reachability; overloading is compile-time, overriding is run-time.
- Reported examples: HashMap internals and Java 8 changes, streams and lambdas, garbage collection, multithreading, the Object class, overloading versus overriding, polymorphism.
- Preparation action: prepare a two-minute answer for each item and one project example for each.
Preparing for the HR and managerial round
The final conversation is scored on motivation, self-awareness, ownership and fit. The accounts are consistent about the themes even when the round is called HR, managerial or VP.
Core themes: why Paytm, why this role, what you have built, how you handle pressure and conflict, what you want to learn, and whether you can work from the office.
The six STAR stories to prepare
Use STAR: Situation, Task, Action, Result.
| # | Story prompt | Focus area |
|---|---|---|
| 1 | A time you disagreed with a teammate's technical proposal. | Conflict resolution |
| 2 | A time you received difficult constructive feedback. | Coachability |
| 3 | A project you owned that failed or missed a deadline. | Ownership |
| 4 | A feature you built with ambiguous requirements. | Autonomy |
| 5 | A time you helped a teammate succeed. | Team-first mentality |
| 6 | A speed-versus-quality trade-off you made. | Engineering maturity |
Practice problems that match these experiences
Note on practice analogues: These problems share the algorithmic invariants in the candidate accounts. Unless marked "Exact reported problem", they are practice analogues, not leaked exam questions.
| # | Practice problem | Pattern | Seen in these experiences as | Link |
|---|---|---|---|---|
| 1 | Reverse Linked List | Linked-list reversal | Reverse a list recursively and with pointers | LeetCode #206 |
| 2 | LRU Cache | Hash map + doubly linked list | Implement an LRU cache in a technical round | LeetCode #146 |
| 3 | Rotting Oranges | Multi-source BFS | Rotten Oranges in the first technical round | LeetCode #994 |
| 4 | Maximum Subarray | Kadane's algorithm | Kadane in the second technical round | LeetCode #53 |
| 5 | Longest Substring Without Repeating Characters | Variable sliding window | A third-round coding question in 2024 | LeetCode #3 |
| 6 | Longest Increasing Subsequence | DP / patience sorting | A third-round coding question in 2024 | LeetCode #300 |
| 7 | Lowest Common Ancestor of a BST | BST ordering | LCA in a BST in the 2025 intern round | LeetCode #235 |
| 8 | Convert Sorted Array to BST | Divide and conquer | BST construction in the 2021 SDE round | LeetCode #108 |
| 9 | Next Greater Element I | Monotonic stack | Next greater element in the 2024 round | LeetCode #496 |
| 10 | Second Highest Salary | SQL subquery | Second maximum salary in the SDE 1 round | LeetCode #176 |
How to handle a question you have never seen
- Repeat and clarify (0–3 minutes). Rephrase the problem. Ask about empty inputs, negatives, duplicates, sortedness and the maximum input size. If N is up to 10^5, rule out O(N^2) early.
- State the brute-force baseline (3–5 minutes). Never sit in silence. Describe the naive solution and its complexity: "Checking every pair would take O(N^2) time and O(1) extra space."
- Name the bottleneck (5–8 minutes). Repeated lookups suggest a hash map; repeated min/max extraction suggests a heap; recalculated ranges suggest prefix sums or a sliding window; dependency order suggests topological sort.
- Code in clean, modular steps (8–25 minutes). Talk while you type. Use meaningful names, state invariants in comments and write edge-case guards first.
- Dry-run line by line (25–30 minutes). Pick a three-element or 2x2 example and trace every variable on screen. If you catch a bug, say so calmly and fix it.
- State final complexity proactively (30–32 minutes). Give time and space complexity and name the trade-off: "This uses O(N^2) extra space for the map; sorting would use O(1) space at the cost of O(N^2) time."
Why candidates were rejected
No in-scope account includes formal recruiter rejection feedback, so this section is editorial synthesis plus three candidates' self-reflection. Treat it as preparation advice, not a claim about why any specific person was rejected.
- A hard data-structure question exposed a gap. One 2021 campus candidate was rejected in the second technical round after struggling with a hard Tries problem. Advanced tries are worth practising even for new-grad roles.
- Java was on the resume but not in the candidate's depth. One off-campus candidate was rejected in the first technical round on a loop that probed Java threading and HashMap internals.
- The project was not defensible. Four accounts spend time on projects, architecture and scaling. A shallow project story is a visible weakness.
- The loop was longer than expected. One 2024 account has three technical rounds, including wallet design. Candidates who prepare only for two rounds can run out of depth in the third.
- Positive feedback is not an offer. One 2026 candidate reports positive overall feedback but no offer. Treat every round as scored.
If you remember only five things
- Train for three problems in 60 to 90 minutes, and include SQL in the set.
- Practise linked lists, strings, BSTs and DP, because those supplied most of the coding questions.
- Revise SQL and Java internals alongside DSA; they appear inside technical rounds, not only in HR.
- Prepare your projects like a technical subject: architecture, contribution, trade-offs and scaling.
- Rehearse a 10-minute wallet design and six STAR stories for the later rounds.
Frequently asked questions (FAQ)
Is there always an online assessment?
In the reviewed campus accounts, yes: the OA is the first filter. The off-campus accounts also describe a coding screen. The format varies from two to three coding questions, and one 2025 assessment added two SQL queries.
How many rounds does the Paytm SDE 1 process have?
The accounts disagree. One off-campus loop ended after one technical round. Two campus loops had two technical rounds. A 2024 Software Engineer loop had three technical rounds plus HR, and a 2026 loop had a DSA screen, a tree-plus-wallet round and a Java/Kafka round.
Which programming language should I use?
No Paytm-specific restriction appears in the reviewed accounts. One 2025 account wrote C++ in the interviewer's IDE; another wrote Java because the interviewer asked for it. Choose the language you write fastest and explain most clearly, but be ready for Java-specific questions if Java is on your resume.
Is system design asked for SDE 1?
Not as a standalone architecture round in most accounts. It appears as a Paytm Wallet design prompt in a third technical round, a project-scaling discussion, or a schema-design question. Prepare low-level design and a simple wallet design, not a full distributed-systems deep dive.
Will the interviewer give hints if I get stuck?
In several accounts the interviewer intervened with a hint or a direction change, especially on optimisation. The 2025 intern account describes a discussion of optimisation strategies after the first solution. Keep talking so the interviewer has something to redirect.
Are the questions in this guide exact leaks?
No. They are verbatim reports or faithful paraphrases. Practice links are analogues unless marked "Exact reported problem". Use the guide to recognise patterns, not to memorise answers.
About this guide and methodology
This guide was researched, compiled and audited by the Codinzhub Editorial Team. It synthesises nine independent sources: three Codinzhub records, five public candidate write-ups and one dated public catalogue of Paytm assessment items. The sources cover Paytm Software Engineer, SDE, SDE 1 and SDE Intern + FTE hiring in India from 2021 to 2026.
All reported questions are verbatim accounts or faithful paraphrases. Practice mappings connect to LeetCode and GeeksforGeeks and are labelled exact or similar. No external research URLs, internal record identifiers or private source ledgers appear in this article; those are kept in the private research notes.
Disclaimer: Hiring policies, rubrics and interview structures change over time. This guide reflects reported historical experiences and is not an official statement from Paytm. Confirm the current stage format, platform and tooling with your recruiter.
Other company and role guides
- Zomato SDE 1 interview guide
- Navi software engineer interview guide
- Juspay software engineer interview guide
- Amazon software engineer interview guide
- Flipkart software engineer interview guide
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 130 questions
Bank Transactions On Campus
A Paytm online assessment question shared on Codinzhub (IIT Kharagpur).
Visiting Cities
A Paytm online assessment question shared on Codinzhub (IIT (ISM) Dhanbad).
Bank Transactions
A Paytm online assessment question shared on Codinzhub (Not stated).
SQL: Customers and Products Without Sales
A Paytm online assessment question shared on Codinzhub (Not stated).
Paytm Online Assessment Set
A Paytm online assessment question shared on Codinzhub (BIT Mesra).
Modify the String
A Paytm online assessment question shared on Codinzhub (Not stated).
Merge two sorted linked lists into one list sorted in decreasing order.
Level: Not reported.
Return every leader in an array: an element greater than everything to its right.
Level: Not reported.
Count subarrays containing at least one "bad pair", where x is left of y and x % y = k.
Level: Not reported.
Minimum swaps to turn one permutation into another.
Level: Not reported.
Customers and products with no recorded sale.
Level: Not reported.
Inorder traversal of a nine-node binary tree.
Level: Not reported.
Top and bottom of the stack before the second multiplication in a postfix scan.
Level: Not reported.
Reverse a linked list first with recursion, then with pointers and no extra data structure.
Level: Recursion stack; O(1)-space version.
Find the first non-repeating character in a string.
Level: Not reported.
Find the lowest common ancestor of two nodes in a BST.
Level: Not reported.
For every element, find the next greater element to its right.
Level: Explain time and space complexity.
Delete a node given a random pointer and no head pointer.
Level: Not reported.
Construct a height-balanced BST from a sorted array.
Level: Not reported.
Find all anagrams of a pattern in a string.
Level: Basic OS questions followed.
Keep preparing on Codinzhub
- Paytm interview questions and experiences — OA questions and interview experiences candidates shared for Paytm.
- Browse Paytm online assessment questions — filter the Codinzhub question bank by company.
- InMobi SDE 1 interview guide — the InMobi process, rounds and question patterns.
- Amazon Software Engineer interview guide — the Amazon process, rounds and question patterns.
- Google Software Engineer interview guide — the Google process, rounds and question patterns.
- All company interview guides — every guide on the Codinzhub blog.
Keep track of what you’ve learned.