Barclays Interview Experience | On Campus - Dec 2021

New update is available. Click here to update.

Barclays interview experience Real time questions & tips from candidates to crack your interview

Business Analyst

Barclays

2 rounds | 3 Coding problems

Anonymous

Fresher | Dec 2021

Selected

Interview preparation journey

Preparation

Duration: 5 Months

Topics: Data Structures and Algorithms, DBMS, OOPs, Computer Networks, JavaScript, Machine Learning, Deep Learning

Tip

Tip 1 : Should be comfortable with basic data structures and algorithms
Tip 2 : Prepare DBMS (specially normalization, terminologies, ACID, database design), OOPs and other core subjects
Tip 3 : Focus on RISES values. Read more about it on Barclays website

Application process

Where: Campus

Eligibility: B.Tech CSE 3rd year, with ≥ 60% score across class X, XII and engineering semesters.

Resume tip

Tip 1 : Should be able to justify everything on Resume
Tip 2 : Include at least 2 good projects

Interview rounds

Round

Medium

Online Coding Interview

Duration90 Minutes

Interview date17 Dec 2021

Problems2

It was an online round hosted on Hackerearth and had a window of 12;00PM - 12:30PM. It was video proctored.

1. Query And Matrix

You are given a binary matrix with ‘M’ rows and ‘N’ columns initially consisting of all 0s. 'Q' queries follow. The queries can be of 4 types:

Try solving now

2. Flip The Bits

Ninja has a binary string ‘S’ of length ‘N’. Initially, all the characters in a string are ‘1’, i.e.

S[i] = ‘1’ for each 1 <= ‘i’ <= ‘N’.

Problem approach

We want to swap ith bit which is turned on in a but not in b to the nearest turned on bit in b. We can use bubble sort like approach here because it's easier to implement. For rest we can simply use 2nd operation.

Try solving now

Round

Medium

Video Call

Duration45 minutes

Interview date21 Dec 2021

Problems1

- Barclays conduct only one interview round i.e. (Tech+HR) on Cisco WebEx. In Barclays, the interviews are taken by Vice Presidents (VPs). It was held at 5:30am for me
- It started with “Tell me about yourself.” and I gave a brief description about my profile in general
- He started with a basic question of detect cycle in a Linked List, proceeded with one more array manipulation questions (adhoc-ish type)
- He asked questions from core subjects like OS(Deadlocks, Scheduling Algorithms, Paging), DBMS(Types of joins, why we use Normalization)
- Some questions about SVM and how can we interpret hyperplane in SVM
- Then he concluded by asking if I had any questions
- Overall round difficulty was easy-medium is one with clear with his/her basics

1. Cycle Detection in a Singly Linked List