Filter interviews by
I applied via Instahyre and was interviewed before Jul 2023. There were 2 interview rounds.
A binary search tree is a data structure where each node has at most two children, with the left child being less than the parent and the right child being greater.
Check if the left child of a node is less than the parent and the right child is greater.
Traverse the tree in-order and check if the values are in sorted order.
Use recursion to check each subtree for validity.
Example: 2 / 1 3 is a valid binary search tr...
I applied via Approached by Company and was interviewed before Feb 2023. There were 3 interview rounds.
Find the number occurring only once in array
Search for a word in a huge list of dictionary
HLD and LLD of Ads Company
Top trending discussions
I applied via Approached by Company and was interviewed before Oct 2022. There were 3 interview rounds.
I applied via Approached by Company and was interviewed in Feb 2022. There were 2 interview rounds.
I applied via Approached by Company and was interviewed before Jul 2021. There were 2 interview rounds.
They given 2 program to to 1-2 hour
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
Test contains 26 questions for me 13 are java based 13 are c++ based
Indexing in DBMS is a technique to improve the performance of queries by creating a data structure that allows for faster retrieval of data.
Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.
Types of indexes include clustered, non-clustered, unique, and composite indexes.
Examples of indexing techniques include B-tree, hash, and bitmap indexes.
Indexing can...
Check if two strings are anagrams by comparing the sorted characters in each string.
Sort the characters in both strings and compare if they are equal.
Ignore spaces and punctuation when comparing the strings.
Example: 'listen' and 'silent' are anagrams.
Example: 'hello' and 'world' are not anagrams.
Use a stack to simulate the recursive inorder traversal process
Create an empty stack to store nodes
Start with the root node and push it onto the stack
While the stack is not empty, keep traversing left and pushing nodes onto the stack
Once you reach a leaf node, pop it from the stack, print its value, and move to its right child
Repeat the process until all nodes have been visited
To make a class final, use the 'final' keyword in the class declaration.
Use the 'final' keyword before the 'class' keyword in the class declaration
A final class cannot be subclassed or extended
Final classes are often used for utility classes or classes that should not be modified
A string is a sequence of characters used to represent text.
Strings are typically enclosed in quotation marks
Strings can contain letters, numbers, symbols, and spaces
Strings can be manipulated using various string functions
An array is a data structure that stores a collection of elements of the same type in a contiguous memory location.
Arrays can be of different types such as integer arrays, float arrays, or string arrays.
Example: string[] names = {"Alice", "Bob", "Charlie"};
Arrays in most programming languages are zero-indexed, meaning the first element is at index 0.
Arrays allow for efficient access and manipulation of elements based o
Very few question asking like time and work
posted on 15 Jan 2025
I applied via Recruitment Consulltant and was interviewed in Dec 2024. There was 1 interview round.
I applied via Campus Placement
90 mins, easy, Data structures and algorithm basics
Remove duplicates from array of strings in place
Use a HashSet to keep track of unique elements
Iterate through the array and remove duplicates by checking if element is already in the HashSet
Update the array in place by shifting elements to fill in the removed duplicates
Caching is the process of storing data in a temporary location to reduce access time and improve performance.
Caching helps reduce the load on servers by serving frequently accessed data quickly
It can improve performance by reducing the time needed to retrieve data from the original source
Examples include browser caching, CDN caching, and database caching
I applied via Naukri.com and was interviewed in Aug 2024. There was 1 interview round.
based on 6 reviews
Rating in categories
Associate
40
salaries
| ₹1.5 L/yr - ₹6 L/yr |
Senior Software Engineer
40
salaries
| ₹11.6 L/yr - ₹40 L/yr |
Software Engineer
36
salaries
| ₹10.1 L/yr - ₹27 L/yr |
Desktop Support Engineer
34
salaries
| ₹1.4 L/yr - ₹1.8 L/yr |
Accounts Manager
32
salaries
| ₹5.2 L/yr - ₹16.2 L/yr |
Innoviti Technologies Private Limited
Freshworks
Zoho
LTIMindtree