Loyalty Juggernaut Interview Questions, Process, and Tips

Q1. House Robber DSA Problem
Ans. 
House Robber DSA Problem involves finding the maximum amount of money you can rob without alerting the police.
• Create a DP array to store the maximum amount of money that can be robbed at each house.

• At each house, decide whether to rob the current house or skip it based on the maximum amount robbed from previous houses.

• Return the maximum amount of money that can be robbed without alerting the police.
Answered by AI
Add your answer
Q2. Mirror Tree DSA Problem
Ans. 
Mirror Tree DSA Problem involves creating a mirror image of a binary tree.
• Create a mirror image of a binary tree by swapping left and right child nodes recursively.

• Use a recursive approach to traverse the tree and swap the child nodes.

• Ensure to handle edge cases like null nodes or single child nodes.
Answered by AI
Add your answer
Q3. Assignment to complete the relevant team
Add your answer

Q1. Factory Design Patter
Add your answer
Q2. OOPs concepts questions
Add your answer

Q1. Asked basic questions on SQL
Add your answer

SQl questions and aptitude questions were given

Q1. I had 2 interview pannels,They had asked me the questions in sql ,statistics,tableau.They had asked me 2 bussiness problems ,asked about the company.Mainly they focused on sql.
Add your answer
Q2. Focused on sql joins
Add your answer
Q3. Groupby functions
Add your answer
Q4. They asked based on sets
Add your answer

Q1. It was my final round with head of the department.He asked me quetions based on the no sql and some other technologies.
Add your answer

Data Structure and Algorithms