Upload Button Icon Add office photos

Filter interviews by

Barclays Global Service Centre Software Developer Intern Interview Questions and Answers

Updated 2 Jan 2025

Barclays Global Service Centre Software Developer Intern Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

2 easy to medium questions

Round 2 - Technical 

(2 Questions)

  • Q1. Basic questions about core subjects like DBMS
  • Q2. Discussion on resume
Round 3 - HR 

(2 Questions)

  • Q1. Strengths and weaknesses
  • Q2. Behavioral questions

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Hard
Process Duration
2-4 weeks
Result
Not Selected

I applied via campus placement at KIIT University, Bhuvaneshwar and was interviewed in Jul 2024. There were 2 interview rounds.

Round 1 - Coding Test 

It had mcq and 1 hard coding question

Round 2 - Technical 

(2 Questions)

  • Q1. They asked me about backtracking and dp series problem and also to solve the given question
  • Q2. Java and in depth about different pillars of java

Interview Preparation Tips

Interview preparation tips for other job seekers - Focus primarily on Java and advanced data structures and algorithms topics, such as backtracking and dynamic programming.
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(2 Questions)

  • Q1. What was ur expected salary
  • Q2. Tell the needed one

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep prepared for every round
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

DSA questions of array and strings

Round 3 - Technical 

(1 Question)

  • Q1. DSA on array advanced topics

Interview Preparation Tips

Interview preparation tips for other job seekers - DSA is must
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via campus placement at Birla Institute of Technology and Science (BITS), Pilani and was interviewed in Nov 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Coding Test 

Coding test was easy, there were 2 questions.

Round 3 - Technical 

(1 Question)

  • Q1. Square root of a number in log n time
  • Ans. 

    Using binary search, square root of a number can be found in log n time.

    • Choose a range for the square root

    • Use binary search to find the square root within the range

    • Adjust the range based on whether the guess is too high or too low

  • Answered by AI
Round 4 - HR 

(2 Questions)

  • Q1. Basic questions on leadership and some problem based.
  • Q2. Basics questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Just be confident and try to give as many mock interviews as possible

Skills evaluated in this interview

I was interviewed in Dec 2020.

Round 1 - Video Call 

(3 Questions)

Round duration - 45 Minutes
Round difficulty - Easy

This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.

  • Q1. 

    Kth Largest Element Problem

    Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.

    Example:

    Input:
    N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
  • Ans. Brute Force
    • The most obvious brute force approach would be to sort the array in descending order and return the ‘K’th element from the beginning of the array.
    • Sort the array in descending order, for sorting most of the languages have their inbuilt sort methods which are usually very fast.
    • After sorting, return the element arr['K'-1](i.e. element at index ‘K’-1, considering 0-based indexing).
    Space Complexity: O(1)Explanati...
  • Answered Anonymously
  • Q2. Can you draw an E-R Diagram for Uber?
  • Q3. 

    Maximum Sum Path from Leaf to Root

    Given a binary tree with 'N' nodes, identify the path from a leaf node to the root node that has the maximum sum among all root-to-leaf paths.

    Example:

    All the possibl...

  • Ans. Recursive Subproblem

    The idea here is that we will do a recursive solution by asking the children of the current node for the max sum path and then choose the path with the max sum. 

     

    The approach will be as follows:

    1. Get the max sum path for the left subtree.
    2. Get the max sum path for the right subtree.
    3. Select the one with the max sum from both and insert current node's data into it.
    4. Return the updated path.
       

    Al...

  • Answered Anonymously
