Barclay’s recruiting process (easy)
Campus: MNIT Jaipur
First Round: There was an online test that consisted of two parts
2 Dsa question
30 MCQ were related to oops in java, oops in python, oops in c++, Dbms
1st dsa question is related to frequency count using an easy map.
2nd question is related to (find the numbers such that the difference between two numbers is k and their sum is as small as possible)
first question (20 marks)
the second question (50 marks)
MCQ (4 or 6 marks each )
all MCQs were tricky. There was no negative marking.
After that, they shortlisted 12 candidates I was one of them.
Interview questions [1]
Question 1
Barclay’s recruiting process (easy)
Campus: MNIT Jaipur
First Round: There was an online test that consisted of two parts
2 Dsa question
30 MCQ were related to oops in java, oops in python, oops in c++, Dbms
1st dsa question is related to frequency count using an easy map.
2nd question is related to (find the numbers such that the difference between two numbers is k and their sum is as small as possible)
first question (20 marks)
the second question (50 marks)
MCQ (4 or 6 marks each )
all MCQs were tricky. There was no negative marking.
After that, they shortlisted 12 candidates I was one of them.
I applied through college or university. I interviewed at XYZ (New York, NY) in Nov 2025
Interview
It was a good experience , interviewer was nice ,ask me to briefly go throught my project , then asked some backend questions like https , rest apis ,req flow etc some git commands then ask a simple maths puzzle
nice but only for those who have prepared for the drive for campus placement series but yeah overall great experience for the company i have seeen in the field of sowtware intern for the fresher in location
They asked me to design and implement an efficient algorithm to detect cycles in a directed graph, explain my choice of data structure, analyze time and space complexity, and discuss potential optimizations for large-scale inputs.”
Interview questions [1]
Question 1
“They asked me to design an algorithm that finds the first non-repeating character in a string, optimize it for time complexity, and then walk through edge cases.”
