CBRE
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
I applied via Campus Placement
2 coding question easy to medium level
It was easy based on topic andriod vs ios
Top trending discussions
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...
I applied via Approached by Company and was interviewed before Apr 2023. There was 1 interview round.
I am a software developer with a background in undergraduate and postgraduate studies.
I completed my undergraduate degree in Computer Science at XYZ University.
I pursued my postgraduate studies in Software Engineering at ABC Institute.
I have a strong foundation in programming languages such as Java, Python, and C++.
I have experience working on various projects during my studies, including a web application for a local
I applied via Naukri.com and was interviewed in Jun 2024. There were 3 interview rounds.
It was easy to crack,simple questions asked
They will ask only general topics
It was quite good and easy to crack
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
I applied via Naukri.com and was interviewed in Jan 2024. There was 1 interview round.
Python Intermediate level questions related to dictionary and lists.
I applied via Campus Placement
Asked basics aptitude qns(profit loss,percentage)
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Assistant Manager
1.6k
salaries
| ₹0 L/yr - ₹0 L/yr |
Facility Executive
628
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Facility Manager
518
salaries
| ₹0 L/yr - ₹0 L/yr |
Facility Manager
504
salaries
| ₹0 L/yr - ₹0 L/yr |
Deputy Manager
487
salaries
| ₹0 L/yr - ₹0 L/yr |
JLL
Colliers India
Knight Frank
Cushman & Wakefield