i
NoBroker
Filter interviews by
I applied via Walk-in and was interviewed in Mar 2024. There was 1 interview round.
I applied via Recruitment Consulltant and was interviewed in Dec 2022. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Aug 2020. There was 1 interview round.
I come from a close-knit family with a strong emphasis on education and hard work.
My parents instilled in me the values of perseverance and dedication.
Growing up, family dinners were a time for bonding and sharing stories.
My siblings and I were encouraged to pursue our passions and excel in our chosen fields.
I applied via Naukri.com and was interviewed before Dec 2019. There was 1 interview round.
Top trending discussions
posted on 31 Jan 2023
I applied via Referral and was interviewed before Jan 2022. There were 2 interview rounds.
posted on 9 Jun 2022
I applied via Campus Placement and was interviewed in May 2022. There was 1 interview round.
posted on 11 Apr 2024
I applied via LinkedIn and was interviewed before Apr 2023. There were 2 interview rounds.
Designing a metro line for a new station involves planning routes, considering passenger flow, and ensuring connectivity.
Conduct a feasibility study to determine the need for a new station
Consider factors such as population density, traffic patterns, and potential future growth
Plan the route to optimize connectivity with existing stations and transportation hubs
Design the station layout to accommodate passenger flow an...
posted on 3 Jan 2023
I applied via Approached by Company and was interviewed before Jan 2022. There were 2 interview rounds.
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
It was quite easy with basic topics like percentage, profit and loss.
Internet censorship should be implemented or not
90 min, DSA, hacker platform 3 question
2D DP with space optimization is a technique to reduce memory usage while solving dynamic programming problems.
Use a 1D array instead of a 2D array to store values in dynamic programming problems.
Update the values in the 1D array based on the dependencies between subproblems.
Example: Solving the longest common subsequence problem using 2D DP with space optimization.
Breadth First Search (BFS) on a tree involves visiting nodes level by level starting from the root.
Start by visiting the root node, then visit all its children before moving on to the next level
Use a queue data structure to keep track of nodes to visit next
Repeat the process until all nodes have been visited
based on 2 interview experiences
Difficulty level
Duration
based on 59 reviews
Rating in categories
Relationship Manager
825
salaries
| ₹2.5 L/yr - ₹7 L/yr |
Territory Sales Manager
503
salaries
| ₹4.9 L/yr - ₹10 L/yr |
Sales Executive
363
salaries
| ₹2.1 L/yr - ₹6.7 L/yr |
Unit Head
310
salaries
| ₹3.1 L/yr - ₹7 L/yr |
Key Account Manager
241
salaries
| ₹3 L/yr - ₹6 L/yr |
MagicBricks
Nestaway
JLL
CBRE