Barclays interview experience Real time questions & tips from candidates to crack your interview
Graduate Engineer Trainee
Barclays
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Journey
I started working on DSA seriously in my second year. Before that, I did it just to understand the concepts of various data structures and algorithms. I tried to solve at least 2 to 3 problems a day and gradually worked my way up to participating in contests. Early on, the results were underwhelming, but with time, I got a hold of it, and eventually, it helped me land a good job.
Application story
I applied through my campus. Before the first round, which was a coding test, we had one week to prepare. The coding round was about 90 minutes long and included 20 MCQs and 2 easy to medium-level coding questions. After that, we had only one interview, which was conducted 2 or 3 days after the test results.
Why selected/rejected for the role?
I was selected for the role. I believe it was because I stayed true to my resume and covered a wide range of topics for the interview. Whatever the interviewer asked, I was able to respond effectively.
Preparation
Duration: 1 month
Topics: Since it was a developer interview, I had to brush up on all topics like DBMS, OS, Networking, Java (role was java based), DSA and OOPS
Tip 1: Try to cover a wide range of topics with the questions you solve.
Tip 2: Along with DSA, work on some projects too.
Tip 3: Keep revising the concepts of DBMS, OS, OOP, and Networks regularly.
Application process
Where: Campus
Eligibility: CGPA criteria I think was 6 or more with no active backlogs.
Tip 1: Stay honest with your resume.
Tip 2: Try to include some projects and the topics mentioned in the job description.
Interview rounds
01
Round
Easy
Online Coding Interview
Duration90 minutes
Interview date28 Jul 2022
Coding problem1
1. Longest Mountain Subarray
Easy
10m average time
90% success
0/40
Asked in companies
For every element arr[i], if it is greater than both arr[i – 1] and arr[i + 1] or it is smaller than both arr[i – 1] and arr[i + 1] then arr[i] needs to be modified.
i.e. arr[i] = (arr[i – 1] + arr[i + 1]) / 2. If after modification, arr[i] = arr[i – 1] or arr[i] = arr[i + 1] then the array cannot be made strictly increasing without affecting more than a single element. Else count all such modifications, if the count of modifications in the end is less than or equal to 1 then print “Yes” else print “No”.
02
Round
Medium
Video Call
Duration30 minutes
Interview date4 Aug 2022
Coding problem2
This was the interview round where I was asked about my projects, the language Java, OS and DBMS concepts and some DSA.
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
Java Developer
3 rounds | 5 problems
Interviewed by Barclays
Selected 
6041 views
1 comments
0 upvotes
SDET-2
5 rounds | 5 problems
Interviewed by Barclays
Selected 2500 views
0 comments
0 upvotes
SDE-3
3 rounds | 4 problems
Interviewed by Barclays
Selected 1763 views
0 comments
0 upvotes
Salesforce Developer
3 rounds | 3 problems
Interviewed by Barclays
Selected 2566 views
1 comments
0 upvotes