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 NatWest: The SDE interview, from real experiences

16 min read

NatWest (NatWest Group) SDE interview guide for India campus hiring: the online assessment, SQL and behavioural MCQs, and the technical interview, with real reported questions.

In this article
On this page

Last reviewed November 17, 2026.

For students interviewing for SDE (also called Software Engineer or SDE-1) at NatWest Group on Indian campuses.

Built by the Codinzhub team from NatWest online assessment papers and interview experiences that students shared on Codinzhub between July and November 2026, from campuses including IIT Roorkee, IIT (BHU) Varanasi, IIT Kharagpur, IIT Bombay, IIT Guwahati, NSUT and VIT Vellore. Each report is one person's memory of their own paper or interview. Use this guide as a map, not a promise.

The 30-second version. NatWest Group (formerly Royal Bank of Scotland) hires campus SDEs through an online assessment with 2 DSA coding questions, followed by SQL MCQs (usually around 12), a short aptitude/reasoning MCQ block (around 8 to 10 questions), and a long behavioural MCQ survey (sometimes close to 100 questions, with no time limit). Shortlisted students then take one technical interview round, often with two interviewers, that mixes a deep resume and project discussion, core CS fundamentals (OS, DBMS, OOP), one or two coding problems, and sometimes a system design question like a URL shortener. The coding is mostly medium-difficulty DSA (DP, graphs, arrays, strings), and interviewers said the result "depends a lot on your luck and the interviewer."

Important things to know before the interview

The OA has four very different sections. Students consistently reported 2 DSA coding questions, about 12 SQL MCQs, about 8 to 10 aptitude/reasoning MCQs, and a large behavioural assessment (one report said 90 to 100 questions) with no time limit. Budget your time across sections instead of treating it as one test.

The behavioural section is real and untimed, but still matters. Several 2026 reports list it as its own stage with "no time limit," distinct from the timed coding and SQL sections. Answer it honestly and consistently; do not rush it just because it has no clock.

One technical interview round can cover almost everything. A 2026 NSUT report described a single round with two interviewers covering resume, SQL/DBMS basics and "GFG puzzles" in about 30 minutes. A later on-campus report described one round covering DSA, OS, OOP and system design together. Prepare as if one round could be the entire interview stage.

Know your resume and internships in real depth. Multiple reports said the interview opened with "in-depth resume discussion" and follow-up questions on every project and internship for the first 30 minutes. This is not a formality; it sets the tone for the rest of the round.

The DSA pattern is a repeating one: sort/arrange around a split point K, and scheduling or resource problems. Variants of "arrange the first K elements one way, the rest another way" and "maximize points subject to a constraint from the previous day" appeared at more than one campus.

What this guide covers

This guide covers the SDE / Software Engineer / SDE-1 full-time and intern hiring process at NatWest Group, mostly from India campus drives in 2026 (IIT Roorkee, IIT (BHU) Varanasi, IIT Kharagpur, IIT Bombay, IIT Guwahati, NSUT, VIT Vellore). You will learn the OA structure, real reported questions for each part, and what the interview covers.

These are individual experiences, and NatWest's process can vary by campus and batch. Confirm the current format with your placement cell.

Round-by-round breakdown

Stage 1: Application, where candidates applied

How it works. Every report in this guide came from an on-campus placement drive. Colleges in these reports include IIT Roorkee, IIT (BHU) Varanasi, IIT Kharagpur, IIT Bombay, IIT Guwahati, NSUT and VIT Vellore, across September to November 2026.

Stage 2: Shortlisting, how candidates moved forward

How it works. Not reported in detail. Students describe moving directly from the placement drive registration into the online assessment.

Stage 3: Online assessment (OA)

How it works. The OA has four distinct parts in most 2026 reports: 2 DSA coding questions, roughly 12 SQL MCQs, roughly 8 to 10 aptitude and reasoning MCQs, and a large, untimed behavioural assessment. A few earlier 2026 reports (NSUT, September) show only DSA plus SQL MCQs without a separate aptitude block, so the exact section list may still be settling.

