i
NeoSOFT
Filter interviews by
Promises are objects representing the eventual completion or failure of an asynchronous operation.
Promises are used to handle asynchronous operations in JavaScript.
They can be in one of three states: pending, fulfilled, or rejected.
Promises can be chained using .then() to handle success and .catch() to handle errors.
RxJS is a library for reactive programming using Observables to handle asynchronous data streams.
RxJS stands for Reactive Extensions for JavaScript.
It allows you to work with asynchronous data streams and handle events.
RxJS provides operators to transform, filter, combine, and create observables.
Example: Using RxJS to handle user input events in a web application.
Authentication verifies the identity of a user, while authorization determines what a user can access.
Authentication confirms the user's identity through credentials like passwords or biometrics
Authorization controls the user's access to resources or features based on their identity and permissions
Example: Logging into a website with a username and password is authentication, while being able to view/edit specific...
final is a keyword in Java used to declare constants, while finalize is a method in Java used for cleanup operations.
final is used to declare constants in Java
final variables cannot be reassigned
finalize is a method in Java used for cleanup operations before an object is garbage collected
Expected CTC should be based on industry standards, experience, skills, and location.
Research industry standards for Full Stack Developers in the specific location
Consider your experience level and skills when determining expected CTC
Factor in the cost of living in the location where the job is based
Be prepared to negotiate based on the job responsibilities and benefits offered
CTC from previous employer is confidential information.
CTC from previous employer is considered confidential
It is not appropriate to disclose salary details from previous job
Focus on discussing your skills and experiences instead of previous salary
Cloning is the process of creating an exact copy of an object or organism.
There are two main types of cloning: reproductive cloning and therapeutic cloning.
Reproductive cloning involves creating a genetically identical copy of an organism, such as Dolly the sheep.
Therapeutic cloning is the process of creating embryonic stem cells for medical research and treatment.
Cloning can also refer to making copies of softwar...
I applied via Naukri.com and was interviewed in Jun 2024. There was 1 interview round.
Authentication verifies the identity of a user, while authorization determines what a user can access.
Authentication confirms the user's identity through credentials like passwords or biometrics
Authorization controls the user's access to resources or features based on their identity and permissions
Example: Logging into a website with a username and password is authentication, while being able to view/edit specific page...
Promises are objects representing the eventual completion or failure of an asynchronous operation.
Promises are used to handle asynchronous operations in JavaScript.
They can be in one of three states: pending, fulfilled, or rejected.
Promises can be chained using .then() to handle success and .catch() to handle errors.
RxJS is a library for reactive programming using Observables to handle asynchronous data streams.
RxJS stands for Reactive Extensions for JavaScript.
It allows you to work with asynchronous data streams and handle events.
RxJS provides operators to transform, filter, combine, and create observables.
Example: Using RxJS to handle user input events in a web application.
I applied via Job Portal and was interviewed in Apr 2024. There were 3 interview rounds.
CTC from previous employer is confidential information.
CTC from previous employer is considered confidential
It is not appropriate to disclose salary details from previous job
Focus on discussing your skills and experiences instead of previous salary
Expected CTC should be based on industry standards, experience, skills, and location.
Research industry standards for Full Stack Developers in the specific location
Consider your experience level and skills when determining expected CTC
Factor in the cost of living in the location where the job is based
Be prepared to negotiate based on the job responsibilities and benefits offered
Coding test in javascript and question related to the tech stack
Cloning is the process of creating an exact copy of an object or organism.
There are two main types of cloning: reproductive cloning and therapeutic cloning.
Reproductive cloning involves creating a genetically identical copy of an organism, such as Dolly the sheep.
Therapeutic cloning is the process of creating embryonic stem cells for medical research and treatment.
Cloning can also refer to making copies of software or ...
final is a keyword in Java used to declare constants, while finalize is a method in Java used for cleanup operations.
final is used to declare constants in Java
final variables cannot be reassigned
finalize is a method in Java used for cleanup operations before an object is garbage collected
I applied via Naukri.com and was interviewed in Jan 2023. There were 4 interview rounds.
Coding test is medium level.easy question of array and sorting
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.
based on 6 interview experiences
Difficulty level
Duration
based on 7 reviews
Rating in categories
Software Engineer
2.1k
salaries
| ₹5.2 L/yr - ₹12 L/yr |
Senior Software Engineer
720
salaries
| ₹10.2 L/yr - ₹19 L/yr |
Software Developer
717
salaries
| ₹5.1 L/yr - ₹12.7 L/yr |
Softwaretest Engineer
504
salaries
| ₹3 L/yr - ₹10.4 L/yr |
Front end Developer
202
salaries
| ₹4.6 L/yr - ₹10.8 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant