Filter interviews by
Basic English grammar questions only
Top trending discussions
I applied via Walk-in and was interviewed before Apr 2020. There were 4 interview rounds.
I applied via Referral and was interviewed in Jul 2020. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed in Apr 2020. There were 4 interview rounds.
I applied via Walk-in and was interviewed before Jun 2020. There was 1 interview round.
I applied via Company Website and was interviewed before Jun 2020. There were 4 interview rounds.
MongoDB database algorithms are used for efficient data storage, retrieval, and processing.
MongoDB uses various algorithms for indexing, sharding, and aggregation.
Indexing algorithms include B-tree, hash, and text search indexes.
Sharding algorithms include range-based, hash-based, and zone-based sharding.
Aggregation algorithms include map-reduce and aggregation pipeline.
MongoDB also uses algorithms for query optimizati
I applied via Walk-in and was interviewed in Sep 2020. There was 1 interview round.
I applied via Walk-in and was interviewed before May 2020. There were 3 interview rounds.
I was interviewed before Dec 2020.
Round duration - 120 Minutes
Round difficulty - Medium
Ninja, a new member of the FBI, has acquired some 'SECRET_INFORMATION' that he needs to share with his team. To ensure security against hackers, Ninja dec...
The task is to encode and decode 'SECRET_INFORMATION' for security purposes and determine if the transmission was successful.
Read the number of test cases 'T'
For each test case, encode the 'SECRET_INFORMATION' and then decode it
Compare the decoded string with the original 'SECRET_INFORMATION'
Print 'Transmission successful' if they match, else print 'Transmission failed'
Round duration - 60 Minutes
Round difficulty - Medium
Given an array Arr
consisting of N integers, your task is to find the equilibrium index of the array.
An index is considered as an equilibrium index if the sum of elem...
Find the equilibrium index of an array where sum of elements on left equals sum on right.
Iterate through the array and calculate prefix sum and suffix sum at each index.
Compare prefix sum and suffix sum to find equilibrium index.
Return the left-most equilibrium index or -1 if none found.
Round duration - 50 Minutes
Round difficulty - Easy
Tip 1 : Focus more on SQL
Tip 2 : Keep up with ongoing projects in the company
Tip 1 : Be honest about what you add.
Tip 2 : Don't forget to mention extra curriculars.
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Data Analyst
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst Intern
3
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Accenture
Wipro
Cognizant