Filter interviews by
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
It was test on hacker rank
Top trending discussions
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
Design Parking - at C# ~ hour
Sliding Window and Dynamic Programming questions
Very easy question over online platform
I applied via Company Website and was interviewed in Mar 2024. There was 1 interview round.
I applied via LinkedIn and was interviewed in Mar 2024. There was 1 interview round.
2 medium/hard level algorithm questions
Leetcode medium - given an array of words, determine how many
I applied via Referral and was interviewed in Mar 2023. There were 4 interview rounds.
The first round is OA and the majority questions are from leet code or similar
Find the longest substring with at most k distinct characters.
Use a sliding window approach to keep track of the distinct characters in the substring.
Keep track of the start and end indices of the current substring.
Update the start index of the substring when the number of distinct characters exceeds k.
Update the end index of the substring and the length of the longest substring when a new longest substring is found.
based on 1 review
Rating in categories
Trust and Safety Specialist
73
salaries
| ₹5.5 L/yr - ₹9 L/yr |
Senior Software Engineer
60
salaries
| ₹20 L/yr - ₹86.5 L/yr |
Software Engineer
59
salaries
| ₹12.4 L/yr - ₹53.8 L/yr |
Content Reviewer
37
salaries
| ₹3.6 L/yr - ₹9.9 L/yr |
Account Director
31
salaries
| ₹15 L/yr - ₹39 L/yr |
Microsoft Corporation
Amazon