Hilton Director Engineering Interview Questions and Answers

Q1. Use of model in laravel
Ans. 
Models in Laravel are used to interact with the database and represent data.
• Models in Laravel are used to perform database operations such as retrieving, inserting, updating, and deleting data.

• Models help in organizing and structuring the data in the application.

• Models in Laravel follow the MVC (Model-View-Controller) pattern.

• Example: Creating a User model in Laravel to interact with the users table in the database.
Answered by AI
Add your answer
Q2. SQL get highest salary for employee
Add your answer

Q1. SQL joins and types of joins
Ans. 
SQL joins are used to combine rows from two or more tables based on a related column between them.
• Types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN.

• INNER JOIN returns rows when there is at least one match in both tables.

• LEFT JOIN returns all rows from the left table and the matched rows from the right table.

• RIGHT JOIN returns all rows from the right table and the matched rows from the left table.

• F...read more
Answered by AI
Add your answer
Q2. What is self join and realted question
Add your answer

Q1. Previous projects and contributions
Add your answer

3 data structure problem with medium to hard level leetcode type.

Q1. 1st question was on vertical order traversal in a tree. it was from gfg he also told me to optimise it
Add your answer
Q2. 2nd question was from leetcode ie meeting rooms ll , medium question
Add your answer

Coding Rond consisted of 3 questions

Q1. 1. Data structures and algorithms
Add your answer
Q2. 2. Computer fundamentals
Add your answer
Q3. Revise all cs fundamentals
Add your answer

It was 1 hour long and was asked to pass all the test cases.

Q1. System Design with basic of OOP and OS
Add your answer

There were 3 coding questions totally based on dsa- hard

Q1. Vertical Traversal
Add your answer
Q2. Find the node with shortest distance
Ans. 
Use Dijkstra's algorithm to find the node with the shortest distance in a graph.
• Implement Dijkstra's algorithm to calculate the shortest distance from a starting node to all other nodes in the graph.

• Select the node with the smallest distance that has not been visited yet as the current node.

• Update the distances of neighboring nodes from the current node if the new distance is smaller than the previously recorded distan...read more
Answered by AI
Add your answer

Q1. Question based on oops
Add your answer
Q2. Question based on OS
Add your answer

Dsa -> questions on trees, linked list, stack, dynamic programming

Leetcode medium to hard

Q1. Rain water trapping
Add your answer
Q2. Bricks and ladder
Add your answer

Polyfills,html,css basics,js intermediate level