Round 2 - Video Call 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M

  • Q1. 

    Add Two Numbers Represented as Linked Lists

    Given two linked lists representing two non-negative integers, where the digits are stored in reverse order (i.e., starting from the least significant digit to ...

  • Ans. Recursion
    • A simple approach could be to recursively add the nodes of the linked list while keeping track of the carry generated.
    • The idea behind this approach is the same as finding the sum of two numbers manually on a paper, where we start by adding the LSD and move on till the MSD. Also, keeping track of the carry generated in every iteration.
    • As the linked lists represent the numbers in reverse order, the LSD occurs at...
  • Answered Anonymously
Round 3 - HR 

Round duration - 15 Minutes
Round difficulty - Easy

Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in ChennaiEligibility criteria70% aboveHexaware Technologies interview preparation:Topics to prepare for the interview - Dynamic Programming, Sort and Search Algorithms, Graphs, Data Structures ( Priority Queue, stack, sets), Greedy Algorithms, OOPS, DBMSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Contribute time for course subjects also like OS,DBMS,OOPS.
Tip 2 : Start practicing on Leetcode and InterviewBit 1 month before your Placement Drive and try solving approx 300+ questions.
Tip 3 : Regularly Participate in Coding Contests on CodeForces and try to be Expert.

Application resume tips for other job seekers

Tip 1 : Don't try to lie in resume as questions can be asked on the same in depth.
Tip 2 : Mention atleast 1 project or past work experience.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

It was in the morning. It had basic questions and 2 programming questions(1 string and 1 Data Structure)

  • Q1. 

    Character Pattern Problem Statement

    Generate a pattern based on the input number of rows N. Each row i should start with the i-th letter of the alphabet, and the number of letters in the row should match ...

  • Ans. Space Complexity: Explanation: Time Complexity: Explanation:
  • Answered Anonymously
  • Q2. 

    Stack using Two Queues Problem Statement

    Develop a Stack Data Structure to store integer values using two Queues internally.

    Your stack implementation should provide these public functions:

    Explanation:

    ...
  • Ans. Approach 1
    • This method ensures that every new element entered in the queue ‘q1’ is always at the front.
    • Hence, during pop operation, we just dequeue from ‘q1’.
    • For this, we need another queue ‘q2., which is used to keep every new element to the front of ‘q1’.
    • During push operation :
      • Enqueue new element ‘x’ to queue ‘q2’.
      • One by one, dequeue everything from ‘q1’ and enqueue to ‘q2’.
      • Swap the names of ‘q1’ and ‘q2’.
    • During pop o...
  • Answered Anonymously
Round 2 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

My interviewer asked me about my projects and the concepts involved in making it. Then he asked me to solve a string problem which was not very difficult followed by basic questions on array and it's properties. He also asked HTML tags.

  • Q1. 

    Reverse the String Problem Statement

    You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.

    Example:

    Input:
    STR = "abcde"
    Output:
    "e...
  • Ans. Optimal Solution
    • Traverse the string and swap the first character with the last character, the second character with the second last character and so on.
    • Basically, you need to swap the i-th character with the (N-i-1)-th character where N is the length of the string and 0-based indexing is considered.
    Space Complexity: O(1)Explanation:

    O(1).

     

    In the worst case, only constant extra space is required.

    Time Complexity: O(...
  • Answered Anonymously
Round 3 - HR 

Round duration - 150 minutes
Round difficulty - Easy

This round for Sapient was based on it's core values and how I've implemented these once or more in life. It mostly involved discussion around my leadership, team player, problem solving and innovative skills as a part of the clubs in college. Also, what are my expectations from Sapient and what I bring to them

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in GurgaonEligibility criteriaAbove 6 CGPA, 60% in 12th and 10thPublicis Sapient interview preparation:Topics to prepare for the interview - Strings, Arrays, Stack, Queue, Basics of HTML, Basics of CSS, OOPSTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Be confident, clear and calm with the answers during interview
Tip 2 : Practice coding questions on based on different difficulty
Tip 3 : Prepare the topics thoroughly the questions might not be tough but they would be based on the core concept
Tip 4 : You should have at least 2 projects - JAVA and database related or Data Analytics

Application resume tips for other job seekers

Tip 1 : Projects are mandatory you can steer the interview in that direction
Tip 2 : Resume should only have what you actually know and did
Tip 3 : Add extra-curriculars (for Sapient it really matters if you have incidents related team building, leadership, conflict resolution experiences)

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
Selected Selected

I applied via Campus Placement and was interviewed before Oct 2022. There were 3 interview rounds.

Round 1 - Aptitude Test 

It was a 2hr test. It had two sections. 1)Quantitative aptitude and verbal ability and 2) Technical aptitude.

Round 2 - Technical 

(1 Question)

  • Q1. It was for 45 min. Asked some OOPs concepts, CN fundamentals. Questions were asked on arrays and linked lists. also on OS
Round 3 - HR 

(1 Question)

  • Q1. It was for 5 min. Asked on why I wanted to join Optum

Interview Preparation Tips

Interview preparation tips for other job seekers - Mention only things that you are perfect in resume. Don't add extra stuff and don't fake it.

