Natwest Group interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Natwest Group
2 rounds | 4 Coding
problems
Rejected
Interview preparation journey
Journey
During my B Tech, I started practising coding questions and participating in interview mocks.Till then, I solved many questions in all the practicing websites.
Application story
I applied via the company website, there were job openings for this role. The whole process was conducted online via Zoom.
Why selected/rejected for the role?
I was rejected because I was not able to give Python related answer excellently. I think that was the only reason for not selecting me.
Preparation
Duration: 3 months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Application process
Where: Company Website
Eligibility: Above 7 CGPA
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Interview rounds
01
Round
Medium
Video Call
Duration45 minutes
Interview date15 Jun 2022
Coding problem2
Two coding questions were discussed in this round.
1. Longest Substring Without Repeating Characters
Moderate
30m average time
65% success
0/80
Asked in companies
Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.
Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.
Problem approach
Can be solved using sliding window.
2. Two Sum
Easy
10m average time
90% success
0/40
Asked in companies
You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.
Note:
We cannot use the element at a given index twice.
Follow Up:
Try to do this problem in O(N) time complexity.
Problem approach
Hashing Solution
We can store the frequency of every element in the array in a hashmap.
We will loop over every index i, and check the frequency of (Target - ARR[i]) is the hashmap:
If (Target - ARR[i]) is equal to ARR[i], we will check if frequency of ARR[i] . If it is greater than 1 then we will decrease the frequency of ARR[i] by 2 and add a pair (ARR[i] , ARR[i]) to our answer.
Else, if the frequency of ARR[i] and Target - ARR[i] is greater than equal to 1 then we add pair (ARR[i], Target - ARR[i]) to our answer and decrease the frequency of both by 1.
If no valid pairs exist, we will return [[-1,-1]].
02
Round
Medium
Video Call
Duration40 minutes
Interview date20 Jun 2022
Coding problem2
Technical round with questions on Python and OOPS concepts.
1. Python Questions
How does Python handle memory
Explain the Constructor, Destructor, Generators
2. OOPS
Oop's concepts using Python
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
Data Scientist
1 rounds | 3 problems
Interviewed by Natwest Group
Rejected
1363 views
0 comments
0 upvotes
Data Scientist
1 rounds | 2 problems
Interviewed by Natwest Group
Rejected
1170 views
0 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Natwest Group
Selected 4103 views
0 comments
0 upvotes
Software Engineer
2 rounds | 4 problems
Interviewed by Natwest Group
Rejected
2506 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
4 rounds | 1 problems
Interviewed by Newgen Software
Selected 3210 views
2 comments
0 upvotes
Software Engineer
3 rounds | 6 problems
Interviewed by HashedIn
Selected 2582 views
0 comments
0 upvotes
Software Engineer
2 rounds | 2 problems
Interviewed by Ernst & Young (EY)
Selected 0 views
0 comments
0 upvotes