Filter interviews by
Be the first one to contribute and help others!
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
I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.
Simple coding questions for 1 hour duration
Implementing hashmap using OOPS involves creating a class with key-value pairs and methods for adding, retrieving, and deleting entries.
Create a class with private data members for storing key-value pairs
Implement methods for adding a key-value pair, retrieving a value by key, and deleting a key-value pair
Use hashing function to map keys to indices in an array for efficient retrieval
Handle collisions by using technique
I applied via Campus Placement and was interviewed in Nov 2023. There were 3 interview rounds.
It had 3 questions, the level was medium hardish
I applied via LinkedIn and was interviewed in Oct 2024. There was 1 interview round.
Write code to return the maximum profit by buying and selling stocks using available money
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 Naukri.com and was interviewed in Oct 2022. There were 2 interview rounds.
Given an array and target, find the index pair of elements the sum becomes target.
Use a hash table to store the difference between target and current element
Check if the difference exists in the hash table
Return the indices of the current element and the difference
90 minutes
hacker Rank plotform
Data structure is a way of organizing and storing data in a computer so that it can be accessed and used efficiently.
Data structures are used to manage large amounts of data efficiently.
They provide a way to organize data in a way that makes it easy to access and manipulate.
Examples of data structures include arrays, linked lists, stacks, queues, trees, and graphs.
A linked list is a linear data structure where each element is a separate object with a pointer to the next element.
Consists of nodes that contain data and a pointer to the next node
Can be singly or doubly linked
Used for dynamic memory allocation, implementing stacks and queues
Example: Singly linked list - 1 -> 2 -> 3 -> null
Example: Doubly linked list - null <- 1 <-> 2 <-> 3 -> null
posted on 9 May 2024
I applied via Campus Placement and was interviewed in Nov 2023. There were 3 interview rounds.
Thirty minutes,basic aptitude concepts
One hour and basic programmming concepts
Proficient in programming languages such as Java, Python, and C++, as well as experience with databases and web development.
Strong knowledge of Java, Python, and C++ programming languages
Experience with databases such as MySQL and MongoDB
Familiarity with web development technologies like HTML, CSS, and JavaScript
I applied via Campus Placement
Low-level design interview
I need to design a Music player app using oops concept
Use an additional stack to store sorted elements and maintain the minimum element at the top of the original stack.
Create a new stack to store sorted elements.
Pop elements from the original stack and compare with the top element of the new stack.
If the popped element is smaller, push it to the new stack. If larger, keep popping from the new stack and push to the original stack until the correct position is found.
Repeat...
A process is an instance of a program running on a computer, while a thread is a smaller unit of execution within a process.
A process has its own memory space, while threads within the same process share memory.
Processes are independent of each other, while threads within the same process can communicate with each other.
Processes are heavyweight, requiring separate memory and resources, while threads are lightweight an...
Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.
Abstract class can have constructor, fields, and methods, while interface cannot have any of these.
A class can implement multiple interfaces but can only inherit from one abstract class.
Abstract class is used to provide a common base for multiple derived classes, while interface is used to define a contract fo...
A race condition is a situation in which the outcome of a program depends on the order of execution of its threads or processes.
Occurs when multiple threads or processes access shared data or resources concurrently
Can lead to unpredictable behavior or bugs in the program
Prevented by using synchronization mechanisms like locks or semaphores
Example: Two threads trying to increment a shared variable simultaneously
Normalization in DBMS is the process of organizing data in a database to reduce redundancy and improve data integrity.
Normalization involves breaking down a database into smaller, more manageable tables.
It helps in reducing data redundancy by storing data in a structured way.
There are different normal forms like 1NF, 2NF, 3NF, BCNF, etc.
Example: In a database of students, instead of storing student details in multiple ...
I applied via Walk-in and was interviewed in Sep 2023. There were 3 interview rounds.
An aptitude has exam used to determine an individual skills a given activity
Data Research Analyst
1.5k
salaries
| ₹1.6 L/yr - ₹8.1 L/yr |
Research Associate
647
salaries
| ₹3 L/yr - ₹7.5 L/yr |
Senior Data Research Analyst
594
salaries
| ₹3.5 L/yr - ₹8.5 L/yr |
Software Engineer
335
salaries
| ₹6.6 L/yr - ₹18 L/yr |
Senior Research Associate
331
salaries
| ₹3.9 L/yr - ₹10.4 L/yr |
Axis Direct
Kotak Securities
FactSet
Sharekhan