Barclays Full Stack Developer Interview Questions and Answers

Round duration - 30 minutes
Round difficulty - Medium

It was in the morning. We had to complete 1 coding question in given time limit

Q1. 
Most Frequent Non-Banned Word Problem Statement
Given a paragraph consisting of letters in both lowercase and uppercase, spaces, and punctuation, along with a list of banned words, your task is to find th...read more
Ans. Brute Force
1. To find the frequency of each word we need to extract the words from the paragraph.
2. So we will convert all the punctuation to space in the paragraph and lowercase alphabets to uppercase.
3. Now we can use the library function (e.g sstream in C++) to extract words from the paragraph in an array of strings say WORDS.
4. We will iterate over WORDS and do:
   1. Iterate over the banned array and check if the current word is pre...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

Interviewer was friendly. He asked 2 coding questions and some fullstack questions. 

Q1. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. Recursion
 
1. The idea is to use recursion.
2. For a particular coin, we have two options either include it or exclude it.
3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
4. If we exclude that coin, then recur for the same amount that we have to make.
5. Our final answer would be the total number of ways either by including or excluding.
6. There will be two edg...read more
Answered Anonymously
Add your answer
Q2. 
The Skyline Problem
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...read more
Ans. Brute Force
The idea here is to first, sort the critical POINTS with respect to their coordinate and height pairs. Make a pair of 'X1' and take a negative of the height for the building so that 'X1' pairs are sorted before 'X2' pairs. Create a dictionary keeping the heights as keys and as soon as a left edge of a building is encountered, we add that building to the dictionary with its height as the key. When we encounte...read more
Answered Anonymously
Add your answer

Not every process has aptitude but for IT departments and technical team ask for aptitude test

Q1. If fresher then you must know about the company and some banking terminology. If applying for specific role then you must carry knowledge of that subject.
Add your answer

Q1. They will discuss about norms and salary structure
Add your answer

Trapping rain water and median of two sorted array

Q1. Oops and dbms questions?
Add your answer
Q2. Code question in Array and string?
Add your answer

Q1. Tell me about yourself
Add your answer

1)Buy and sell stock
2)2 sum
3) system design
4) Elastic search
5) deployment

Simple algorithm question about sorting

Q1. Algorith question about quick sort
Add your answer
Q2. Nlonn run time of the sort
Ans. 
The time complexity of the quicksort algorithm is O(n log n).
• Quicksort has an average time complexity of O(n log n).

• The best case time complexity of quicksort is O(n log n) when the pivot element divides the array into two equal halves.

• The worst case time complexity of quicksort is O(n^2) when the pivot element is the smallest or largest element in the array.
Answered by AI
Add your answer

The test was pretty straightforward tword east

Q1. What are your weakness and strength
Add your answer

It had more than 30 aptitude questions and 2 coding questions

Q1. It was totally a tech round all questions were from Data structure, dbms, java, computer networking
Add your answer