Newton School: Pay after Placement React Developer Interview Questions and Answers

ReactJS code machine code like traffic lights

DSA round like two sum and followed by manager round

Q1. Salary negotiation
Add your answer
Q2. How early can start
Ans. 
The candidate can start immediately or as soon as required.
• Candidate can start immediately if needed

• Availability can be discussed during the interview process

• Flexibility in start date is appreciated
Answered by AI
Add your answer

HTML,CSS,JavaScript and React.js questions

Frontend tasks in React.js

Prepare very well for basics

Prepare very well for basics

Prepare well for algorithm

All types of questions asked

DSA ,Algorithm, OOPS, all types of questions asked

Q1. Basic DSA problem and SQL based questions
Add your answer
Q2. What is Indexing in database
Ans. 
Indexing is a technique used to improve the performance of database queries by creating a data structure that allows for faster data retrieval.
• Indexing involves creating a separate data structure that contains a subset of the data in the database, organized in a way that makes it easier to search and retrieve.

• Indexes can be created on one or more columns in a table, and can be either clustered or non-clustered.

• Clustere...read more
Answered by AI
Add your answer
Q3. Basic concepts of unique keys
Add your answer

Q1. DSA problem to print prime number using recursion
Ans. 
Print prime numbers using recursion
• Define a recursive function that takes a number as input

• Check if the number is prime or not

• If it is prime, print it and call the function again with the next number

• If it is not prime, call the function again with the next number

• Stop the recursion when the desired number of prime numbers have been printed
Answered by AI
Add your answer

Q1. Tell me one incident where you failed to complete your task
Add your answer

Q1. Questions on sql, basic linux commands and knowledge in the programming lanugage being interviewed for.
Add your answer

Optimal way of searching from a contacts list. Search by name or number.

Q1. They ask basic php, oops, Laravel question
Add your answer
Q2. Basic sql questions were ask and to write some sql query
Add your answer

Php, html, css, JavaScript, jQuery, website design and development, wordpress

WordPress, website design and development, template integration, php, html, css

Round duration - 120 Minutes
Round difficulty - Easy

It is vesy helpful to learn more about this topic and improve my knowledge in the specific areas

Q1. Puzzle
You are blindfolded and 10 coins are placed in front of you on the table. You are allowed to touch the coins but can’t tell which way up they are by feel. You are told that there are 5 coins head up,...read more
Add your answer
Q2. Time To Burn Tree
You have been given a binary tree of 'N' unique nodes and a Start node from where the tree will start to burn. Given that the Start node will always exist in the tree, your task i...read more
Ans. Using BFS
The idea is to first create an undirected graph of the given binary tree and then doing a bfs traversal of the undirected graph starting from the start node. We will keep a variable ‘count’ that will be incremented at each level of bfs traversal. ‘count-1’ is the required time needed to burn the whole tree.
 
Algorithm
 
• Initialize an unordered map ‘M’ that maps from integer to array of integers that sto...read more
Answered by CodingNinjas
View 1 more answer
Q3. Buy and Sell Stock
You are Harshad Mehta’s friend. He told you the price of a particular stock for the next ‘N’ days. You can either buy or sell a stock. Also, you can only complete at most 2-transactions....read more
Ans. Recursion
This problem can be solved by solving its subproblems and then combining the solutions of the solved subproblems to solve the original problem. We will do this using recursion.
Basically, we have to buy the stock at the minimum possible price and sell at the maximum possible price, keeping in mind that we have to sell the stock before buying it again.
 
 
Below is the detailed algorithm: 
 
1. Call ...read more
Answered by CodingNinjas
View 3 more answers

Round duration - 120 Minutes
Round difficulty - Easy

Q1. Pair Sum
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair eq...read more
Ans. Brute Force
• Initialize a list to store our results.
• For each element in the array 'ARR[i]', check if ('ARR[i]' + ‘ARR[j]’), equals to given sum or not, where ‘i’ < ‘j’ < ‘N’.
• If the condition matches, add the pair('ARR[i]', ‘ARR[j]’) to the list. Sort the list of pairs as per the given output format and return this list.
Space Complexity: O(1)Explanation:
O(1).
 
Constant extra space is required.
Time Complexity: O...read more
Answered by CodingNinjas
View 2 more answers
Q2. Delete middle node
You have been given a singly Linked List of integers. Your task is to delete the middle node of this List.
Note:
1. If there is no middle node in the list to delete, return an empty l...read more
Ans. Count Nodes
The idea is simple and naive. We will first count the total number of nodes in the linked list (say ‘N’). Now, we know that the ceil('N' / 2)^th node is our middle node of the linked list. 
 
So, now we will follow the traditional algorithm for deleting a node from the linked list. We will traverse till the previous node of the node which is going to be deleted, and point the next pointer of the previ...read more
Answered by CodingNinjas
View 1 more answer
Q3. Puzzle
There are 4 persons (A, B, C and D) who want to cross a bridge in night.
1. A takes 1 minute to cross the bridge.
2. B takes 2 minutes to cross the bridge.
3. C takes 5 minutes to cross the bridge.
4. D takes 8 minu...read more
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

Q1. Different Ways To Add Parenthesis
You are given a string 'S' containing an arithmetic expression. Your task is to return all the possible results obtained after putting the valid parenthesis.
It ...read more
Ans. Recursive Brute Force
We will go through the string S from left to right if we encounter an operator we will split S across the operator and recursively solve the expression before the operator and after the operator. Then use the results of the left part and the right part to create the answer for expression.
The algorithm will be-
1. If S is a single integer return the number.
2. We will store the answer in an array/list ANS.
3. ...read more
Answered by CodingNinjas
Add your answer
Q2. General Questions
Why should we hire you?
What projects you have worked on?
Why do you think you will get to do?
Add your answer