i
91Squarefeet
Filter interviews by
I applied via Approached by Company and was interviewed in Jan 2023. There were 3 interview rounds.
So I was given a real-life case study but the conditions which were presented to me were close to an unrealistic scenario whatever the worst can happen was happening in the case study it really fun and challenging at the same time, they made me feel like I'm definitely not getting selected but at last, they were impressed by me. and how i didn't break with their cross-questions
posted on 27 Jan 2017
I appeared for an interview in Dec 2016.
I applied via Campus Placement and was interviewed before Sep 2020. There was 1 interview round.
I applied via Referral and was interviewed before Feb 2021. There were 2 interview rounds.
I applied via Campus Placement and was interviewed in Jun 2022. There were 5 interview rounds.
50 mcq were asked in 12 mins. Most of the candidates qualified this round.
3 coding questions of basic DSA were asked. Also few mcqs from Operating System, Networking and DBMS.
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
I applied via Referral and was interviewed before Oct 2022. There were 3 interview rounds.
50 questions in 12mins
I applied via Naukri.com and was interviewed before Oct 2022. There were 4 interview rounds.
15 minutes test.
50 questions
easy questions
Management , Leadership , Character Type questions
2 coding questions
resume grilling
easy medium questions
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Project Engineer
27
salaries
| ₹3 L/yr - ₹6.5 L/yr |
Project Manager
18
salaries
| ₹4.9 L/yr - ₹11 L/yr |
Operations Manager
9
salaries
| ₹5.1 L/yr - ₹11.5 L/yr |
HR Manager
7
salaries
| ₹5 L/yr - ₹10 L/yr |
Zonal Manager
7
salaries
| ₹17 L/yr - ₹25 L/yr |
Cogoport
KrazyBee
Treebo Hotels
Woodenstreet.com