Snapdeal Front end Engineer Interview Questions, Process, and Tips

Question are very tough and faad

Question like trees linked list and graphs

1 Hr coding round, Leetcode medium problems like Minimum Grid sum & Basic calculator

Q1. Polyfill for bind Closures Call apply bind let const var lexical environment scope output questions
Add your answer

Q1. Max sum path in tree
Ans. 
Find the maximum sum path in a tree from root to leaf node.
• Start from the root node and traverse down to leaf nodes, keeping track of the sum at each node.

• At each node, compare the sum of the current path with the maximum sum found so far.

• Choose the path with the maximum sum as the final result.
Answered by AI
Add your answer
Q2. Array 2 sum problem
Add your answer

Q1. React: Create a Timer
Ans. 
Create a simple timer using React
• Use state to store the timer value

• Use setInterval to update the timer every second

• Display the timer value in the component's render method
Answered by AI
Add your answer
Q2. Javascript: implement Debounce
Add your answer

Q1. What do you know about the company + common behaviour question
Add your answer
Q2. About roles in previous org
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Mostly focused on Data Structure & Algorithm

Q1. Rotate Linked List
You have been given a Linked List having ‘N’ nodes and an integer ‘K’. You have to rotate the Linked List by ‘K’ positions in a clockwise direction.
Example :
 Given Linked List : 1 2...read more
Ans. Brute Force
Find the length of the Linked List to check whether the ‘K’ is greater than the Length of the Linked List or not. Take a modulo of ‘K’ with its length if it is greater than the length. Reach the (‘K’+1)th node from last and change the pointers of nodes to get a rotated Linked List.
 
Here is the algorithm:
 
1. Base Condition : If ‘HEAD’ is equal to ‘NULL’ or ‘K’ is equal to 0, then return ‘HEAD’ of the L...read more
Answered by CodingNinjas
View 1 more answer
Q2. Reverse the order of words in a string
You are given a string ‘STR’ containing space-separated words. A word is a sequence of non-space characters. Your task is to reverse the order of words in ‘STR’.
No...read more
Ans. Convert to an array of words
Use an array ‘ARR’ to store the words in ‘STR’. Traverse the string ‘STR’ and append each word at the end of ‘ARR’. Use the string ‘RES’ to store the answer. Traverse the array ‘ARR’ in reverse and append the words in ‘ARR’ to ‘RES’ followed by a whitespace character.
 
• Create an empty array of string ‘ARR’.
• Initialize an empty string ‘CUR_STR’. Use it to store a single word from ‘STR’.
• Run...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 50 Minutes
Round difficulty - Medium

JavaScript core concepts with some examples and problem discussion

Q1. Javascript Questions
1) What is currying in Javascript?
2) Explain hoisting with a code snippet.
3) What does this return (typeof null) ?
4) What is callback hell?
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Q1. Basic HR Questions
Why should we hire you?
What keeps you motivated?
Add your answer

Aptitude is generally ask some MCQ choice questions like time, speed, distance etc

Front end developer have some knowledge in HTML CSS javascript php so ask this language

GD is nothing but it's testing our community and quality of thought in your opinion

Q1. Create a pagination
Ans. 
Pagination component to display a list of items with page navigation.
• Create a Pagination component with props for total number of items, items per page, and current page.

• Calculate total number of pages based on total items and items per page.

• Display page numbers with previous and next buttons to navigate through pages.

• Update the list of items displayed based on current page.

• Handle click events on page numbers and previ
Answered by AI
Add your answer

Q1. Write a polyfill of JS promise
Ans. 
A polyfill for JS promise is a piece of code that provides support for promises in older browsers.
• Create a Promise class with resolve, reject, then, and catch methods

• Implement the executor function to handle the asynchronous operation

• Use setTimeout to simulate asynchronous behavior

• Handle chaining of then and catch methods
Answered by AI
Add your answer