i
NeoSOFT
Filter interviews by
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.
ES6 is the latest version of ECMAScript with new features like arrow functions, classes, and template literals.
Arrow functions provide a more concise syntax for writing functions.
Classes allow for easier object-oriented programming in JavaScript.
Template literals make it easier to work with strings by allowing interpolation and multiline strings.
Deep copy creates a new object with all properties copied, while shallow copy copies references to the original object's properties.
Shallow copy duplicates the top-level properties, but nested objects are shared references.
Example of shallow copy: const shallowCopy = Object.assign({}, originalObject);
Deep copy duplicates all levels of properties, creating entirely new objects.
Example of deep copy: const deepCopy =...
CSS positions include static, relative, absolute, fixed, and sticky.
Static - default position, elements are positioned according to the normal flow of the document
Relative - positioned relative to its normal position
Absolute - positioned relative to the nearest positioned ancestor
Fixed - positioned relative to the viewport
Sticky - acts like a combination of relative and fixed positioning
Virtual DOM is a lightweight copy of the actual DOM that React uses to improve performance by minimizing direct manipulation of the actual DOM.
Virtual DOM is a concept in React where a lightweight copy of the actual DOM is created and updated in memory.
When changes are made to the virtual DOM, React compares it with the actual DOM and only updates the necessary parts, reducing the number of direct manipulations to...
I appeared for an interview in Jan 2025.
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.
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.
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...
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...
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...
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...
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.
I applied via Company Website and was interviewed in Oct 2024. There were 3 interview rounds.
Deep copy creates a new object with all properties copied, while shallow copy copies references to the original object's properties.
Shallow copy duplicates the top-level properties, but nested objects are shared references.
Example of shallow copy: const shallowCopy = Object.assign({}, originalObject);
Deep copy duplicates all levels of properties, creating entirely new objects.
Example of deep copy: const deepCopy = JSON...
ES6 is the latest version of ECMAScript with new features like arrow functions, classes, and template literals.
Arrow functions provide a more concise syntax for writing functions.
Classes allow for easier object-oriented programming in JavaScript.
Template literals make it easier to work with strings by allowing interpolation and multiline strings.
Creating react componont with api integration, list rendering and adding custom filterals
Coding exercise, custom hooks, UI related quetions
Hoisting is a JavaScript mechanism where variable and function declarations are moved to the top of their containing scope during compilation.
Variable declarations are hoisted but not their initializations.
Function declarations are fully hoisted, meaning they can be called before they are declared.
Hoisting can lead to unexpected behavior if not understood properly.
CSS positions include static, relative, absolute, fixed, and sticky.
Static - default position, elements are positioned according to the normal flow of the document
Relative - positioned relative to its normal position
Absolute - positioned relative to the nearest positioned ancestor
Fixed - positioned relative to the viewport
Sticky - acts like a combination of relative and fixed positioning
Semantic tags are HTML tags that clearly define the content they contain for better accessibility and SEO.
Semantic tags provide meaning to the content they enclose, making it easier for search engines to understand the structure of the page.
Examples of semantic tags include
Using semantic tags improves the accessibility of the website for users with disabilities, as screen readers can interp...
Promise chaining is a technique in JavaScript where multiple asynchronous operations are chained together to execute sequentially.
Allows for handling multiple asynchronous operations in a more readable and organized way
Each promise in the chain returns a new promise, allowing for further chaining
Helps avoid callback hell by nesting promises inside each other
Example: promise1.then(result => { return promise2; }).then(re...
Virtual DOM is a lightweight copy of the actual DOM that React uses to improve performance by minimizing direct manipulation of the actual DOM.
Virtual DOM is a concept in React where a lightweight copy of the actual DOM is created and updated in memory.
When changes are made to the virtual DOM, React compares it with the actual DOM and only updates the necessary parts, reducing the number of direct manipulations to the ...
Synthetic events in React are events that are normalized by React to ensure consistent behavior across different browsers.
Synthetic events are instances of the SyntheticEvent object in React.
They are cross-browser compatible and have the same interface as native events.
They are used to handle events like onClick, onChange, etc. in React components.
Example:
Redux is a predictable state container for JavaScript apps.
Redux is a state management tool commonly used with React to manage the application's state in a predictable way.
It helps in maintaining a single source of truth for the state of the entire application.
Redux follows a unidirectional data flow, making it easier to understand how data changes over time.
Actions are dispatched to update the state in Redux, and redu...
Hooks in React are functions that let you use state and other React features without writing a class.
Hooks were introduced in React 16.8.
They allow you to use state and other React features in functional components.
Some commonly used hooks are useState, useEffect, useContext, and useReducer.
useMemo is used for memoizing values, while useCallback is used for memoizing functions.
useMemo is used to memoize a value and only recompute it when its dependencies change.
useCallback is used to memoize a function instance and only re-create it when its dependencies change.
Example: useMemo can be used to memoize the result of a complex computation, while useCallback can be used to memoize a callback function passed t...
Write code to check palindrome no. Sime basic react js task
I applied via Recruitment Consulltant and was interviewed in Aug 2023. There was 1 interview round.
Type is used for defining custom data types in TypeScript, while interface is used for defining object shapes.
Type is more flexible and can be used to define unions, intersections, and primitive types.
Interface is more focused on defining the shape of an object and can be extended or implemented by other interfaces.
Type can also be used to create aliases for existing types, while interface cannot.
Example: type Person =...
Progressive web apps are web applications that provide a native app-like experience to users, with features like offline access and push notifications.
Progressive web apps use modern web capabilities to provide a user experience similar to native apps.
They are reliable, load quickly, and work offline.
They can be installed on the user's device and send push notifications.
Examples include Twitter Lite, Flipkart Lite, and...
Top trending discussions
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
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.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
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
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.
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.
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 ...
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.
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with DSA based questions.
You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.
If the given list is (1 -> -2 -&g...
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.
You are given a binary tree consisting of distinct integers and two nodes, X
and Y
. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...
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.
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...
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
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA
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...
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
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...
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.
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.
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...
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
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.
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.
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.
posted on 24 Jan 2022
I applied via Campus Placement and was interviewed before Jan 2021. There were 3 interview rounds.
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]
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.
posted on 29 Nov 2021
I appeared for an interview before Nov 2020.
Round duration - 90 Minutes
Round difficulty - Medium
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 ...
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...
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.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
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.
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.
Some of the top questions asked at the NeoSOFT React Js Frontend Developer interview -
based on 7 interview experiences
Difficulty level
Duration
based on 2 reviews
Rating in categories
Software Engineer
2.1k
salaries
| ₹3.6 L/yr - ₹14.5 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