At a glance

  • Duration: DSA section about 60 minutes; SQL MCQs about 15 minutes; aptitude about 12 minutes; behavioural assessment untimed
  • Questions per round: 2 coding, about 12 SQL MCQs, about 8 aptitude MCQs, up to about 100 behavioural questions
  • Topics: arrays, strings, DP, graphs, scheduling/OS concepts (SJF, FIFO cache, page faults), SQL joins and transactions, verbal reasoning
  • Reported examples: FIFO cache misses, round-robin and SJF CPU scheduling, "arrange first K ascending, rest descending"

Reported questions: DSA

Question summarySkill or patternReported follow-upLevel / scopeCodinzhub question or experience
Sort the first K elements ascending, and the remaining elements descending.Sorting, two segmentsNot reportedOA, IIT BHU, 2026Sort First K Elements · Arranging Sequence
Find the minimum number of gas stations to stop at, given a limited amount each station can sell, to reach a destination.Greedy (gas station pattern)Not reportedOA, IIT BHU, 2026Mr. Henrys Gas Station Problem
Given soldiers in a line and a series of range-reversal operations, find the original ID of the soldier at a given final position.Simulation / reverse mappingNot reportedOA, NSUT, 2026Natwest OA, NSUT
Given each customer's shopping bag of product IDs (with possible duplicates), find products purchased by every customer at least once.Set intersection across listsNot reportedOA, NSUT, 2026Natwest OA, NSUT
Count how many times a digit (needle) occurs within the digits of a number (haystack).Digit countingNot reportedOA, VIT Vellore, 2026Natwest OA, VIT Vellore
Schedule processes with Non-Preemptive Shortest Job First (SJF) and compute average waiting time.CPU scheduling simulationNot reportedOA, VIT Vellore, 2026Natwest OA, VIT Vellore
Count pairs (i, j) with i < j where the absolute difference equals K.Hashing / two pointersNot reportedIntern, IIT Roorkee, 2026Count Pairs with Difference K
Remove all vowels from a string.String filteringNot reportedSDE, IIT BHU, 2026Return the String Without Vowels · Houses Without Vowels
Compute the area of intersection of two circles given their centres and radii.GeometryNot reportedSDE, IIT BHU, 2026Area of intersection of two circles
Print all prime numbers up to N.Sieve of EratosthenesNot reportedSDE, IIT BHU and IIT Roorkee, 2026Find Prime Numbers Till N · NatWest SDE OA, IIT Roorkee
Find the most frequently purchased product tags across customers, breaking ties lexicographically.Hashing, frequency countingNot reportedSDE, IIT BHU, 2026Most Frequently Purchased Item Tags
Count elements that appear in one list but not in the other, counted by position.Hashing / set differenceNot reportedSDE, IIT Roorkee, 2026Count of Elements
FIFO cache: count cache misses given a capacity and a sequence of key accesses.Queue simulationNot reportedSDE, IIT BHU, 2026FIFO Cache – Count Cache Misses
Minimum operations to make every array element non-positive, where one operation reduces one chosen element by P and every other element by Q.Binary search on answer, or greedy simulationNot reportedSDE, IIT BHU, 2026Minimum Operations to Make All Elements Non-Positive
Maximize total points over N days; a hard task is only allowed the day after a skip.DP with stateNot reportedSDE, IIT BHU, Kharagpur and Roorkee, 2026Maximum Task Points · NatWest SDE OA
Rearrange an integer's digits to form the smallest permutation, keeping the sign, with no leading zero.Greedy, digit sortingNot reportedSDE, IIT Guwahati, 2026Smallest Permutation of an Integer
Find the largest odd-sized palindromic square submatrix in a grid.2D arrays, palindrome checkNot reportedSDE, IIT Guwahati, 2026Largest Odd-Sized Palindromic Square Submatrix
Check whether one lowercase string is a right (circular) rotation of another.String rotation checkNot reportedSDE, IIT Kharagpur, 2026Right Rotation Check
Given each person's next invite, find the largest connected component in the resulting directed graph.Graph traversalNot reportedSDE, IIT Kharagpur, 2026Maximum Number of People at the Party
Find the maximum number of employees who can sit at a round table, each next to their favourite person.Graph cycles (functional graph)Not reportedSDE-1, IIT Kharagpur, 2026Maximum Employees to Be Invited to a Meeting
Given two arrays, count indices from each present in the other.HashingNot reportedSDE-1, IIT Kharagpur, 2026Find Common Elements Between Two Arrays
Transform an 8-element binary array over K days, where each element becomes 0 if both neighbours match, else 1.Cellular automaton simulationNot reportedSDE, IIT Bombay, 2026Binary Array Transformation
Maximise profit loading crates under both a space limit and a weight limit (two-constraint knapsack), across T test cases.2D knapsack DPNot reportedFTE, IIT Roorkee, 2026Maximum Profit (cargo drone)
Minimum number of refuelling stops, with unlimited tank capacity, to reach a destination.Greedy with a max-heapNot reportedFTE, IIT Roorkee, 2026Minimum Number of Refueling Stops

