Filter interviews by
The Two Sum problem involves finding two numbers in an array that add up to a specific target sum.
Use a hash map to store numbers and their indices for quick lookup.
Iterate through the array, checking if the complement (target - current number) exists in the hash map.
Example: For nums = [2, 7, 11, 15] and target = 9, return indices [0, 1] since 2 + 7 = 9.
Time complexity is O(n) due to a single pass through the arr...
DBMS stands for Database Management System, while RDBMS stands for Relational Database Management System. RDBMS is a type of DBMS.
DBMS is a software system that allows users to define, create, maintain and control access to the database.
RDBMS is a type of DBMS that stores data in a structured format using tables with rows and columns.
RDBMS enforces a set of rules called ACID properties to ensure data integrity, wh...
Encapsulation, Inheritance, Polymorphism, Abstraction
Encapsulation: Bundling data and methods that operate on the data into a single unit
Inheritance: Ability of a class to inherit properties and behavior from another class
Polymorphism: Ability to present the same interface for different data types
Abstraction: Hiding the complex implementation details and showing only the necessary features
Object oriented programming is a programming paradigm based on the concept of objects, which can contain data and code.
Objects are instances of classes, which define the structure and behavior of the objects.
Encapsulation, inheritance, and polymorphism are key principles of object oriented programming.
Example: Inheritance allows a class to inherit properties and methods from another class.
Example: Encapsulation hi...
What people are saying about HSBC Group
Different types of joins in DBMS include inner join, outer join, left join, right join, and full join.
Inner join: Returns rows when there is a match in both tables.
Outer join: Returns all rows from one table and only matching rows from the other table.
Left join: Returns all rows from the left table and the matched rows from the right table.
Right join: Returns all rows from the right table and the matched rows from...
Stacks are Last In First Out (LIFO) data structures, while Queues are First In First Out (FIFO) data structures.
Stacks: Elements are added and removed from the same end, like a stack of plates. Example: Undo feature in text editors.
Queues: Elements are added at the rear and removed from the front, like a line of people waiting. Example: Print queue in a printer.
Code implementing all 4 pillars of OOPs
Encapsulation: Encapsulate data within classes and provide public methods to access and modify the data.
Inheritance: Create a hierarchy of classes where child classes inherit attributes and methods from parent classes.
Polymorphism: Allow objects of different classes to be treated as objects of a common superclass through method overriding and overloading.
Abstraction: Hide com...
C is a procedural programming language while C++ is an object-oriented programming language.
C is a procedural programming language, while C++ supports both procedural and object-oriented programming.
C does not have classes and objects, while C++ does.
C does not support function overloading, while C++ does.
C does not have exception handling, while C++ does.
C does not have namespaces, while C++ does.
Code to find the 2nd largest element in an array
Sort the array in descending order and return the element at index 1
Iterate through the array and keep track of the two largest elements
Handle edge cases like arrays with less than 2 elements
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them recursively, and then merges them.
Divide the input array into two halves
Recursively sort each half
Merge the sorted halves back together
MCQ test consisting of 70 mcqs in 75 minutes from aptitude english and cs fundamentals. If cleared next paper 2 coding qs medium level
The Two Sum problem involves finding two numbers in an array that add up to a specific target sum.
Use a hash map to store numbers and their indices for quick lookup.
Iterate through the array, checking if the complement (target - current number) exists in the hash map.
Example: For nums = [2, 7, 11, 15] and target = 9, return indices [0, 1] since 2 + 7 = 9.
Time complexity is O(n) due to a single pass through the array.
I faced challenges with integrating third-party APIs and debugging complex logic.
Difficulty in understanding and implementing third-party APIs
Issues with data synchronization between different systems
Troubleshooting complex logic errors
Managing dependencies and version conflicts
Time constraints affecting problem-solving
throw vs throw ex is used in exception handling in C#
throw is used to rethrow the current exception without losing the original stack trace
throw ex is used to throw a new exception while preserving the original exception information
It is recommended to use throw without specifying ex to avoid losing important exception details
I applied via Campus Placement
East to medium level test covering basic aptitude topics and logical reasoning / pattern questions on AON
2 easy to medium level questions that can be solved in either python / cpp/ java
I applied via Campus Placement and was interviewed in Jan 2023. There were 4 interview rounds.
It was just a typical logical reasoning and aptitude MCQ test
There were 2 coding questions and you can select any language for solving it. The test was online
I prefer C++ for its performance, flexibility, and extensive libraries, making it ideal for system-level programming and game development.
Performance: C++ offers low-level memory manipulation, which is crucial for high-performance applications like game engines.
Object-Oriented: C++ supports OOP principles, allowing for better organization and modularity in code, as seen in large software projects.
Standard Template Libr...
C is a procedural programming language while C++ is an object-oriented programming language.
C is a procedural programming language, while C++ supports both procedural and object-oriented programming.
C does not have classes and objects, while C++ does.
C does not support function overloading, while C++ does.
C does not have exception handling, while C++ does.
C does not have namespaces, while C++ does.
Object oriented programming is a programming paradigm based on the concept of objects, which can contain data and code.
Objects are instances of classes, which define the structure and behavior of the objects.
Encapsulation, inheritance, and polymorphism are key principles of object oriented programming.
Example: Inheritance allows a class to inherit properties and methods from another class.
Example: Encapsulation hides t...
Encapsulation, Inheritance, Polymorphism, Abstraction
Encapsulation: Bundling data and methods that operate on the data into a single unit
Inheritance: Ability of a class to inherit properties and behavior from another class
Polymorphism: Ability to present the same interface for different data types
Abstraction: Hiding the complex implementation details and showing only the necessary features
Code implementing all 4 pillars of OOPs
Encapsulation: Encapsulate data within classes and provide public methods to access and modify the data.
Inheritance: Create a hierarchy of classes where child classes inherit attributes and methods from parent classes.
Polymorphism: Allow objects of different classes to be treated as objects of a common superclass through method overriding and overloading.
Abstraction: Hide complex ...
Stacks are Last In First Out (LIFO) data structures, while Queues are First In First Out (FIFO) data structures.
Stacks: Elements are added and removed from the same end, like a stack of plates. Example: Undo feature in text editors.
Queues: Elements are added at the rear and removed from the front, like a line of people waiting. Example: Print queue in a printer.
Code to find the 2nd largest element in an array
Sort the array in descending order and return the element at index 1
Iterate through the array and keep track of the two largest elements
Handle edge cases like arrays with less than 2 elements
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them recursively, and then merges them.
Divide the input array into two halves
Recursively sort each half
Merge the sorted halves back together
DBMS stands for Database Management System, while RDBMS stands for Relational Database Management System. RDBMS is a type of DBMS.
DBMS is a software system that allows users to define, create, maintain and control access to the database.
RDBMS is a type of DBMS that stores data in a structured format using tables with rows and columns.
RDBMS enforces a set of rules called ACID properties to ensure data integrity, while D...
SQL is a standard language for managing databases, while MySQL is a specific open-source relational database management system.
SQL stands for Structured Query Language and is used to communicate with databases.
SQL is a standard language that can be used with various database management systems.
MySQL is a specific open-source relational database management system that uses SQL.
MySQL is one of the most popular database m...
Delete removes specific rows from a table, Truncate removes all rows from a table, and Drop removes the table itself.
Delete is a DML command that removes specific rows from a table based on a condition.
Truncate is a DDL command that removes all rows from a table but keeps the table structure.
Drop is a DDL command that removes the entire table along with its structure.
Different types of joins in DBMS include inner join, outer join, left join, right join, and full join.
Inner join: Returns rows when there is a match in both tables.
Outer join: Returns all rows from one table and only matching rows from the other table.
Left join: Returns all rows from the left table and the matched rows from the right table.
Right join: Returns all rows from the right table and the matched rows from the ...
I applied via Campus Placement
Basic Aptitude and Technical Question
2 coding Questions asked from array and strings
Related to the DSA and concepts of OS and CN
I applied via Campus Placement and was interviewed in Sep 2022. There were 4 interview rounds.
The basic aptitude questions were asked along with technical mcqs
If you clear the 1st round then one coding challenge will be opened the level of question will be moderate it would be on Cocubes
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 applied via LinkedIn and was interviewed before Mar 2023. There were 2 interview rounds.
Basic DSA questions on arrays
I appeared for an interview 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
based on 9 interview experiences
Difficulty level
Duration
based on 27 reviews
Rating in categories
Assistant Manager
2.8k
salaries
| ₹6 L/yr - ₹13.4 L/yr |
Manager
2.2k
salaries
| ₹13.9 L/yr - ₹24 L/yr |
Senior Software Engineer
1.7k
salaries
| ₹13.1 L/yr - ₹23.7 L/yr |
Assistant Vice President
1.7k
salaries
| ₹25 L/yr - ₹42.9 L/yr |
Software Engineer
1.5k
salaries
| ₹7.8 L/yr - ₹14 L/yr |
Wells Fargo
JPMorgan Chase & Co.
Cholamandalam Investment & Finance
Citicorp