Filter interviews by
I appeared for an interview in Feb 2025.
DSA questions - 2, SQL - 1
DSA questions - 2, SQL - 1
Test has three questions
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development
Strong problem-solving skills
Team player with excellent communication skills
I have a strong technical background, a passion for software development, and a proven track record of delivering high-quality projects.
Strong technical skills in programming languages such as Java, Python, and C++
Experience with software development projects, including creating web applications and mobile apps
Proven ability to work well in a team and communicate effectively with stakeholders
Passion for learning and st...
I applied via Campus Placement and was interviewed in Aug 2022. There were 3 interview rounds.
Technical MCQ and coding (medium)
This was long programing round. In this you need to design a application. First you need do ER or class diagram. Then you need code in any programing language but OOPS is prefered. They see is app is scalable and data modeling
Sorting a stack data structure and its real-life example
Sorting a stack involves popping elements and comparing them to the remaining elements in the stack
Real-life example: arranging books on a shelf in alphabetical order
Another example: sorting a deck of cards by suit and rank
Find an odd occurring number among even occurring numbers.
Use XOR operation to cancel out even occurring numbers and get the odd occurring number.
Iterate through the array and XOR each element with the result variable.
The final result will be the odd occurring number.
Print the spiral order of a binary tree and matrix.
For binary tree, use level order traversal and alternate direction for each level.
For matrix, use four pointers to traverse in spiral order.
Example for binary tree: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9
Example for matrix: 1 2 3 4 -> 8 7 6 5 -> 9 10 11 12 -> 16 15 14 13
Finding pairs in an array with a given sum.
Iterate through the array and for each element, check if the difference between the given sum and the element exists in the array.
Use a hash table to store the elements of the array and their indices for faster lookup.
If there are multiple pairs with the same sum, return any one of them.
If no pair is found, return null or an empty array.
Find total number of k element with given avg in an array in minimum time complexity.
Use sliding window technique to traverse the array in O(n) time complexity.
Maintain a sum variable to keep track of the sum of elements in the window.
If the sum of elements in the window is equal to k times the given avg, increment the count.
Move the window by subtracting the first element and adding the next element in the array.
Printing non-boundary elements of a binary tree
Traverse the tree in any order (preorder, inorder, postorder)
Check if the current node is not a boundary node (not the first or last node in its level)
If it is not a boundary node, print its value
Recursively traverse its left and right subtrees
Prototyping in JavaScript allows for quick and easy creation of new objects and functions.
Prototyping allows for inheritance and sharing of properties and methods.
New objects can be created using the 'new' keyword and the prototype of an existing object.
Functions can also be prototyped to add new methods or properties.
Example: function Person(name) { this.name = name; } Person.prototype.greet = function() { console.log...
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
Basic Arithmetic Aptitude , Computer Application and SQL
A fitness tracking application to monitor and track user's physical activities and progress.
Include features like tracking steps, calories burned, distance traveled, and workout sessions.
Allow users to set goals, view progress charts, and receive notifications for reminders.
Integrate with wearable devices like Fitbit or Apple Watch for real-time data syncing.
Provide social sharing options to motivate users and compete ...
I appeared for an interview in Feb 2025.
Duration 3 hours topics medium level coding from hackerearth
A linked list is a data structure where each element points to the next element in the sequence.
Consists of nodes connected by pointers
Can be singly linked (each node points to the next) or doubly linked (each node points to the next and previous)
Allows for dynamic size and efficient insertion/deletion operations
Hacker earth problem
I applied via Recruitment Consulltant and was interviewed in Aug 2024. There was 1 interview round.
1 hour 10 mins, MERN Stack, Face to Face. Mongodb, medium DSA Question, callback, eventloop, NodeJS asynchronous working
I appeared for an interview in Jul 2024.
Static function is a function that can only be accessed within the same file, while a static variable is a variable that retains its value between function calls.
Static function is declared using the 'static' keyword before the return type, limiting its scope to the file it is defined in.
Static variable is declared using the 'static' keyword before the variable type, retaining its value between function calls.
Example o...
Synchronization technique is a method used to control access to shared resources in a multi-threaded environment.
Synchronization techniques prevent race conditions and ensure data consistency
Common synchronization techniques include locks, semaphores, and monitors
Examples include using synchronized keyword in Java or mutex in C++
Add an element to a linked list.
based on 2 interviews
Interview experience
Associate
490
salaries
| ₹9 L/yr - ₹36.7 L/yr |
Senior Associate
481
salaries
| ₹16 L/yr - ₹60 L/yr |
Analyst
229
salaries
| ₹5.1 L/yr - ₹20 L/yr |
Vice President
206
salaries
| ₹22 L/yr - ₹94 L/yr |
Data Analyst
66
salaries
| ₹2.4 L/yr - ₹10 L/yr |
SBI Cards & Payment Services
Axis Direct
Kotak Securities
FactSet