Incumed Interview Questions and Answers

Reverse a singly linked list iteratively and return the head of the reversed linked list.

• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Keep track of the previous, current, and next nodes while traversing the linked list.

• Update the head of the reversed linked list to be the last node encountered.

• Time complexity: O(N), Space complexity: O(1).

Find uncommon characters in two strings and return them in lexicographically sorted order.

• Iterate through each character in both strings and keep track of their frequency using a hashmap.

• Iterate through the hashmap and add characters with frequency 1 to the result array.

• Sort the result array in lexicographical order and return it.

Given a node in a binary tree, find its inorder successor in the tree.

• Traverse the tree in in-order fashion to find the successor node.

• If the given node has a right child, the successor will be the leftmost node in the right subtree.

• If the given node does not have a right child, backtrack to the parent nodes to find the successor.

• Handle the case where the given node is the last node in the in-order traversal.

• Return the value of the successor node or 'NULL' if no successor exi...read more

To reverse a linked list, we need to traverse the list and change the direction of the pointers. To get the right view of a binary tree, we need to traverse the tree and keep track of the rightmost node at each level.

• To reverse a linked list, we can use three pointers to keep track of the current, previous, and next nodes.

• To get the right view of a binary tree, we can use a queue to traverse the tree level by level and keep track of the rightmost node at each level.

• Both opera...read more

Design a calculator that performs operations on 128 bit integers.

• Use a data structure like an array to store the 128 bit integers.

• Implement functions for addition, subtraction, multiplication, and division.

• Consider handling overflow and underflow cases.

• Use bitwise operations for efficient calculations.

I am comfortable with various subjects related to software development.

• Programming languages (e.g. Java, Python, C++)

• Web development (e.g. HTML, CSS, JavaScript)

• Database management (e.g. SQL, MongoDB)

• Software testing and debugging

• Version control systems (e.g. Git)

• Object-oriented programming concepts

• Algorithms and data structures