Filter interviews by
Clear (1)
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
Top trending discussions
It was test on hacker rank
I applied via Naukri.com and was interviewed in Oct 2024. There were 2 interview rounds.
Online test on hacker rank . difficult level
Assignmemt on sorting array
posted on 5 Oct 2022
A binary tree is a hierarchical data structure in which each node has at most two children.
Consists of nodes connected by edges
Each node can have at most two children, referred to as left child and right child
The left child is smaller than the parent node, while the right child is greater
Used for efficient searching, sorting, and organizing data
To validate an IP address, check if it consists of four numbers separated by periods, each number being between 0 and 255.
Split the IP address string by periods to get an array of four numbers
Check if the array length is 4
Loop through each number in the array and check if it is between 0 and 255
If any number is outside the valid range, the IP address is invalid
I applied via Indeed and was interviewed before Aug 2022. There were 3 interview rounds.
Program to mirror the pixel in a screen matrix of 24 bit pixels
Create a 2D array to represent the screen matrix of pixels
Iterate through each row and swap the pixels from left to right
Ensure to handle the 24 bit pixels properly for mirroring
Example: [[255, 0, 0], [0, 255, 0], [0, 0, 255]] -> [[0, 0, 255], [0, 255, 0], [255, 0, 0]]
3 rounds of coding problems in c++ from various disciplines some relatively easy and some hard
I applied via LinkedIn and was interviewed in Apr 2023. There were 3 interview rounds.
You better prepare for dynamic programming
Max sub array refers to the contiguous subarray within an array that has the largest sum of elements.
Max sub array problem is a common algorithmic problem in computer science.
It involves finding the subarray with the largest sum of elements.
Example: Given array [1, -2, 3, 4, -1, 2, 1, -5, 4], the max sub array is [3, 4, -1, 2, 1] with a sum of 9.
I applied via LinkedIn and was interviewed in Apr 2023. There were 4 interview rounds.
Leetcode hard 2 questions cat chicken problem
Leetcode hard lld questions and mr round
Find the longest increasing subsequence in an array.
Use dynamic programming to solve this problem.
Iterate through the array and keep track of the longest increasing subsequence ending at each index.
Return the maximum length found.
Detecting a cycle in a graph using depth-first search or Floyd's cycle detection algorithm.
Use depth-first search to detect a cycle in a graph by keeping track of visited nodes and checking for back edges.
Alternatively, use Floyd's cycle detection algorithm for detecting a cycle in a linked list or graph.
Example: For a graph with nodes A, B, C, D and edges (A->B, B->C, C->D, D->A), a cycle is detected when visiting nod...
I applied via LinkedIn and was interviewed in Aug 2023. There were 2 interview rounds.
DSA Based questions were asked
posted on 28 Oct 2024
DSA, puzzles, DBMS, OD, and networking
based on 1 interview
Interview experience
AD Operations Specialist
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Manager
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Microsoft Corporation
Amazon