Filter interviews by
Sharding in MongoDB involves partitioning data across multiple servers to improve scalability and performance.
Sharding is achieved by dividing data into chunks based on a shard key
Each shard contains a subset of the data, distributed across multiple servers
MongoDB's sharding architecture includes config servers, query routers, and shard servers
Sharding can be implemented at the collection level in MongoDB
I am passionate about software development and believe in the company's mission and values.
I admire the company's innovative projects and technologies.
I resonate with the company's culture of collaboration and continuous learning.
I am excited about the opportunity to work with a talented team of developers.
I believe my skills and experience align well with the company's needs.
Top trending discussions
I applied via Naukri.com and was interviewed in Mar 2021. There were 5 interview rounds.
I applied via Naukri.com and was interviewed before Nov 2020. There was 1 interview round.
I applied via Company Website and was interviewed before Jan 2021. There were 5 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
Best wishes to you know that you have to come to the day da
Hi sir I have sent the best for first year and all the best for your reference
I was interviewed before Aug 2016.
I was interviewed before Sep 2020.
Round duration - 45 Minutes
Round difficulty - Easy
The round was conducted at 12 in the college campus. It was a pen and paper based coding round and had 2 coding questions for which we had to write the best approach.
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 the total sum of all elements.
Then iterate again and keep track of the left sum and right sum, checking for equilibrium.
Return the index when left sum equals right sum, or -1 if no equilibrium index found.
You are given a singly linked list of integers. Your task is to sort the linked list using the merge sort algorithm.
Merge Sort is a divide and conq...
Implement merge sort algorithm to sort a singly linked list of integers.
Divide the linked list into two halves using slow and fast pointers.
Recursively sort the two halves.
Merge the sorted halves using a merge function.
Handle base cases like empty list or single node list.
Ensure the termination of the linked list with -1 at the end.
Round duration - 45 Minutes
Round difficulty - Easy
There were 2 coding questions and we had to write the best approach for the questions.
Convert a given string 'S' into its equivalent representation based on a mobile numeric keypad sequence. Using the keypad layout shown in the reference, output the seque...
Convert a given string into its equivalent representation based on a mobile numeric keypad sequence.
Create a mapping of characters to their corresponding numeric keypad sequences.
Iterate through the input string and append the numeric sequence for each character to the output.
Handle lowercase characters only, ignore special characters, capital letters, and spaces in the input string.
You are provided with a string 'STR'
that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...
Generate all possible subsequences of a given string.
Use recursion to generate all possible subsequences by including or excluding each character in the string.
Maintain a current index to keep track of the characters being considered.
Append the current character to each subsequence generated so far.
Recursively call the function with the next index to include the next character in subsequences.
Round duration - 40 minutes
Round difficulty - Easy
The interviewer asked me questions from arrays, strings and linked list.
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to keep track of the longest increasing subsequence ending at each element.
Initialize an array to store the lengths of the longest increasing subsequences.
Iterate through the array and update the lengths based on the previous elements.
Return the maximum length found in the array.
Given an integer N
, determine whether its binary representation is a palindrome.
The first line contains an integer 'T' representing the number of test cases.
The next 'T'...
Check if the binary representation of a given integer is a palindrome.
Convert the integer to binary representation.
Check if the binary representation is a palindrome by comparing it with its reverse.
Return true if it is a palindrome, false otherwise.
Tip 1 : Do at-least 200+ dsa problems from various topics.
Tip 2 : Make 2-3 projects and be well versed with their functionality.
Tip 3 : Practice aptitude questions and time yourself while doing the questions.
Tip 1 : Keep your resume short, try to make it one pager only.
Tip 2 : Mention only position specific projects, and if you have got a good academic score mention it on top.
I applied via Naukri.com and was interviewed before Sep 2019. There were 6 interview rounds.
I applied via Naukri.com and was interviewed in Aug 2020. There were 5 interview rounds.
Interfaces define a contract for classes to implement certain methods and properties.
Interfaces allow for polymorphism and loose coupling.
Classes can implement multiple interfaces.
Interfaces cannot be instantiated on their own.
Interfaces can have default method implementations.
Interfaces can be used to enforce design patterns like the adapter pattern.
I applied via Naukri.com and was interviewed in Sep 2020. There was 1 interview round.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Senior Consultant
217
salaries
| ₹0 L/yr - ₹0 L/yr |
Consultant
202
salaries
| ₹0 L/yr - ₹0 L/yr |
Graphic Designer
169
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
97
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Graphic Designer
70
salaries
| ₹0 L/yr - ₹0 L/yr |
Accenture
IBM iX
Parsh Digital Services
Wipro Digital