Reported questions: SQL and reasoning

Question summarySkill or patternLevel / scopeCodinzhub question or experience
Which command makes newly inserted rows permanent after a transaction?Transactions, DCLOA, IIT Roorkee, 2026SQL, Logical Reasoning MCQs
Determine the result of an UPDATE query using a subquery against another table.SQL UPDATE + subqueryOA, IIT Roorkee, 2026SQL, Logical Reasoning MCQs
Which query produces a Cartesian product of two tables?JOIN basicsOA, group assessment, 2026Technical SQL MCQs
Vocabulary and grammar MCQs (fill-in-the-blank, synonym, antonym).Verbal reasoningOA, group assessment, 2026Reading Comprehension / Grammar MCQs
Employee training schedule logic puzzle.Logical reasoningOA, IIT Roorkee, 2026SQL, Logical Reasoning MCQs

More questions. Full OA papers are on Codinzhub: Reasoning and Aptitude, Finding numbers greater than K, SQL, IIT Kharagpur.

Stage 4: Technical interview

How it works. Reports describe one technical round, sometimes with two interviewers, that moves through several topics in sequence. It opens with an in-depth resume and project discussion (about 30 minutes in one report), then core CS subjects, then one or two coding problems, and in the more recent reports, a system design question. One candidate summarised the round as testing "both theoretical knowledge and practical problem-solving," with the interviewer focused on reasoning and complexity analysis, not just a final answer.

