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

SDE - 1

Barclays

1 rounds | 1 Coding problems

Aarushi aryama

Fresher | Sep 2020

Rejected

Interview preparation journey

Preparation

Duration: 10 Months

Topics: Data Structure, Algorithms, Basics of object oriented programming, Operating System, Database Management System, C++ Basics

Tip

Tip 1 : Do not totally depend on past interview questions or as such unless and until you have a strong foundation. Just build the foundation first in starting months.
Tip 2 : More focus should be on problem-solving skills. Develop the skills of using applications.(Eg.: Where one should use Hashmap, Arraylist, etc.)
Tip 3 : Try to solve the problem on your own. Just sink yourself into the question so much that you don't need to look for the solution.(Figure out solution in your own way).
Tip 4 : Regarding project, quantity doesn't matter but what matters the most is you should know about the project from start to end. Able to explain the project clearly. Be ready with technical as well as Behavioral questions.

Application process

Where: Campus

Eligibility: Above 7 CGPA

Resume tip

Tip 1 : Get rid of irrelevant topics or headings.(Eg. Stood 1st in Annual Sack Race Competition.)
Tip 3 : Make sure you don't keep anything which create problem at time of Interview.
Tip 4 : Short and crisp Resume with each spelling checked twice.
Tip 5 : Keep updating your resume based on addition of Internship/Projects, etc.
Tip 6 : Keep the file name(Resume saved as pdf or any format) decent too.

Interview rounds

Round

Medium

Online Coding Interview

Duration90 Minutes

Interview date19 Sep 2020

Coding problem1

Coding round was conducted in the morning for 1.5 hours from 10:00 am to 11:30 am. Exam was conducted on HACKEREARTH which is a user-friendly platform with various edge test-cases. Since exam was done through online mode due to COVID-19, therefore camera was on for invigilation. A well working camera and microphone were needed for successful completion of exam.

1. Ninja and words magic

Moderate

30m average time

70% success

0/80

Asked in companies

Ninja has been given a dictionary of words ‘WORDS’ of length ‘N’ and a sentence ‘SENTENCE’ consisting of words separated by a single space. Ninja has to make the ‘SENTENCE’ as small as possible by performing the below operation any number of times.

Ninja can replace a word of the ‘SENTENCE’ with a word present in the ‘WORDS’ if and only if the prefix of that word is present in the ‘WORDS’.

Note: If the word of the ‘SENTENCE’ can be replaced by more than one word present in the ‘WORDS’, then replace it with the smallest possible word present in the ‘WORDS’.

Example for all prefixes of a string:

String ‘STR’ = “abcd” 
Then all possible prefix of this ‘STR’ are:
"a", "ab", "abc", "abcd".

Note:

1. All the words in the ‘WORDS’ and the ‘SENTENCE’ contain only lower case English alphabets.
2. ‘SENTENCE’ does not have any leading and trailing spaces.