Applicate
iEnergizer Interview Questions and Answers
Q1. What are Closures, Promises in JS?
Closures are functions that have access to variables from their outer scope. Promises are objects used for asynchronous programming in JavaScript.
Closures are created when a function is defined inside another function and the inner function has access to the outer function's variables.
Closures allow for data encapsulation and private variables in JavaScript.
Promises are used to handle asynchronous operations and provide a way to handle success or failure of those operations.
P...read more
Q2. given the reference of a node delete the node from the linkedlist
Delete a node from a linked list given its reference
Set the previous node's next pointer to the current node's next pointer
Free the memory allocated to the current node
Q3. State management in Functional Based Component in React JS
State management in functional components involves using hooks such as useState and useEffect.
useState hook is used to manage state in functional components
useEffect hook is used to handle side effects and update state
React Context API can be used for global state management
Redux can also be used for state management in functional components
Q4. Which languages i am familar with?
I am familiar with Java, Python, and C++.
Proficient in Java with experience in developing web applications using Spring framework
Comfortable with Python for data analysis and scripting
Familiar with C++ for competitive programming and algorithm development
Q5. Nth Node from last in LinkedList.
Find the Nth node from the end of a linked list.
Traverse the linked list and count the number of nodes.
Calculate the position of the Nth node from the start.
Traverse the linked list again and return the Nth node from the start.
Q6. Preorder traversal of tree, quick sort, merge sort, difference between binary and binary search tree and some questions on Java/ javascript
Question on tree traversal, sorting algorithms, and Java/Javascript
Preorder traversal visits root, left subtree, then right subtree
Quick sort uses partitioning to sort elements in place
Merge sort divides array into halves, sorts them, then merges them
Binary trees have at most 2 children per node, while binary search trees have left child < parent < right child
Java is a statically typed language, while Javascript is dynamically typed
Top Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month