Filter interviews by
I applied via Referral and was interviewed before Nov 2021. There were 3 interview rounds.
Top trending discussions
posted on 1 Oct 2024
I applied via Campus Placement
DP graphs strings it was good
Reverse a linked list by changing the direction of pointers
Start with three pointers: current, previous, and next
Iterate through the list, updating pointers to reverse the direction
Return the new head of the reversed list
The Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones.
Start with two variables initialized to 0 and 1
Loop through desired number of iterations, adding the previous two numbers to get the next number
Print or store each number in the series
Quants, DSA, Logical, Analytical, OS, DBMS
posted on 17 May 2024
I applied via campus placement at Dwarkadas J Sanghvi College of Engineering, Mumbai and was interviewed in Nov 2023. There were 5 interview rounds.
Quant Topics: Interests, Sequence and Series along with Missing items, Time and Distance/Work,
Verbal Topics: Comprehension, Corrections, Grammar etc
CS Core Subjects: DSA, OOPS, DBMS, OS
Overall Test Difficulty was Easy-Medium
System asked to choose one of the programming languages from C, C++ or Java. (Note: You can't change the language once confirmed!)
There were 7 different coding questions along with code. You just need to debug the code to get the correct output.
DSA: Graphs (Basics), Linked Lists, Conditional Statements, and Arrays (Stack and Queue)
Overall Difficulty was Medium (tbh, it depends on the practice you have done!)
General apti questions
Work-life balance and career progression
I applied via campus placement at Indian Institute of Technology (IIT), Kharagpur and was interviewed in Nov 2022. There were 4 interview rounds.
The coding test comprised 4 questions, held on the Hackerank platform. The time-bound was 90 minutes. I would rate the questions as easy, medium, medium, and hard. You had to solve at least 3 and 80% of the test cases of the last question to qualify for the last round.
Polymorphism is the ability of an object to take on many forms. Types include compile-time, runtime, and ad-hoc polymorphism.
Compile-time polymorphism is achieved through function overloading and templates.
Runtime polymorphism is achieved through inheritance and virtual functions.
Ad-hoc polymorphism is achieved through operator overloading and function templates.
Polymorphism allows for code reusability and flexibility ...
Contributed to open source communities by developing and maintaining projects.
Developed and maintained a Python package for data analysis and visualization
Contributed to a popular JavaScript library by fixing bugs and adding new features
Participated in open source hackathons and contributed to various projects
Provided support and guidance to new contributors in the community
I applied via Naukri.com and was interviewed in Jul 2022. There were 4 interview rounds.
HashMap is faster than TreeMap wrto performance due to its constant time complexity for most operations.
HashMap has O(1) time complexity for most operations while TreeMap has O(log n) time complexity.
HashMap is implemented using an array of buckets while TreeMap is implemented using a Red-Black Tree.
HashMap is preferred for frequent read operations while TreeMap is preferred for frequent write operations.
HashMap is uno...
Yes, it is possible to write a try catch block inside a catch block.
This is called nested try-catch block.
It is useful when we want to handle different types of exceptions in different ways.
Example: try { //code } catch (ExceptionType1 e1) { try { //code } catch (ExceptionType2 e2) { //code } } }
It is important to avoid excessive nesting as it can make the code difficult to read and maintain.
Yes, multiple exceptions can be caught in a single catch block separated by commas.
Multiple exceptions can be caught in a single catch block separated by commas.
This can be useful when handling different types of exceptions in a similar way.
For example: catch (IOException | SQLException ex) { // handle exception }
I was interviewed in Mar 2022.
Round duration - 90 minutes
Round difficulty - Medium
2 programming questions, MCQs based on OS, DBMS, OOPS and web fundamentals
Given a 2D matrix MAT
of size M x N, where M and N represent the number of rows and columns respectively. Each row is sorted in non-decreasing order, and the first element of each ro...
We have a brute force solution to this problem. We can simply traverse the matrix and check if ‘TARGET’ exists or not.
Space Complexity: O(1)Explanation:O(1)
Since, we are not using any extra space to find the number of pairs. Therefore, the overall space complexity will be O(1).
Time Complexity: O(m*n) - For 2d arraysExplanation:O(M*N) where ‘M’ and ‘N’ denote the number of rows and columns in ‘M...
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
One way is to use recursion to reverse the list. Divide the linked list in two halves, the first node and the rest of the list. Reverse the second half using recursion and append the first half, that is the first node at the end of the reversed linked list. Return the head of the reversed linked list.
Algorithm
Round duration - 40 minutes
Round difficulty - Easy
This round had 2 coding questions and some basic questions revolving around OOPs
Given a singly linked list of integers, determine if it is a palindrome. Return true if it is a palindrome, otherwise return false.
1 -> 2 -...
Given a Binary Tree with integer nodes, determine the maximum level sum among all the levels in the tree. The sum for a level is defined as the sum of all node values pr...
Let’s traverse the given Binary tree using Recursion.The idea is to recursively store the sum of nodes of every level separately in a map.
Round duration - 30 minutes
Round difficulty - Easy
Was conducted a couple of hours after the previous Tech round. The round was a HR one, behavioral questions and discussion around my hobbies :)
Tip 1 : Be very thorough with your resume. You will be properly grilled.
Tip 2 : Be clear with the basics of atleast one programming language, and have competitive programming experience
Tip 3 : Have projects in your resume from different domains. For a fresher, HSBC looks for a jack of all trades instead of a master of one, so having projects in different domains with be greatly beneficial
Tip 1 : Have multiple projects
Tip 2 : Have a decent skillset, with good educational background
I applied via campus placement at Indian Institute of Technology (IIT), Guwahati and was interviewed in Nov 2021. There were 3 interview rounds.
I applied via Referral and was interviewed in Apr 2021. There were 4 interview rounds.
Weak reference is a reference that does not prevent the object from being garbage collected.
Weak references are used to refer to objects that can be garbage collected if there are no strong references to them.
They are typically used in scenarios where you want to hold a reference to an object, but don't want to prevent it from being collected.
Weak references are implemented using weak reference queues, which allow you ...
Singleton pattern ensures a class has only one instance, while allowing global access to it.
Implement a private constructor to prevent direct instantiation.
Create a static method to provide a single point of access to the instance.
Use lazy initialization to create the instance only when needed.
Ensure thread safety in a multithreaded environment using synchronization or double-checked locking.
Breaking the singleton patt...
Annotations used in Spring Framework for defining components and services.
Annotations like @Component, @Service, and @Controller are used for defining components in Spring Framework.
@RestController is used for defining RESTful web services.
@Configuration is used for defining configuration classes.
@Transactional is used for defining transactional methods.
All these annotations help in defining and managing dependencies i
HashSet is implemented using a HashMap internally. Same hashcode is generated when two objects have the same value for hashCode() and equals() methods.
HashSet internally uses a HashMap to store its elements.
The hashcode of an object is generated using the hashCode() method.
If two objects have the same value for hashCode() and equals() methods, they will generate the same hashcode.
For example, if two String objects have...
SQL Cursor is a database object used to manipulate data row by row.
Cursor is used to fetch and process data row by row
Index is a database object used to speed up data retrieval
Aggregate functions are used to perform calculations on a set of values
Examples of aggregate functions are SUM, AVG, COUNT, MAX, MIN
Generate palindrome string with given length and distinct characters.
Create a char array of length n and fill it with distinct characters.
Loop through the array and add the characters in reverse order to create a palindrome.
Repeat the process until the required number of palindromes are generated.
If k is less than the length of the palindrome, use the first k distinct characters.
Find the highest value that occurs the same number of times within an array.
Iterate through the array and count the occurrences of each value.
Store the counts in a dictionary or hash map.
Find the maximum count and check which value(s) have that count.
Return the highest value among those with the maximum count.
Count occurrences of a character in a string and output in a specific format.
Use a hash table to store the count of each character.
Loop through the string and update the count in the hash table.
Create the output string using the hash table.
Converts a string from Camel case to Snake case.
Loop through the string and check for uppercase letters
Insert an underscore before each uppercase letter
Convert the string to lowercase
Logic to get Map using Stream API to show balance of each person
Use Stream API to group accounts by name
Use map() to get the sum of balances for each group
Collect the results into a Map
based on 1 review
Rating in categories
Branch Manager
11
salaries
| ₹3.5 L/yr - ₹4.2 L/yr |
Business Analyst
9
salaries
| ₹6 L/yr - ₹12 L/yr |
Area Manager
9
salaries
| ₹4.5 L/yr - ₹7.4 L/yr |
Field Officer
7
salaries
| ₹1 L/yr - ₹2.2 L/yr |
HR Executive
7
salaries
| ₹2.5 L/yr - ₹3.8 L/yr |
Bajaj Finance
HDFC Bank
ICICI Bank
Kotak Mahindra Bank