Barclays PLC Full Stack Developer Interview Questions and Answers

Quantitive Aptitude, General programming,oops

GK, Quantitative Aptitude

C# Fundamentals , ADO.NET,LINQ

Q1. Why there are so frequent change.
Ans. 
Frequent changes in technology are driven by advancements, market demands, and user feedback.
• Advancements in technology lead to new tools and frameworks being developed.

• Market demands require companies to adapt quickly to stay competitive.

• User feedback helps improve products and services, leading to updates and changes.

• Examples: Introduction of new programming languages like Swift, shift towards cloud computing, update...read more
Answered by AI
Add your answer
Q2. Please tell me about your understanding with roll
Ans. 
Roll is a term used in web development to describe the process of deploying code changes to a live server.
• Rolling back changes means reverting to a previous version of the code.

• Rolling forward means applying new changes to the live server.

• Rolling deployments involve gradually updating servers in a controlled manner to minimize downtime.

• Automated rollbacks can be triggered in case of errors or issues during deployment.
Answered by AI
Add your answer

Q1. Explain architecture of project
Ans. 
The project architecture follows a microservices design pattern with separate front-end and back-end components.
• Utilizes microservices architecture for scalability and flexibility

• Separate front-end and back-end components for modularity

• May include technologies like Docker for containerization and Kubernetes for orchestration
Answered by AI
Add your answer
Q2. Async and await difference
Ans. 
Async and await are keywords in JavaScript used for handling asynchronous operations.
• Async is used to define a function as asynchronous, allowing it to use the await keyword.

• Await is used to pause the execution of an async function until a Promise is settled.

• Async functions always return a Promise, which resolves with the value returned by the function.

• Using async/await makes asynchronous code easier to read and write
Answered by AI
Add your answer

Q1. Tell me about yourself
Ans. 
I am a passionate Full Stack Developer with experience in building web applications using various technologies.
• Experienced in front-end technologies like HTML, CSS, JavaScript, and frameworks like React and Angular

• Proficient in back-end technologies like Node.js, Express, and databases like MongoDB and SQL

• Familiar with version control systems like Git and deployment tools like Heroku
Answered by AI
Add your answer
Q2. Do you have any quetion for me ?
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

It was at 9 am in the morning

Q1. Add two number as linked lists
You have been given two singly Linked Lists, where each of them represents a positive number without any leading zeros.
Your task is to add these two numbers and print the ...read more
Ans. Naive Method
We will use the naive method to add two linked lists. While adding two numbers, we always add digits in the right to left manner. So first, we will reverse both linked lists so that we can easily process the number in this manner.
 
We will be storing the result of the addition in a different linked list. We will start adding the nodes of both linked lists and use another variable ‘carry’ to keep track o...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Cycle Detection In Undirected Graph
You have been given an undirected graph with 'N' vertices and 'M' edges. The vertices are labelled from 1 to 'N'.
Your task is to find if the g...read more
Ans. DFS Approach (Slow)
There is a cycle in the graph only if there is a back edge (back edge is an edge that connects a vertex to another vertex that is discovered before it's parent) present in the graph. To detect a back edge, we will keep track of vertices that have been already visited. If we reach a vertex that is already visited and is not the parent vertex of the current vertex, then there is a cycle in the graph.&n...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 50 Minutes
Round difficulty - Hard

Q1. Technical Questions
What is OOPS . Tell the different OOps features. Implement method overloading in c++
What is Synchronisation. How can we implement synchronisation in C++
What is Normalisation? Also implem...read more
Add your answer
Q2. Maximum Subarray Sum
You are given an array/list ARR consisting of N integers. Your task is to find the maximum possible sum of a non-empty subarray(contagious) of this array.
Note: An array C is a subar...read more
Ans. Brute Force
We will iterate through all possible boundaries of the subarrays in the given array with the help of two nested loops. 
 
Then, we will iterate through each subarray with the help of another loop and find the sum of the subarray. We will maintain the maximum subarray sum through our iterations and finally return it.
Space Complexity: O(1)Explanation:
O(1), constant space is used.
Time Complexity: O(n^3...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 30 Minutes
Round difficulty - Hard

Happened on teams

Q1. Basic HR Questions
Explain yourself. How will you manage a team of 10 employees
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

There were 3 problems 1 was easy and 2 were of medium types.

Q1. Odd even level
Given a binary tree. Find and return the modulus of the difference between the sum of odd level nodes and the sum of even level nodes.
Input format:
The first line contains an integer '...read more
Ans. DFS
1. Create two variables, one for storing the sum of nodes at the odd level and one for storing the sum of nodes at even level.
2. Use the below algorithm to calculate level sums where:
oddSum: denotes sum of nodes at odd levels, initially 0.
evenSum: denotes sum of nodes at ecen levels, initially 0.
level: the level of the current node, initially 1. 
void oddEvenLevelHelper(current, oddSum, evenSum, level)
 
• If the cur...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Rotting Oranges
You have been given a grid containing some oranges. Each cell of this grid has one of the three integers values:
Value 0 - representing an empty cell.
Value 1 - representing a fresh...read more
Ans. Naïve Solution
The idea is very simple and naive. We will process the rotten oranges second by second. Each second, we rot all the fresh oranges that are adjacent to the already rotten oranges. The time by which there are no rotten oranges left to process will be our minimum time.
 
In the first traversal of the grid, we will process all the cells with value 2 (rotten oranges). We will also mark their adjacent cells ...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 50 minutes
Round difficulty - Medium

the interviewer was very polite and straightforward, he didn't ask me to introduce myself and he directly jumps to the coding problems.
What is new about the relationship between the and tags in HTML5?
Explain Components, Modules and Services in Angular

Q1. Circular Move
You have a robot currently standing at the origin (0, 0) of a two-dimensional grid and facing north direction. You are given a sequence of moves for the robot in the form of a string of size...read more
Ans. Optimal Approach
Initialize a variable ‘direction’ with 0 which means that the robot is initially facing towards the north.
direction: 0 -> Robot is facing towards the North
direction: 1 -> Robot is facing towards the West 
direction: 2 -> Robot is facing towards the South 
direction: 3 -> Robot is facing towards the West
 
Initialize two variables ‘x’ and ‘y’ as 0. They will represent the position ...read more
Answered by CodingNinjas
Add your answer

Round duration - 70 minutes
Round difficulty - Easy

What is a View in sql? What are the TRUNCATE, DELETE and DROP statements?

Q1. Rotate matrix by 90 degrees
You are given a square matrix of non-negative integers 'MATRIX'. Your task is to rotate that array by 90 degrees in an anti-clockwise direction using constant extra spac...read more
Ans. Transpose and Reverse
The idea is to find the transpose of the given matrix and then reverse the columns of the transposed matrix. For example:
For the given 2D matrix:
	[ [ 1,  2,  3 ],
	  [ 4,  5,  6 ],
	  [ 7,  8,  9 ] ]
After taking transpose, it will become:
	[ [ 1,  4,  7 ],
	  [ 2,  5,  8 ],
	  [ 3,  6,  9 ] ]
After reversing the columns, it will ...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Minimum Characters For Palindrome
Given a string STR of length N. The task is to return the count of minimum characters to be added at front to make the string a palindrome.
For example, for the given st...read more
Ans. Brute Force
• The idea is pretty simple, as we can add only at the front, thus, we need to work on the prefix of the string.
• We need to find the largest prefix that is a palindrome. For example, in case of “abbac”, the largest prefix that is a palindrome is “abba”, now all you need to do is add the reverse of left out suffix i.e. “ca” at the front to make it a palindrome.
• This can be done in the following way:-
  • Until the str...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 20 minutes
Round difficulty - Easy

Q1. Basic HR Questions
Tell me about yourself?
What do you know about Paytm?
What are your strength and weaknesses?
Job location preference?
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

11:05am – 12:05pm (IST). What are classes in javascript? how do you integrate js in html.

Q1. Longest Substring Without Repeating Characters
Given a string 'S' of length 'L', return the length of the longest substring without repeating characters.
Example:
Suppose given input is ...read more
Ans. Brute Force
In the brute force approach, we will use two nested loops. The outer loop is used to select the starting index of the substring and the inner loop is used to fix the ending index of the substring. After selecting the substring, we will use another loop (or a method) to check whether the substring contains all unique characters or not using a HashSet.
Space Complexity: O(n)Explanation:
O(L), where L is the len...read more
Answered by CodingNinjas
View 3 more amswers
Q2. Print Nodes at Distance K From a Given Node
You are given an arbitrary binary tree, a node of the tree, and an integer 'K'. You need to find all such nodes which have a distance K from the given no...read more
Ans. DFS
• Create a map to store the parent of each node in the tree, Traverse the tree recursively (via depth-first search), at each step if the current node is not NULL. Store its parent in the map, then traverse the left and right subtree.
• Now assume that the given node is the root of the tree. In such a case, we can simply run a breadth-first search from the root, and track the current level of the tree. When the level = ‘K...read more
Answered by CodingNinjas
View 1 more amswer
Q3. Number of Islands
You have been given a non-empty grid consisting of only 0s and 1s. You have to find the number of islands in the given grid.
An island is a group of 1s (representing land) connected hor...read more
Ans. DFS
The problem boils down to find the number of connected components in the grid. 
 
If we are on a land cell and explore every cell connected to it 8-directionally (and recursively cells connected to those cells, and so on), then the total number of cells with land explored will be one island.
 
To ensure we don't count cells in the island more than once, we will mark 1(land) as 0 during the recursion call...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 60 minutes
Round difficulty - Medium

12:30pm – 1:30pm (IST). SQL questions What are Aggregate and Scalar functions? What is a Stored Procedure?

Q1. Next Greater Element
For a given array/list of integers of size N, print the Next Greater Element(NGE) for every element. The Next Greater Element for an element X is the first element on the right side of...read more
Ans. Brute Force
For every element in the array, we will run a loop on its right side. As soon as we find an element on its right side which is greater than it, we will break the loop, assign it as the NGE of this element, move forward, and do the same for the next element.
Space Complexity: O(1)Explanation:
O(1)
 
No extra space is used.
Time Complexity: O(n^2)Explanation:
O(N ^ 2),  Where N is the number of elements ...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Container With Most Water
Given a sequence of ‘N’ space-separated non-negative integers A[1],A[2],A[3],......A[i]…...A[n]. Where each number of the sequence represents the height of the line drawn at poin...read more
Ans. Brute Force Approach
Since we need to find the container with most water, let us try to find all possible containers and choose the one which has the maximum area.
So how can we find the area of all possible containers?
We can, for each line with the position ‘i’ find another line ‘j’ such that ‘j’ > ‘i’ and find the amount of water contained i.e (‘j’-’i’)*min('A[i]', ‘A[j]’) where ‘A[i]’ and ‘A[j]’ represents the heig...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 60 minutes
Round difficulty - Easy

5pm – 6pm (IST)

Q1. Basic HR Questions
Discussion regarding Project
Behavioral questions
Add your answer

It is very easy. Practice daily on Indiabix

I was given 2-3mins yo speak on the topic. It was is Indian Education system needs modification. Be confident while speaking.

A piece of paper was given to me and I need to tell the some basics of computer languages

How can I lead my team