At a glance

  • Duration: not precisely reported; implied to be roughly an hour given the topic range
  • Questions per round: 1 to 2 coding problems, several core-CS questions, 1 design question in some reports
  • Topics: resume/projects, SQL/DBMS basics, OS (process vs thread, deadlocks, race conditions, virtual memory), OOP, system design
  • Reported examples: LRU cache, maximum subarray sum (Kadane's algorithm), design a URL shortener

Reported questions

Question summarySkill or patternReported follow-upLevel / scopeCodinzhub question or experience
In-depth resume and internship discussion; be ready to answer follow-ups for about 30 minutes.Resume depthSQL/DBMS basics: DCL, DML, deadlock, ACIDSDE 1, NSUT, 2026NSUT interview experience
A few GFG-style puzzle questions.General problem solvingNot reportedSDE 1, NSUT, 2026NSUT interview experience
Design an LRU cache with O(1) get and put; explain the hash map + doubly linked list design.Data structure design"Why a hash map and doubly linked list"SDE, on-campus, 2026On-campus interview experience
Find the maximum sum of a contiguous subarray (Kadane's algorithm).DP, arraysExplain the algorithm and its time complexitySDE, on-campus, 2026On-campus interview experience
Difference between a process and a thread.Operating systemsNot reportedSDE, on-campus, 2026On-campus interview experience
What are the four necessary conditions for a deadlock? How can deadlocks be prevented?Operating systemsNot reportedSDE, on-campus, 2026On-campus interview experience
What is a race condition, and how do mutexes and semaphores help prevent it?Operating systems, concurrencyNot reportedSDE, on-campus, 2026On-campus interview experience
Explain virtual memory and page faults.Operating systemsNot reportedSDE, on-campus, 2026On-campus interview experience
Explain the four pillars of OOP with real-world examples.OOPNot reportedSDE, on-campus, 2026On-campus interview experience
Difference between function overloading and function overriding.OOPNot reportedSDE, on-campus, 2026On-campus interview experience
Shallow copy vs deep copy in C++; virtual functions and why a virtual destructor matters; the diamond problem with multiple inheritance.C++ / OOPNot reportedSDE, on-campus, 2026On-campus interview experience
Design a URL shortener like Bitly.System designAPI design, database schema, unique short-code generation, collision handling, Redis caching, scalingSDE, on-campus, 2026On-campus interview experience
A Dijkstra's-algorithm variation to find the maximum distance from a given node.Graphs, shortest pathsNot reportedNatWest SDE, 2026Natwest SDE interview experience
A flights-with-at-most-K-stops style problem.Graphs, modified shortest path with a stop limitNot reportedNatWest SDE, 2026Natwest SDE interview experience
Implement OS-style locks in C++.Concurrency, C++Not reportedNatWest SDE, 2026Natwest SDE interview experience

NatWest experiences shared on Codinzhub

CollegeRole and resultWhat was askedExperience
NSUTSDE 1, result not reportedResume discussion; SQL/DBMS easy questions; GFG puzzles; 1 combined HR+technical roundRead it
On-campus (college not stated)SDE, selectedLRU cache; Kadane's algorithm; OS (process/thread, deadlock, race condition, virtual memory); OOP; system design (URL shortener)Read it
Not statedNatWest SDE, result not reportedDijkstra variation for max distance; flights-with-K-stops; OS locks in C++Read it

The Codinzhub next-round playbook

To prepare for the OA

  • Time-box the sections: budget about 25 to 30 minutes per DSA question, then move briskly through the SQL and aptitude MCQs so you have time left for the long behavioural section.
  • Revise OS scheduling algorithms (SJF, round robin) and cache/page-replacement policies (FIFO), since several OA questions are direct simulations of these algorithms.
  • Practise "split at K" array problems: sort or arrange the first K elements one way and the rest another way.
  • Practise basic greedy problems with a heap (minimum refuelling stops) and 2D/multi-constraint DP (profit under two limits).
  • For SQL MCQs, revise transaction commands (COMMIT, ROLLBACK), JOIN types, and subquery-based UPDATE statements.
  • Answer the behavioural section honestly and consistently; it is untimed, so there is no reason to rush it.

To prepare for the technical interview

  • Prepare a 2-minute walkthrough of every project and internship on your resume, and expect 30 minutes of follow-up questions on them alone.
  • Revise OS fundamentals in depth: process vs thread, the four deadlock conditions and prevention, race conditions, mutexes vs semaphores, virtual memory and page faults.
  • Revise OOP fundamentals: the four pillars, overloading vs overriding, shallow vs deep copy, virtual functions and destructors, and the diamond problem.
  • Practise explaining your coding solution's time and space complexity out loud, since interviewers focus on reasoning, not just the final answer.
  • Prepare a basic system design walkthrough (like a URL shortener): API design, database schema, unique ID generation, caching with Redis, and how it scales.

Variations within this role

VariationWhat was reported
Section order and countEarlier 2026 reports (NSUT, September) show only DSA and SQL MCQs. Later reports (October onward) consistently add aptitude and a large untimed behavioural section.
Intern vs FTEThe IIT Roorkee intern report and the general SDE/FTE reports follow the same OA shape; no distinct process was reported for interns beyond the same question types.
Number of interview roundsMost reports describe exactly one technical round, though it can cover resume, core CS, coding, and system design all in that single round.

Do's and don'ts

DoDon'tWhy it matters
Revise OS scheduling and caching algorithms by hand.Assume the OA is "just DSA".FIFO cache misses, SJF scheduling and page faults are direct OA questions, not analogies.
Know every project on your resume in depth.Give a surface-level project summary.Interviewers spent about 30 minutes on resume follow-ups in more than one report.
Explain your algorithm's complexity out loud as you code.Jump straight to code without reasoning aloud.The interviewer explicitly valued "the reasoning behind my approaches."
Finish both DSA questions within the 60-minute budget before the untimed section.Spend too long perfecting one DSA question and rush SQL/aptitude.The sections are separate; running out of time on one does not extend another.
Prepare one clear system design walkthrough end to end.Only memorise disconnected buzzwords (Redis, load balancer).The URL shortener question asked for a coherent design: schema, collision handling, and scaling together.

Most-asked topics

Frequency below is based on 3 Codinzhub interview experiences and about 28 Codinzhub OA question records for this role. We do not give percentages.

TopicWhat it meansEvidence-backed priorityReported examplesCodinzhub practice
Arrays and stringsCore array/string manipulation and scanningHigh in the OA (most frequent single category)K-split sorting, vowel removal, digit countingSort First K Elements
OS fundamentalsScheduling, concurrency, memory managementHigh in both OA and interviewSJF, FIFO cache, deadlocks, virtual memoryFIFO Cache – Count Cache Misses
SQLJoins, transactions, subqueriesHigh in the OA (every report had an SQL MCQ section)COMMIT/ROLLBACK, UPDATE with subquerySQL, Logical Reasoning MCQs
Greedy and DPChoosing locally optimal steps, or optimising over statesMedium-high in the OARefuelling stops, 2-constraint knapsack, task-points DPMaximum Profit
GraphsTraversal, cycles, shortest pathsMedium, growing in later 2026 reportsFunctional graph cycles, Dijkstra variants, K-stop flightsMaximum Employees to Be Invited to a Meeting
OOPClasses, inheritance, copy semanticsMedium in interviewsFour pillars, diamond problem, shallow vs deep copyOn-campus interview experience
System designDesigning a full system end to endMedium, mostly in later interviewsURL shortenerOn-campus interview experience

The question patterns that keep coming back

Split the array at K and treat each half differently

How it appears. Sort or arrange the first K elements one way, the rest another way. Seen at IIT BHU in two separate reports.

What to recognise. These are two independent sorts (or orderings) stitched together; solve each half on its own, then concatenate.

Practise. Sort First K Elements, then Arranging Sequence.

Scheduling and cache simulations from OS

How it appears. SJF scheduling, FIFO cache misses, page faults: each is a direct simulation of a textbook OS algorithm, not a disguised algorithm problem.

What to recognise. Implement the algorithm exactly as taught (queue for FIFO, sort by burst time for SJF); there is no clever shortcut to find.

Practise. FIFO Cache – Count Cache Misses, then Natwest OA, VIT Vellore (SJF).

"Maximize over N days with a constraint tied to the previous day"

How it appears. A hard task is only allowed if the previous day was skipped; maximise total points. Reported at three different campuses.

What to recognise. This is a DP where the state includes whether the previous day's task was "skipped" or not; transition on that single bit.

Practise. Maximum Task Points.

Functional graphs from "each person points to one other person"

How it appears. Each array index points to exactly one other index (favourite person, next invite); find cycles or the largest connected component.

What to recognise. This is a directed graph where every node has out-degree 1, so it decomposes into cycles with trees hanging off them. Find cycles first.

Practise. Maximum Number of People at the Party, then Maximum Employees to Be Invited to a Meeting.

Preparing for the behavioural and HR aspects

The behavioural MCQ block in the OA is untimed and was reported to have as many as 90 to 100 questions; answer consistently and honestly rather than trying to guess a "correct" personality profile, since no report described a passing threshold or scoring rule for it. In the interview itself, be ready to discuss your resume and internships for a sustained 30-minute stretch, with specific follow-up questions on your exact contribution to each project.

Practice problems that match the experiences

These are practice analogues: similar problems for practice, not proof that NatWest asked the exact LeetCode problem, unless the row says the same name was reported.

#Practice problemPatternRelated reported question or variant
1LRU Cache (LeetCode)Hash map + doubly linked listSame problem name reported in the on-campus interview
2Maximum Subarray (LeetCode)Kadane's algorithmSame problem reported in the on-campus interview
3Gas Station (LeetCode)GreedyMr. Henrys Gas Station Problem
4Design Circular Queue (LeetCode)Queue simulationFIFO Cache – Count Cache Misses
5Partition Array Into Two Arrays to Minimize Sum Difference (LeetCode: DP practice)DP with stateMaximum Task Points (easy/hard task DP)
6Maximum Number of Invitations (LeetCode: Maximum Employees to Be Invited to a Meeting)Functional graph cyclesSame problem name reported
7Minimum Number of Refueling Stops (LeetCode)Greedy with a max-heapSame problem name reported
8Network Delay Time (LeetCode)Dijkstra's algorithmDijkstra variation, max distance from a node
9Cheapest Flights Within K Stops (LeetCode)Modified shortest pathFlights with at most K stops
10Count Primes (LeetCode)Sieve of EratosthenesFind Prime Numbers Till N

How to handle a question you have never seen

  1. Restate the problem and check the input limits to judge the needed time complexity.
  2. Identify whether it is really a known algorithm pattern (scheduling, caching, graph cycles, knapsack) hiding behind a story.
  3. Write the brute-force approach first, then look for the slow step.
  4. For OS-flavoured simulation questions, implement the textbook algorithm exactly; do not try to optimise a correctness rule you have not confirmed.
  5. Test with the smallest possible example by hand before coding.
  6. Dry-run your code against the given sample, then an edge case such as an empty array or K equal to 0 or N.

Why candidates were rejected

No report in this guide gives official rejection feedback, and most reports describe the process while the result was still pending. Treat this as editorial advice, not confirmed rejection reasons:

  • Running out of time on the untimed behavioural section by spending too long on the timed DSA/SQL sections first, based on how the sections are structured.
  • Giving a surface-level resume walkthrough when interviewers expected depth and follow-up answers for a sustained 30 minutes.

If you remember only five things

  1. The OA has four parts: 2 DSA questions, about 12 SQL MCQs, about 8 aptitude MCQs, and a long untimed behavioural section.
  2. Revise OS scheduling and caching algorithms (SJF, FIFO) by hand; they appear as direct OA questions.
  3. The interview can be a single round covering resume, OS, OOP, coding and system design together.
  4. Know every project on your resume deeply; expect about 30 minutes of follow-up questions on it.
  5. Practise explaining your approach's time and space complexity out loud as you solve.

FAQ

How many rounds does NatWest's SDE interview have after the OA?

Most reports describe exactly one technical interview round, sometimes with two interviewers, covering resume, core CS, coding and occasionally system design together.

Is the behavioural section timed?

No. The reports that mention it explicitly say "no time limit," unlike the DSA and SQL sections.

Does NatWest ask system design for a fresher role?

One 2026 report described a URL-shortener design question in the technical round, but this is not confirmed as a standard part of every drive.

What SQL topics come up most?

Transaction commands (COMMIT, ROLLBACK), JOIN types, and UPDATE statements built on a subquery, based on the reported MCQs.

Is NatWest the same as RBS?

NatWest Group was formerly known as Royal Bank of Scotland Group; recent India campus drives use the NatWest name.

About this guide

The Codinzhub team wrote this guide from 3 NatWest interview experiences and about 28 OA question records shared on Codinzhub between July and November 2026, from campus drives at IIT Roorkee, IIT (BHU) Varanasi, IIT Kharagpur, IIT Bombay, IIT Guwahati, NSUT and VIT Vellore. Questions are short paraphrases in our own words. Practice problems are similar problems we picked for each pattern, not exact matches unless marked.

You can help other students by sharing your NatWest experience on Codinzhub.

Interview processes change by campus, year and batch. Your placement cell or recruiter can confirm the current format.

Other company and role guides

Ready for the next topic?

Keep track of what you’ve learned.