Yulu Bikes Fullstack Developer Intern Interview Questions and Answers

Computer Fundamentals

Q1. Flatten a binary tree
Ans. 
Flatten a binary tree by converting it into a linked list in-place.
• Use a recursive approach to flatten the binary tree.

• Traverse the tree in a pre-order manner and keep track of the previous node.

• Set the left child of each node to null and the right child to the next node in the linked list.

• Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
Answered by AI
Add your answer

Good and nice and it was well organized.

Q1. What was ur experience?
Ans. 
I have over 5 years of experience in front end development, working on various projects and technologies.
• Developed responsive websites using HTML, CSS, and JavaScript

• Worked with frameworks like React and Angular to build interactive user interfaces

• Optimized website performance and implemented SEO best practices

• Collaborated with designers and backend developers to deliver high-quality products
Answered by AI
Add your answer

Q1. Questions were mostly around motivation
Add your answer
Q2. What is the long term vision for the career?
Add your answer
Q3. Why do you want to work in a startup?
Add your answer

Given a coding assignment to build the backend of an application.

Q1. Past experience
Add your answer
Q2. How much da u know
Add your answer

Q1. Merge sort in js
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them, and then merges the sorted halves.
• Divide the array into two halves recursively

• Sort each half using merge sort recursively

• Merge the sorted halves back together
Answered by AI
Add your answer
Q2. Hoising based question
Add your answer

It was a campus placement with an assignment to make an app.

Q1. Android basics questions
Add your answer
Q2. Questions related to assignment
Add your answer