I was interviewed in Dec 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This round contains 40 mcq questions 15 dsa and 25 aptitude.
then there was 5 coding questions.

  • Q1. 

    Check If Binary Representation of a Number is Palindrome

    Given an integer N, determine if its binary representation is a palindrome.

    Input:

    The first line contains a single integer ‘T’ representing the ...
  • Ans. 

    Check if binary conversion of given number is palindrome or not. Ex: 6 (0110) is palindrome.
    I used a recursive function for binary conversion and then check for palindrome using a loop. Refrain from using inbuilt functions as they wanna check your logic. O(n) time complexity.

  • Answered Anonymously
  • Q2. 

    Word Break Problem Statement

    You are given a list of N strings called A. Your task is to determine whether you can form a given target string by combining one or more strings from A.

    The strings from A c...

  • Ans. 

     One Sentence (string) is given. find out the words, that has length even and greater than equal to 4 (e.g. 4,6,8.. etc.) and separate them with space.
    e.g. Given String : “abcd abc abcde abcdef”
    Output: “ab cd abc abcde abc def”
    I allocated a new string dynamically, and used two for loops to copy one string to another, adding a space at the middle of the word where word length was >=4 and even. O(n^2) time comple

  • Answered Anonymously
Round 2 - Video Call 

(1 Question)

Round duration - 25 minutes
Round difficulty - Easy

Technical Round

  • Q1. 

    Sort 0 and 1 Problem Statement

    Given an integer array ARR of size N containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an...

  • Ans. 

    Then he made it complex by saying that if there are numbers from 0 to k in an array of size n then how will you sort them in O(n), I told him the count sort, he agreed with it and then asked me to quickly write down the code, I wrote it down, there was a silly mistake which he pointed out and said that it’s good and then moved on to next problem. He saw my code for fourth largest in an array, I did it using heap and ti...

  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Panjab University. I applied for the job as SDE - Intern in GurgaonEligibility criteriaAbove 7 CGPANagarro interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Web Development, Strings, Bit MappingTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Practice well basics of dsa
Tip 2 : Have a good grip of core cs
Tip 3 : have good projects on resume

Application resume tips for other job seekers

Tip 1 : Don't put anything which you are not comfortable to speak
Tip 2 : make it short and crisp

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Nov 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 78 minutes
Round difficulty - Easy

My slot was at 4.30 pm on 11 th oct 2020

  • Q1. 

    Fishmonger Toll Optimization Problem

    A fishmonger needs to transport goods from a port to a market, crossing multiple states each requiring a toll. The goal is to minimize the toll costs while ensuring th...

Round 2 - Video Call 

(2 Questions)

Round duration - 20 Minutes
Round difficulty - Easy

It happened in the afternoon

  • Q1. 

    Shape and Method Overriding Problem Statement

    Create a base class called Shape that contains a field named shapeType and a method printMyType.

    Implement two derived classes:

    • Square: This class inheri...
  • Q2. What are the ACID properties in database management systems?
Round 3 - Assignment 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. Can you write an essay on any topic and present it verbally?

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in PuneEligibility criteriaAbove 60% or 6 C.G.P.AHexaware Technologies interview preparation:Topics to prepare for the interview - Aptitude , Logical Reasoning , Verbal , DBMS , OS , Java Lang , Computer science basicsTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice good aptitude questions
Tip 2 : Read important core subjects thoroughly
Tip 3 : Also revise language basics

Application resume tips for other job seekers

Tip 1 : Be honest with your resume
Tip 2 : Try to somehow highlight your strong points in resume

Final outcome of the interviewRejected

Skills evaluated in this interview

Barclays Global Service Centre Interview FAQs

How many rounds are there in Barclays Global Service Centre Software Developer Intern interview?
Barclays Global Service Centre interview process usually has 3 rounds. The most common rounds in the Barclays Global Service Centre interview process are Coding Test, Technical and HR.
What are the top questions asked in Barclays Global Service Centre Software Developer Intern interview?

Some of the top questions asked at the Barclays Global Service Centre Software Developer Intern interview -

  1. Basic questions about core subjects like D...read more
  2. Behavioral questi...read more

Tell us how to improve this page.

Barclays Global Service Centre Software Developer Intern Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more
Assistant Vice President
631 salaries
unlock blur

₹14 L/yr - ₹42.6 L/yr

Process Advisor
436 salaries
unlock blur

₹1 L/yr - ₹8.9 L/yr

Senior Analyst
278 salaries
unlock blur

₹3.5 L/yr - ₹12 L/yr

Assistant Manager
252 salaries
unlock blur

₹6.5 L/yr - ₹21.5 L/yr

Analyst
219 salaries
unlock blur

₹11.2 L/yr - ₹18.2 L/yr

Explore more salaries
Compare Barclays Global Service Centre with

HSBC Group

4.0
Compare

OneMain Financial

4.5
Compare

Wipro

3.7
Compare

TCS

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview