Barclays Python Fullstack Developer Interview Questions and Answers

Q1. Design patterns that you have followed in your past projects.
Ans. 
I have followed the MVC, Singleton, and Factory design patterns in my past projects.
• MVC pattern for separating concerns and improving maintainability

• Singleton pattern for ensuring only one instance of a class is created

• Factory pattern for creating objects without exposing the instantiation logic
Answered by AI
View 1 more answer
Q2. How to secure the applications?
Ans. 
Applications can be secured by implementing various security measures such as authentication, authorization, encryption, and regular updates.
• Implement strong authentication mechanisms such as multi-factor authentication

• Use authorization to restrict access to sensitive data and functionalities

• Encrypt sensitive data both in transit and at rest

• Regularly update the application and its dependencies to patch security vulnera...read more
Answered by AI
View 1 more answer

Q1. Explain Encapsulation
Ans. 
Encapsulation is the concept of bundling data and methods that operate on the data into a single unit.
• Encapsulation helps in hiding the internal state of an object and only exposing necessary functionalities.

• It allows for better control over the data by preventing direct access from outside the class.

• Encapsulation also helps in achieving data abstraction and information hiding.

• Example: In a class representing a car, th...read more
Answered by AI
Add your answer
Q2. How to call rest API
Ans. 
To call a REST API, you can use tools like Postman or code in languages like JavaScript or Python.
• Use tools like Postman to make HTTP requests to the API endpoints

• In programming languages like JavaScript, use libraries like Axios or Fetch to make API calls

• Include necessary headers, parameters, and authentication tokens in the request

• Handle the response data accordingly, whether it's JSON, XML, or other formats
Answered by AI
Add your answer

You have to debug and correct the code given.

Q1. Fibonacci Series
Add your answer

Basic Aptitude and Technical Question

2 coding Questions asked from array and strings

Q1. Projects were asked
Add your answer
Q2. Resume should be prepared well
Add your answer

Q1. Basic HR questions were asked
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It was an online assessment with coding and aptitude questions.

Q1. 
Contains Duplicate Problem Statement
Given an array of integers ARR and an integer K, determine if there exist two distinct indices i and j such that ARR[i] == ARR[j] and | i - j | <= K.
Input:
The f...read more
Ans. 
Given an array of integers and an integer K, determine if there exist two distinct indices i and j such that ARR[i] == ARR[j] and | i - j | <= K.
• Iterate through the array and keep track of the indices of each element using a hashmap.

• Check if the current element already exists in the hashmap within a distance of K.

• Return 'Yes' if a pair of such indices exists, otherwise return 'No'.
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

HSBC Value-Based Assessment

Q1. How would you handle a certain situation in your office?
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Technical Round on DS, DBMS, OS, Algorithms, Projects on Resume

Q1. Which data structures are used for implementing an LRU cache?
Ans. 
The data structures used for implementing an LRU cache are doubly linked list and hash map.
• Doubly linked list is used to maintain the order of recently used elements.

• Hash map is used for fast lookups to check if an element is present in the cache or not.

• When a new element is accessed, it is moved to the front of the linked list to indicate it as the most recently used.
Answered by AI
View 1 more answer
Q2. How is a stack different from a queue?
Ans. 
A stack follows Last In First Out (LIFO) order while a queue follows First In First Out (FIFO) order.
• Stack: elements are added and removed from the top (like a stack of plates)

• Queue: elements are added at the rear and removed from the front (like a line of people)

• Stack: push() and pop() operations

• Queue: enqueue() and dequeue() operations

• Example: Undo functionality in text editors (stack) vs. printer queue (queue)
Answered by AI
Add your answer
Q3. What do you understand by functional dependency and transitive dependency in DBMS?
Ans. 
Functional dependency is a relationship between attributes in a database table, while transitive dependency occurs when an attribute is functionally dependent on another attribute.
• Functional dependency: A determines B, where the value of A uniquely determines the value of B.

• Transitive dependency: A determines B, and B determines C, therefore A indirectly determines C.

• Example of functional dependency: Employee ID determ...read more
Answered by AI
Add your answer
Q4. What is normalization and what are the different types of normalization?
Ans. 
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
• Normalization is used to eliminate data redundancy and ensure data integrity.

• There are different normal forms such as 1NF, 2NF, 3NF, BCNF, and 4NF.

• Each normal form has specific rules to follow in order to achieve it.

• For example, 1NF ensures that each column contains atomic values, 2NF eliminates partial depende
Answered by AI
Add your answer
Q5. What is a bootstrap program in an operating system?
Ans. 
A bootstrap program is a small program that initializes the operating system during the boot process.
• Bootstrap program is the first code that runs when a computer is turned on.

• It loads the operating system kernel into memory and starts its execution.

• It performs hardware checks, sets up memory, and initializes system components.

• Examples include GRUB for Linux and NTLDR for Windows.
Answered by AI
View 1 more answer

Round duration - 20 minutes
Round difficulty - Easy

This was a basic HR round with some standard behavioural questions

It was great and easy. Basic Logical aptitude questions.

Two problem statement are provided which you have to solve

Q1. Programming questions were asked to me
Add your answer
Q2. Database questions were asked to me
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Q1. 
Occurrence of Each Word: Problem Statement
You are given a string S consisting of several words. Your task is to count the number of times each word appears in string S. A word is defined as a sequence of...read more
Ans. 
Count the occurrence of each word in a given string.
• Split the string into words using spaces as delimiters.

• Use a hashmap to store the count of each word.

• Iterate through the words and update the count in the hashmap.

• Output each unique word with its occurrence count.
Answered by AI
View 1 more answer

Round duration - 30 minutes
Round difficulty - Easy

Q1. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
Check if two strings are anagrams of each other by comparing their sorted characters.
• Sort the characters of both strings and compare them.

• Use a dictionary to count the frequency of characters in each string and compare the dictionaries.

• Ensure both strings have the same length before proceeding with comparison.

• Handle edge cases like empty strings or strings with different lengths.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Q1. 
Palindromic Substrings Problem Statement
Find the total number of palindromic substrings in a given string STR.
Example:
Input:
"abbc"
Output:
5
Explanation:
The palindromic substrings are: ["a", "...read more
Ans. 
Count the total number of palindromic substrings in a given string.
• Iterate through each character in the string and expand around it to find palindromic substrings.

• Use dynamic programming to store previously calculated palindromic substrings.

• Consider both odd and even length palindromes while counting.

• Example: For input 'abbc', palindromic substrings are ['a', 'b', 'b', 'c', 'bb']. Total count is 5.
Answered by AI
Add your answer
Q2. How can you find the 4th highest salary from a table in a database?
Ans. 
To find the 4th highest salary from a table in a database, you can use a SQL query with the ORDER BY and LIMIT clauses.
• Write a SQL query to select distinct salaries from the table in descending order.

• Use the LIMIT clause to retrieve the 4th row from the sorted list.

• The query would look like: SELECT DISTINCT salary FROM table_name ORDER BY salary DESC LIMIT 3, 1
Answered by AI
Add your answer