Licious Sde1 Interview Questions and Answers

Hackerrank test with medium questions

Q1. Machine coding round to design a shopping cart
Add your answer

Design splitwise. Low Level question. More like Machine Coding

Question on Strings and DP

Q1. DynamoDB Working
Add your answer
Q2. General Discussion regarding projects in previous firm
Add your answer

Q1. What is clousers
Add your answer
Q2. What is promises
Add your answer

Q1. Explain javascript architecture
Add your answer
Q2. What is mvvm architecture
Add your answer

Questions were crayon box ,the bot and the game and happy neighbourhood for 90 mins

Q1. Array basics was asked
Add your answer
Q2. Segment tree,prefix sum
Add your answer

Q1. Low level design was asked
Add your answer

2 question of DSA (easy, medium) in 60 minutes

Q1. Playlist Shuffle
Add your answer
Q2. Deletion in min heap
Ans. 
Deletion in min heap involves removing the root node and rearranging the heap to maintain the min heap property.
• To delete the root node in a min heap, swap it with the last node in the heap.

• Remove the last node and then heapify the heap starting from the root to maintain the min heap property.

• Example: If the min heap is [10, 20, 30, 25, 40], after deletion the heap becomes [20, 25, 30, 40].
Answered by AI
Add your answer

Q1. Golang specific question regarding worker pool implementation
Add your answer

Q1. He asked to invert a binary tree
Add your answer
Q2. Deep dive in projects
Add your answer
Q3. Asked me indept js questions
Add your answer

DSA Problems from leetcode

Q1. Basics about Android and iOS
Add your answer