Filter interviews by
Call stack stores function calls and local variables, while heap stores dynamic memory allocation.
Call stack is used for function calls and local variables
Heap is used for dynamic memory allocation
Call stack is limited in size and has a fixed memory allocation, while heap is larger and can grow dynamically
Example: Call stack is used to keep track of function calls in a recursive function, while heap is used to all...
CORS stands for Cross-Origin Resource Sharing and is a security feature implemented by browsers to prevent unauthorized access to resources on a different domain.
CORS allows servers to specify who can access their resources by adding specific HTTP headers to their responses.
It is used to protect against cross-site request forgery (CSRF) attacks.
For example, if a frontend application on domain A tries to make a req...
Map two arrays of objects and display results in lists using React
Use the map function to iterate over each array of objects
Render the results in separate lists using JSX
Example: array1.map(item =>
Code snippet to post data to a public URL in React
Use the fetch API to make a POST request to the public URL
Convert the data to JSON before sending it in the request body
Handle the response from the server accordingly
Arrow functions are more concise and have lexical scoping, while normal functions have their own 'this' value.
Arrow functions do not have their own 'this' value, they inherit it from the parent scope.
Arrow functions are more concise and have implicit return.
Normal functions are more flexible and can be used as constructors.
Arrow functions cannot be used as constructors.
Arrow functions do not have 'arguments' objec...
Convert a counter code from class component to functional component
Use useState hook to manage state in functional component
Remove 'this' keyword and constructor from the code
Update event handlers to use arrow functions or useCallback hook
I applied via LinkedIn and was interviewed in Sep 2024. There were 2 interview rounds.
Convert a counter code from class component to functional component
Use useState hook to manage state in functional component
Remove 'this' keyword and constructor from the code
Update event handlers to use arrow functions or useCallback hook
Code snippet to post data to a public URL in React
Use the fetch API to make a POST request to the public URL
Convert the data to JSON before sending it in the request body
Handle the response from the server accordingly
Arrow functions are more concise and have lexical scoping, while normal functions have their own 'this' value.
Arrow functions do not have their own 'this' value, they inherit it from the parent scope.
Arrow functions are more concise and have implicit return.
Normal functions are more flexible and can be used as constructors.
Arrow functions cannot be used as constructors.
Arrow functions do not have 'arguments' object.
Call stack stores function calls and local variables, while heap stores dynamic memory allocation.
Call stack is used for function calls and local variables
Heap is used for dynamic memory allocation
Call stack is limited in size and has a fixed memory allocation, while heap is larger and can grow dynamically
Example: Call stack is used to keep track of function calls in a recursive function, while heap is used to allocate...
CORS stands for Cross-Origin Resource Sharing and is a security feature implemented by browsers to prevent unauthorized access to resources on a different domain.
CORS allows servers to specify who can access their resources by adding specific HTTP headers to their responses.
It is used to protect against cross-site request forgery (CSRF) attacks.
For example, if a frontend application on domain A tries to make a request ...
Map two arrays of objects and display results in lists using React
Use the map function to iterate over each array of objects
Render the results in separate lists using JSX
Example: array1.map(item =>
Top trending discussions
I applied via Naukri.com and was interviewed before Jul 2019. There were 4 interview rounds.
To check if a directed graph is cyclic or not
Use Depth First Search (DFS) algorithm to traverse the graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then the graph is cyclic
If DFS traversal completes without finding a cycle, then the graph is acyclic
Return a random byte from a stream of bytes with equal probability.
Create a variable to store the count of bytes read
Create a variable to store the current random byte
For each byte read, generate a random number between 0 and the count of bytes read
If the random number is 0, store the current byte as the random byte
Return the random byte
Check if a binary tree is a binary search tree or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Use recursion to check if all nodes in the tree satisfy the above condition.
Algorithm to find Nth-to-Last element in a singly linked list of unknown length
Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning
Move both pointers simultaneously until the second pointer reaches the end of the list
The first pointer will be pointing to the Nth-to-Last element
If N=0, return the last element
Parse the list only once
Print all possible permutations of an array of integers
Use recursion to swap elements and generate permutations
Start with the first element and swap it with each subsequent element
Repeat the process for the remaining elements
Stop when all elements have been swapped with the first element
Print each permutation as it is generated
Design a stack that prints the minimum element pushed in O(1)
Use two stacks, one for storing elements and another for storing minimums
When pushing an element, compare it with the top of minimum stack and push the smaller one
When popping an element, pop from both stacks
To get the minimum element, just return the top of minimum stack
To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
When they meet, move one pointer to the head of the list and keep the other at the meeting point.
Move both pointers one step at a time until they meet again, which is the starting point of the loop.
To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.
Use binary search to find the number in each row and column
Start from the top-right corner or bottom-left corner to optimize search
Time complexity: O(m log n) or O(n log m) depending on the starting corner
I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Sep 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed in Mar 2024. There was 1 interview round.
There were 5 question out of which 2 were coding Data Structure problems , 1 was SQL based , 1 was AI based Problem ( Machine Learning ) and 1 was to create UML Diagram.
First Coding question was pretty easy , other one was kinda tough , UML Diagram was also easy and SQL query was of moderate level.
I applied via Campus Placement
Aptitude questions with 2-3 coding questions
Interpreter executes code line by line, compiler translates code into machine code before execution.
Interpreter translates code into machine code line by line during runtime
Compiler translates code into machine code before execution
Interpreted languages include Python, JavaScript
Compiled languages include C, C++
I appeared for an interview in Apr 2021.
Round duration - 120 Minutes
Round difficulty - Medium
I was MCQ + Coding round, Their were MCQ Based on DSA, Aptitude and 2 easy coding questions.
Ninja is organizing a coding competition where two teams compete at a time. To keep it fair and interesting, both teams must have an equal number of members. Ninja’s ta...
Check if Ninja can create two teams with equal members given an integer N and its divisors.
Iterate through all divisors of N and assign members to the first or second team based on whether the divisor is even or odd.
Keep track of the total members in each team and check if they are equal at the end.
Return true if the total members in both teams are equal, false otherwise.
Bob has just turned 18 and opened a bank account. Being inexperienced with banking, Bob needs your help to validate whether an IFSC code provided by his bank is valid.
...Validate IFSC code based on given rules and return True or False for each test case.
Check if the code is 11 characters long.
Verify the first four characters are uppercase alphabets.
Ensure the fifth character is '0'.
Validate that the last six characters are alphanumeric.
Round duration - 50 Minutes
Round difficulty - Easy
The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.
Round duration - 50 minutes
Round difficulty - Easy
The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.
Tip 1 : Be strong at your basics.
Tip 2 : Do at least 2 projects and ask to find answers like why are you choosing this tech stack? why did not you choose its alternatives Know your project in and out because they might ask you for a modification in your project?
Tip 1 : Have some projects on your resume.
Tip 2 : Do not put false things on your resume.
Tip 3 : Try to keep a single-page resume.
It was combination of mcqs and 2 coding questions
Object-oriented programming concepts that focus on objects and classes for better code organization and reusability.
Encapsulation: Bundling data and methods that operate on the data into a single unit (class).
Inheritance: Ability of a class to inherit properties and behavior from another class.
Polymorphism: Ability to present the same interface for different data types.
Abstraction: Hiding the complex implementation det...
Java is a programming language while Putjon is not a recognized term in software development.
Java is a widely used programming language for developing applications.
Putjon is not a recognized term in software development, it may be a typo or a specific term not commonly used.
There is no direct comparison between Java and Putjon as they are not related.
Find all anagrams in a string
Create a hashmap to store the frequency of characters in the input string
Iterate through the input string and check if the frequency of characters matches the hashmap for each substring of the same length
Store the substrings that are anagrams in an array and return it
Some of the top questions asked at the Saviynt React Js Frontend Developer interview -
based on 1 interview experience
Difficulty level
Duration
Consultant
48
salaries
| ₹14 L/yr - ₹24.2 L/yr |
Senior Software Engineer
39
salaries
| ₹24.1 L/yr - ₹44 L/yr |
Senior Engineer
34
salaries
| ₹17.9 L/yr - ₹30 L/yr |
Technical Lead
30
salaries
| ₹23 L/yr - ₹40.5 L/yr |
Software Engineer
27
salaries
| ₹9.5 L/yr - ₹17 L/yr |
Yodlee
Fingent
Bravura Solutions
CloudMoyo