Porter Front end Developer Interview Questions and Answers

Question are very tough and faad

Question like trees linked list and graphs

Round duration - 60 Minutes
Round difficulty - Medium

Mostly focused on Data Structure & Algorithm

Q1. 
Rotate Linked List Problem Statement
Given a linked list consisting of 'N' nodes and an integer 'K', your task is to rotate the linked list by 'K' positions in a clockwise direction.
Example:
Input:
Li...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 Anonymously
Add your answer
Q2. 
Reverse Words in a String
Given a string STR consisting of words separated by spaces, reverse the order of words in STR.
Note:
A word is defined as a sequence of non-space characters. Attempt to perform...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 Anonymously
View 1 more answer

Round duration - 50 Minutes
Round difficulty - Medium

JavaScript core concepts with some examples and problem discussion

Round duration - 30 Minutes
Round difficulty - Easy

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

Coding test in javascript

Q1. React js questions
Add your answer
Q2. Angular js questions
Add your answer

Question are very tough and faad

Question like trees linked list and graphs

Round duration - 60 Minutes
Round difficulty - Medium

Mostly focused on Data Structure & Algorithm

Q1. 
Rotate Linked List Problem Statement
Given a linked list consisting of 'N' nodes and an integer 'K', your task is to rotate the linked list by 'K' positions in a clockwise direction.
Example:
Input:
Li...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 Anonymously
Add your answer
Q2. 
Reverse Words in a String
Given a string STR consisting of words separated by spaces, reverse the order of words in STR.
Note:
A word is defined as a sequence of non-space characters. Attempt to perform...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 Anonymously
View 1 more answer

Round duration - 50 Minutes
Round difficulty - Medium

JavaScript core concepts with some examples and problem discussion

Round duration - 30 Minutes
Round difficulty - Easy

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

Q1. How to detect and prevent Memory leak
Ans. 
Memory leaks can be detected and prevented by monitoring memory usage, using memory profiling tools, avoiding circular references, and properly managing event listeners.
• Monitor memory usage regularly to identify any abnormal increases.

• Use memory profiling tools like Chrome DevTools or Valgrind to analyze memory usage.

• Avoid creating circular references in your code, as they can prevent objects from being garbage collect...read more
Answered by AI
Add your answer

Q1. Advanced JS questions
Add your answer