Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There were 2 interview rounds.
Front end 5 questions back end 5 questions
Total full stack queries refer to the number of queries made to the full stack of technologies in a web application.
Full stack queries involve interacting with both the front-end and back-end of a web application.
Examples of full stack queries include fetching data from a database, updating user interface elements, and handling form submissions.
Understanding how to optimize full stack queries can improve the performanc
Top trending discussions
I was interviewed before Mar 2016.
posted on 19 Apr 2020
I applied via Company Website and was interviewed in Oct 2019. There were 4 interview rounds.
posted on 31 Oct 2022
I applied via Company Website and was interviewed before Oct 2021. There were 2 interview rounds.
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
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...
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...
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
I applied via Campus Placement and was interviewed before Jul 2023. There were 2 interview rounds.
You have to debug and correct the code given.
I applied via Campus Placement
Basic Aptitude and Technical Question
2 coding Questions asked from array and strings
I was interviewed before May 2021.
Round duration - 90 minutes
Round difficulty - Medium
It was an online assessment with coding and aptitude questions.
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
.
The f...
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'.
Round duration - 15 minutes
Round difficulty - Easy
HSBC Value-Based Assessment
Round duration - 30 minutes
Round difficulty - Easy
Technical Round on DS, DBMS, OS, Algorithms, Projects on Resume
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.
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)
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...
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
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.
Round duration - 20 minutes
Round difficulty - Easy
This was a basic HR round with some standard behavioural questions
Tip 1 : Be sincere and regular
Tip 2 : Practice different types of questions and keep revising
Tip 3 : Make documentation of topics you study and new things/topics/approaches you learn
Tip 1 : Have Projects on Resume
Tip 2 : Be honest in your resume
Tip 3 : Be smart with your resume
I applied via Campus Placement and was interviewed in Apr 2022. There were 4 interview rounds.
It was great and easy. Basic Logical aptitude questions.
Two problem statement are provided which you have to solve
I was interviewed in Nov 2020.
Round duration - 90 minutes
Round difficulty - Easy
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...
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.
Round duration - 30 minutes
Round difficulty - Easy
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...
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.
Round duration - 45 minutes
Round difficulty - Medium
Find the total number of palindromic substrings in a given string STR
.
"abbc"
5
The palindromic substrings are: ["a", "...
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.
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
Tip 1 : Be confident
Tip 2 : Focus on data structures and algorithms(if you have less than 6 months)
Tip 3 : Focus on competitive programming(if you have more than 6 months)
Tip 4 : Practice at least 200 questions of various topics on leetcode and also start doing contest on various platforms.
Tip 1 : You shouldn't lie on your resume.
Tip 2 : Write only those projects about which you are confident.
based on 1 interview
Interview experience
Assistant Vice President
2.3k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
1.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Process Advisor
932
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
826
salaries
| ₹0 L/yr - ₹0 L/yr |
Deutsche Bank
Accenture
Amazon
Deloitte