Filter interviews by
I applied via Recruitment Consultant and was interviewed in Apr 2021. There were 4 interview rounds.
I applied via Recruitment Consultant and was interviewed before Jan 2021. There were 4 interview rounds.
I appeared for an interview in May 2021.
Round duration - 60 minutes
Round difficulty - Medium
Started with project description, deep dive into project
Questions about ML, Statistics
Coding questions for Python, SQL
You are provided with a list, DICTIONARY[]
, which contains a collection of words, along with a stream of characters (queries). The task is to implement a class Chara...
Implement a class to check if a string formed by the last queried characters exists in a dictionary of words.
Initialize the class with the dictionary of words.
Implement a method to check if the string formed by the last queried characters exists in the dictionary.
Use appropriate data structures to efficiently solve the problem.
Ensure the class handles multiple test cases and character queries.
Example: DICTIONARY[] = ['...
Use a subquery to retrieve the second highest salary from a SQL database.
Use a subquery to select the maximum salary from the table.
Then use another subquery to select the maximum salary that is less than the maximum salary found in the first step.
Combine both subqueries to retrieve the second highest salary.
Round duration - 60 minutes
Round difficulty - Easy
Projects
Machine Learning
Questions about Statistics
Answering aptitude questions related to statistics
Statistics is the study of collecting, analyzing, interpreting, presenting, and organizing data.
Key concepts include mean, median, mode, standard deviation, and probability.
Examples of statistical questions include 'What is the average income of a population?' and 'What is the likelihood of an event occurring?'
Round duration - 60 minutes
Round difficulty - Easy
Behavioral Round
Questions asked about Amazon Leadership Principles
Round duration - 60 minutes
Round difficulty - Easy
Medium Python questions
Medium SQL questions
Calculate the fraction when one integer is divided by another, with repeating decimal parts enclosed in parentheses.
Divide the first integer by the second integer to get the fraction
Identify if the fractional part is repeating and enclose it in parentheses
Return the fraction for each test case
Use SQL query with window functions to find top 2 salaries for each department.
Use PARTITION BY clause to partition the data by department.
Use ORDER BY clause to order the salaries in descending order.
Use ROW_NUMBER() function to assign a rank to each row within the partition.
Filter the results to only include rows with rank 1 and 2.
Tip 1 : Practice String and array based questions for python coding test
Tip 2 : Practice Window Functions, Rank functions for SQL
Tip 3 : Describe the one project that you're confident with and have worked deeply
Tip 1 : Start with projects and then move to skills
Tip 2 : Explain each project in around 3 bullet points
Tip 3 : Include numbers in projects (ex increased x% revenue by applying ... )
I have a strong analytical background, excellent research skills, and a proven track record of delivering high-quality insights.
I have a degree in statistics and experience in data analysis
I have conducted in-depth market research projects for previous employers
I am proficient in using statistical software such as SPSS and R
I am drawn to this organization because of its commitment to cutting-edge research and its positive impact on society.
The organization has a strong reputation for conducting groundbreaking research in various fields.
I admire the organization's dedication to making a positive impact on society through its research initiatives.
I am impressed by the organization's collaborative and innovative approach to problem-solving.
T...
I applied via Company Website and was interviewed in Sep 2023. There was 1 interview round.
Medium to Hard 4 DSA questions
I applied via Approached by Company and was interviewed in Jun 2022. There were 5 interview rounds.
The question asks about calculating cumulative sum of an array and frequency of each word in a sentence.
To calculate cumulative sum of an array, we can use a loop and keep adding the current element to a running sum variable.
To calculate frequency of each word in a sentence, we can split the sentence into words and use a dictionary to keep track of the count of each word.
We can use built-in functions in programming lan...
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I applied via Naukri.com
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
based on 25 reviews
Rating in categories
Research Associate
20
salaries
| ₹3.5 L/yr - ₹5 L/yr |
Research Analyst
9
salaries
| ₹4 L/yr - ₹5 L/yr |
Associate Consultant
8
salaries
| ₹10.8 L/yr - ₹17.2 L/yr |
Consultant
8
salaries
| ₹10 L/yr - ₹20 L/yr |
QA Consultant
7
salaries
| ₹14.3 L/yr - ₹20 L/yr |
Accenture
Capgemini
HCLTech
Teleperformance