Filter interviews by
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
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
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
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 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
posted on 24 Jun 2024
I applied via Approached by Company and was interviewed in May 2024. There were 4 interview rounds.
Basic array and vectors DSA questions
posted on 29 Apr 2024
I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.
Oops concepts in Java refer to Object-Oriented Programming principles like Inheritance, Polymorphism, Encapsulation, and Abstraction.
Inheritance: Allows a class to inherit properties and behavior from another class.
Polymorphism: Allows objects to be treated as instances of their parent class.
Encapsulation: Bundling data and methods that operate on the data into a single unit.
Abstraction: Hides the implementation detail...
based on 10 reviews
Rating in categories
Data Research Analyst
1.5k
salaries
| ₹1.6 L/yr - ₹8.1 L/yr |
Research Associate
654
salaries
| ₹3 L/yr - ₹8 L/yr |
Senior Data Research Analyst
586
salaries
| ₹3.6 L/yr - ₹8.5 L/yr |
Senior Research Associate
316
salaries
| ₹3.9 L/yr - ₹11 L/yr |
Software Engineer
312
salaries
| ₹6.6 L/yr - ₹17.6 L/yr |
Axis Direct
Kotak Securities
FactSet
Sharekhan