Filter interviews by
I was interviewed in Aug 2024.
A React Native-based application.
I applied via LinkedIn and was interviewed before Jan 2024. There were 3 interview rounds.
Aptitude test was simple.
I applied via Campus Placement and was interviewed before Oct 2022. There were 3 interview rounds.
3 Coding question medium level
I applied via Referral and was interviewed in Oct 2023. There were 4 interview rounds.
NEED TO QUALIFY IN THIS TEST
NEED TO QUALIFY THIS TEST ALSO
I applied via Campus Placement and was interviewed before Jul 2022. There were 5 interview rounds.
50 questions in 12 minutes mostly test your arthimetic, logical knowledge.
3 coding questions in 90 mins, 1st one is from arrays an easy question, 2nd one is related to stacks and queues relatively harder and last one is hard which i am also unable to attempt. I cracked the first two questions and my solutions passed all the test cases.
Sorting algorithms are methods used to arrange elements in a specific order.
Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.
Some algorithms are more efficient than others depending on the size of the data set and the initial order of the elements.
For example, quick sort is generally faster than bubble sort for large data sets.
BFS and DFS are traversal algorithms used in trees. BFS explores level by level, while DFS explores depth first.
BFS (Breadth-First Search) visits nodes level by level, using a queue. Example: traversing a binary tree level by level.
DFS (Depth-First Search) explores as far as possible along each branch before backtracking. Example: in-order traversal of a binary tree.
I applied via Campus Placement and was interviewed before Sep 2022. There were 4 interview rounds.
Question from Array,DP
posted on 27 Jan 2017
I was interviewed in Dec 2016.
I was interviewed in May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
This round consisted of DSA questions and they were looking for good coding practices.
Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...
The problem is to assign aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.
Sort the array of stall positions in ascending order.
Use binary search to find the largest minimum distance between cows.
Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.
If it is possible, update the maximum distance and continue binary search for a ...
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
The task is to find the next greater element for each element in the given array.
Iterate through the array from right to left.
Use a stack to keep track of the elements that are greater than the current element.
For each element, pop elements from the stack until a greater element is found or the stack is empty.
If a greater element is found, it is the next greater element for the current element.
If the stack becomes empt...
Round duration - 60 Minutes
Round difficulty - Easy
This round consisted of React related questions, javascript questions.
Tip 1 : Write Production ready code in during the interview
Tip 2 : Study about subjects well.
Tip 1 : Have good explanations of projects.
Tip 2 : Mention about problem solving skills.
based on 1 interview
Interview experience
Business Analyst
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Content Writer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Production Analyst
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Product Manager
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Digital Marketing Executive
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Dailyhunt
Inshorts
ShareChat
Pratilipi