AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
NeoSOFT
Compare
Filter interviews by
NeoSOFT React Js Frontend Developer Interview Questions and Answers for Experienced
6 Interview questions
Semantic tags in HTML are specific tags that provide meaning to the content they enclose.
Semantic tags help search engines and screen readers understand the structure of a webpage.
Examples of semantic tags include <header>, <footer>, <nav>, <article>, <section>, <aside>, <main>, <figure>, <figcaption>.
Using semantic tags improves SEO and accessibility of a webs...
Currying is a technique in functional programming where a function with multiple arguments is transformed into a sequence of nested functions, each taking a single argument.
Currying helps in creating reusable functions and partial application.
It allows you to create new functions by fixing some parameters of an existing function.
Example: const add = (a) => (b) => a + b; add(2)(3) will return 5.
Local storage persists even after the browser is closed, while session storage is cleared when the browser is closed.
Local storage has no expiration date, while session storage expires when the browser is closed.
Local storage stores data with no limit, while session storage has a limit of around 5MB.
Local storage data is available across all windows/tabs for that domain, while session storage data is only availabl...
Authentication verifies the identity of a user, while authorization determines the user's access rights.
Authentication confirms the user's identity through credentials like username and password.
Authorization determines what actions the authenticated user is allowed to perform.
Authentication precedes authorization in the security process.
Example: Logging into a website (authentication) and then accessing specific ...
Map creates a new array with the results of calling a provided function on every element, while forEach executes a provided function once for each array element.
Map returns a new array with the same length as the original array, while forEach does not return anything.
Map does not mutate the original array, while forEach can mutate the original array.
Map is more suitable for transforming data and creating a new arr...
A Countdown Timer app built with React to track time remaining for a specified duration.
Use React's useState to manage timer state.
Implement useEffect to handle countdown logic.
Provide input for users to set the countdown duration.
Display the remaining time in a user-friendly format.
Add start, pause, and reset functionality.
NeoSOFT React Js Frontend Developer Interview Experiences for Experienced
3 interviews found
I appeared for an interview in Jan 2025.
(7 Questions)
- Q1. Basic Javascript questions were asked like Hoisting, Event Loop, Closure.
- Q2. What are semantic tags? << HTML based question
- Ans.
Semantic tags in HTML are specific tags that provide meaning to the content they enclose.
Semantic tags help search engines and screen readers understand the structure of a webpage.
Examples of semantic tags include <header>, <footer>, <nav>, <article>, <section>, <aside>, <main>, <figure>, <figcaption>.
Using semantic tags improves SEO and accessibility of a website.
- Q3. What is currying in js?
- Ans.
Currying is a technique in functional programming where a function with multiple arguments is transformed into a sequence of nested functions, each taking a single argument.
Currying helps in creating reusable functions and partial application.
It allows you to create new functions by fixing some parameters of an existing function.
Example: const add = (a) => (b) => a + b; add(2)(3) will return 5.
- Q4. What is the difference between Map and Filter?
- Ans.
Map is used to transform each element of an array, while Filter is used to select elements based on a condition.
Map returns a new array with the same length as the original array, but with each element transformed based on a provided function.
Filter returns a new array with only the elements that pass a provided condition function.
Example for Map: [1, 2, 3].map(num => num * 2) will result in [2, 4, 6].
Example for Fi...
- Q5. What is the difference between Map and ForEach?
- Ans.
Map creates a new array with the results of calling a provided function on every element, while forEach executes a provided function once for each array element.
Map returns a new array with the same length as the original array, while forEach does not return anything.
Map does not mutate the original array, while forEach can mutate the original array.
Map is more suitable for transforming data and creating a new array, w...
- Q6. What is the difference between Authentication and Authorization?
- Ans.
Authentication verifies the identity of a user, while authorization determines the user's access rights.
Authentication confirms the user's identity through credentials like username and password.
Authorization determines what actions the authenticated user is allowed to perform.
Authentication precedes authorization in the security process.
Example: Logging into a website (authentication) and then accessing specific pages...
- Q7. What is the difference between Local storage and Session storage?
- Ans.
Local storage persists even after the browser is closed, while session storage is cleared when the browser is closed.
Local storage has no expiration date, while session storage expires when the browser is closed.
Local storage stores data with no limit, while session storage has a limit of around 5MB.
Local storage data is available across all windows/tabs for that domain, while session storage data is only available wit...
(1 Question)
- Q1. This was the Final round, it lasted for around 30 mins and the interviewer gave me a coding question to build a Countdown Timer app.
- Ans.
A Countdown Timer app built with React to track time remaining for a specified duration.
Use React's useState to manage timer state.
Implement useEffect to handle countdown logic.
Provide input for users to set the countdown duration.
Display the remaining time in a user-friendly format.
Add start, pause, and reset functionality.
Interview Preparation Tips
Also prepare the questions based on HTML, CSS
- Q1. For each and map difference
- Q2. State management tools
- Q3. Scenario based questions
- Q4. Destructuring of object
- Q5. Rest and spread operator
(1 Question)
- Q1. Basic of react, html, css
Write code to check palindrome no. Sime basic react js task
Interview Preparation Tips
By giving interview here. After giving two rounds of interview very well hr will ghost you. They will even bother to tell the status. They will just simply block u r number.my hr name us vidhi shaha. She just blocked my no. Not answering to my calls even not replying to mails. Atleast have courtesy to reply Back. Very unprofessional behaviour.There is no reason to reject me even in interview interviewer was saying good on every ans i gave. And the actual scam is now .u will get call from xyz agency saying that we are hiring for postion u will have to pay u r one month salary. Boom .they were talking about neo soft. Shame on this company. They will not hire real talent.they will hire people through agency.
Top trending discussions
Interview questions from similar companies
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.
- Q1.
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
- 0 - representing an empty cell
- 1 - representing a fre...
- Ans.
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process
Track the time taken to rot all oranges and return -1 if any fresh oranges remain
Handle edge cases like no fresh oranges or all oranges already rotten
Consider using a queue to efficiently process adjacent oranges
- Q2.
Majority Element Problem Statement
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Exampl...
- Ans.
Find the majority element in an array, return -1 if no majority element exists.
Iterate through the array and keep track of the count of each element using a hashmap.
Check if any element's count is greater than floor(N/2) to determine the majority element.
Return the majority element or -1 if no majority element exists.
- Q3.
Maximum Path Sum Between Two Leaves Problem Description
You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...
- Ans.
Find the maximum path sum between two leaf nodes in a binary tree.
Traverse the tree to find the maximum path sum between two leaf nodes.
Keep track of the maximum sum found so far.
Consider all possible paths between leaf nodes.
Handle cases where the tree has only a single leaf node.
Implement a recursive function to calculate the maximum path sum.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with DSA based questions.
- Q1.
N-th Node From The End Problem Statement
You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.
Example:
Input:
If the given list is (1 -> -2 -&g...
- Ans.
Find the N-th node from the end of a Singly Linked List of integers.
Traverse the list to find the length L of the list.
Calculate the position of the N-th node from the beginning as L - N + 1.
Traverse the list again to reach the calculated position and return the node's value.
- Q2.
LCA of Binary Tree Problem Statement
You are given a binary tree consisting of distinct integers and two nodes,
XandY. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes... - Ans.
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other or when one node is the LCA itself.
- Q3.
Reverse Words in a String: Problem Statement
You are given a string of length
N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o... - Ans.
Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.
Split the input string by spaces to get individual words
Reverse the list of words
Join the reversed words with a single space in between
Handle leading/trailing spaces by stripping them before and after reversing
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA
- Q1.
Minimum Time To Solve The Problems
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
- Ans.
Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.
Sort subjects in descending order
Assign subjects to friends one by one until all subjects are assigned
The maximum workload will be the sum of problems assigned to the friend with the most problems
Return the maximum workload as the minimum time required
- Q2. What is grammar in the context of compiler design?
- Ans.
Grammar in compiler design defines the syntax and structure of a programming language.
Grammar specifies the rules for forming valid statements in a programming language.
It consists of a set of production rules that define how valid programs can be constructed.
There are different types of grammars such as context-free grammar, regular grammar, etc.
Example: In C programming language, the grammar specifies that a for loop...
- Q3. What is a token in compiler design?
- Ans.
A token in compiler design is a basic unit of syntax that the compiler can understand and process.
Tokens are the smallest units of a program that are meaningful to the compiler.
Examples of tokens include keywords, identifiers, operators, and punctuation symbols.
Tokens are generated by the lexical analysis phase of the compiler.
Tokens are used by the parser to build the abstract syntax tree of the program.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.
- Q1.
Sum Root to Leaf Numbers
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
- Ans.
Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current path sum to the total sum when reaching a leaf node
Use modulo (10^9 + 7) to handle large outputs
- Q2. What is a regular language?
- Ans.
A regular language is a language that can be recognized by a finite automaton.
Regular languages can be described by regular expressions.
Regular languages are closed under union, concatenation, and Kleene star operations.
Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.
- Q3. What are NP and NP-Hard problems?
- Ans.
NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.
NP problems can be verified in polynomial time but not necessarily solved in polynomial time.
NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.
Examples of NP problems include the subset sum problem and the traveling salesm...
Round duration - 30 minutes
Round difficulty - Easy
That was the round for which I’ve been waiting for hours
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 24 Jan 2022
I applied via Campus Placement and was interviewed before Jan 2021. There were 3 interview rounds.
Interview Questionnaire
3 Questions
- Q1. 1. Write a code to split an array of integers into two subarray where both the array has equal sum.
- Ans.
Code to split an array of integers into two subarrays with equal sum.
Iterate through the array and calculate the total sum.
Divide the sum by 2 to get the target sum for each subarray.
Use dynamic programming to find a subset of the array that adds up to the target sum.
Return the two subarrays.
Example: [1, 2, 3, 4, 5, 6] -> [1, 2, 3, 6], [4, 5]
Example: [1, 2, 3, 4, 5] -> [1, 4, 5], [2, 3]
- Q2. To write code to build up a binary tree from scratch (implement a BST) and then to write all the methods like all the tree traversal algo, and all other stuffs.
- Ans.
Implementing a binary search tree and its traversal methods.
Start by defining a Node class with left and right child pointers.
Implement insert() method to add nodes to the tree.
Implement inorder(), preorder(), and postorder() traversal methods.
Implement search() method to find a node in the tree.
Implement delete() method to remove a node from the tree.
Consider edge cases like empty tree, duplicate nodes, etc.
- Q3. Other OOPs concept and questions related to DSA and OS.
Interview Preparation Tips
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Quantiphi Analytics Solutions Private Limited
Anonymous
posted on 29 Nov 2021
I appeared for an interview before Nov 2020.
(1 Question)
Round duration - 90 Minutes
Round difficulty - Medium
- Q1.
Fruits and Baskets Problem Statement
You are given 'n' fruit trees planted along a road, numbered from 0 to n-1. Each tree bears a fruit type represented by an uppercase English alphabet. A Ninja walking ...
- Ans.
The problem is to find the maximum number of fruits the Ninja can put in both baskets after satisfying given conditions.
The Ninja can start at any tree and end at any tree, but cannot skip a tree.
He can pick one fruit from each tree until he cannot, i.e., when he has to pick a fruit of the third type.
The restriction is that each basket can have only one type of fruit.
We need to find the maximum number of fruits that ca...
(1 Question)
Round duration - 30 Minutes
Round difficulty - Medium
Was Shortlisted For this round with in total of 22 students, 7 in my profile.
It was Technical round with 30 mins of time allotted.
The interviewer was friendly, started with basic questions about me followed by project specific and then a puzzle.
- Q1.
Sort 0 1 2 Problem Statement
Given an integer array
arrof size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.Input:
The first line contains an integer 'T' representing the n... - Ans.
The problem requires sorting an array of 0s, 1s, and 2s in a single scan.
Use three pointers to keep track of the positions of 0s, 1s, and 2s.
Initialize the low pointer at the beginning of the array and the high pointer at the end.
Iterate through the array using a current pointer and swap elements based on their values.
Move the pointers accordingly until the array is sorted.
The time complexity of this solution is O(N) a...
Round duration - 20 Minutes
Round difficulty - Hard
The interview was scheduled for 15 mins and 12 students were shortlisted for this round. 5 in my profile.
The interviewer didn't on his video whereas mine was, the interviewer was friendly and maintained a poker voice.
Asked Basic HR questions but crossed questioned several times.
Interview Preparation Tips
Tip 1 :Practice at least 3-4 coding questions daily. Start from basics of Pointers and Array and progress to Algo and Data structure specific like DP and Graphs. Try to time your sessions into 15-20 mins.
Tip 2 : Have Patience don't rush into problem solving, understand the Algo/Data structure first and then look for common problems for a particular Algo/Data structure.
Tip 3 : Have Basic Knowledge about all CS subjects, no need for in depth. Just cover Top 100 interview questions for each subject and topics covered in GFG and CodeStudio.
Tip 1 : Have at least 3-4 Projects in your resume but on diverse bases, like 1 ML based, 1-2 DBMS 1 with Computer vision/ Frontend. Don't obsess over internships so much.
Tip 2 : Be well verse with projects you put in resume, and specify your particular job role if a team project.
Tip 3 : Mention some extra curricular activities or Interests and hobbies (Non Tech) , if you sync with interviewer then it could be beneficial.
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. Java multithreading, oops
I applied via Campus Placement and was interviewed in May 2022. There were 3 interview rounds.
It was a 1 Hour aptitude test along a few MCQ based questions on DSA.
(6 Questions)
- Q1. The interview was held online. The interview first asked me to explain any one of my projects.
- Q2. Asked a a few basic question of DSA like difference between quick and merge sort. Time complexities of a few algorithms. Real life application of Trees.
- Q3. A few basic questions related to OOPs
- Q4. Find missing numbers in a list in Python. (He asked me a few concepts related to Python since most of my projects were made in that)
- Ans.
Identify and return missing numbers from a given list in Python using various methods.
Use a set to find missing numbers: Convert the list to a set and compare with a complete set of numbers.
Example: Given list [1, 2, 4, 6], complete set is {1, 2, 3, 4, 5, 6}. Missing: {3, 5}.
Utilize list comprehension: Create a list of numbers in the range and filter out those present in the original list.
Example: [n for n in range(1, ...
- Q5. If A,B both classes have a function with same name (lets say the name of function id FUN) and C is a child of both. So, if FUN is called for C what will happen in Python and in C++.
- Ans. Will give an error in C++, But will call FUN from whichever parent was declared first in Python
- Q6. He also asked me to implement quick sort
- Ans.
Quick sort is an efficient sorting algorithm that uses a divide-and-conquer approach to sort elements in an array.
1. Choose a 'pivot' element from the array. Example: In [3, 6, 8, 10, 1, 2, 1], choose 6 as pivot.
2. Partition the array into two sub-arrays: elements less than the pivot and elements greater than the pivot.
3. Recursively apply the above steps to the sub-arrays. Example: [3, 1, 2] and [8, 10] after partitio...
Interview Preparation Tips
- OOPS
Learn the concepts of OOPs.
I applied via Referral and was interviewed in Jan 2024. There was 1 interview round.
(1 Question)
- Q1. All about java 8 and collections
Interview Preparation Tips
Selected
I applied via Approached by Company and was interviewed before Mar 2023. There was 1 interview round.
(1 Question)
- Q1. C++,oopsand STL concepts Coding for linked list and bfs and dfs
Interview Preparation Tips
NeoSOFT Interview FAQs
Some of the top questions asked at the NeoSOFT React Js Frontend Developer interview for experienced candidates -
Tell us how to improve this page.
NeoSOFT Interviews By Designations
- NeoSOFT Software Engineer Interview Questions
- NeoSOFT Software Developer Interview Questions
- NeoSOFT Senior Software Engineer Interview Questions
- NeoSOFT Java Developer Interview Questions
- NeoSOFT Full Stack Developer Interview Questions
- NeoSOFT PHP Developer Interview Questions
- NeoSOFT Angular Frontend Developer Interview Questions
- NeoSOFT DOT NET Developer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Front end Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Junior Software Developer Interview Questions
- UI Developer Interview Questions
- Angular Frontend Developer Interview Questions
- Angular Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 3 interview experiences
Difficulty level
Duration
React Js Frontend Developer Interview Questions from Similar Companies
NeoSOFT React Js Frontend Developer Reviews and Ratings
based on 2 reviews
Rating in categories
|
Software Engineer
2.1k
salaries
|  ₹5.2 L/yr - ₹12 L/yr |
|
Software Developer
724
salaries
| ₹3.5 L/yr - ₹13.4 L/yr |
|
Senior Software Engineer
717
salaries
| ₹6.1 L/yr - ₹23 L/yr |
|
Softwaretest Engineer
504
salaries
| ₹3 L/yr - ₹10.4 L/yr |
|
Front end Developer
190
salaries
| ₹2.4 L/yr - ₹12 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant
- Home >
- Interviews >
- NeoSOFT Interview Questions >
- NeoSOFT Interview Questions for Experienced
