FirstCry Area Operation Manager Interview Questions and Answers for Experienced

PreOrder traversal without recursion is done using a stack to simulate the function call stack.

• Create an empty stack and push the root node onto it.

• While the stack is not empty, pop a node from the stack and process it.

• Push the right child of the popped node onto the stack if it exists.

• Push the left child of the popped node onto the stack if it exists.

Yes

• Create an empty binary search tree (BST)

• Loop over the unsorted array

• For each element, insert it into the BST using the appropriate insertion logic

• Repeat until all elements are inserted

• The resulting BST will be built from the unsorted array

The question asks to find two elements in an array whose sum is equal to a given number.

• Iterate through the array and for each element, check if the difference between the given number and the current element exists in the array.

• Use a hash set to store the elements as you iterate through the array for efficient lookup.

• Return the pair of elements if found, otherwise return a message indicating no such pair exists.

There are two types of triggers: DML triggers and DDL triggers.

• DML triggers are fired in response to DML (Data Manipulation Language) statements like INSERT, UPDATE, DELETE.

• DDL triggers are fired in response to DDL (Data Definition Language) statements like CREATE, ALTER, DROP.

• Examples: A DML trigger can be used to log changes made to a table, while a DDL trigger can be used to enforce certain rules when a table is alt

Yes, triggers can be used with select statements in SQL.

• Triggers are database objects that are automatically executed in response to certain events, such as insert, update, or delete operations.

• While triggers are commonly used with insert, update, and delete statements, they can also be used with select statements.

• Using triggers with select statements allows you to perform additional actions or validations before or af...read more

Indexing in MySQL improves query performance. There are several types of indexing in MySQL.

• Indexes are used to quickly locate data without scanning the entire table.

• Types of indexing in MySQL include B-tree, hash, full-text, and spatial indexes.

• B-tree indexes are the most common and suitable for most use cases.

• Hash indexes are used for exact match lookups.

• Full-text indexes are used for searching text-based data efficie...read more

Engines in MySQL are the underlying software components that handle storage, indexing, and querying of data.

• MySQL supports multiple storage engines, each with its own strengths and features.

• Some commonly used engines in MySQL are InnoDB, MyISAM, and Memory.

• InnoDB is the default engine in MySQL and provides support for transactions and foreign keys.

• MyISAM is known for its simplicity and speed but lacks transaction suppo...read more

Yes, a constructor can be private.

• A private constructor can only be accessed within the class itself.

• It is often used in singleton design pattern to restrict object creation.

• Private constructors are also useful for utility classes that only contain static methods.

Yes, I am comfortable traveling for work.

• I have experience traveling for work in my previous roles.

• I am adaptable and enjoy exploring new places.

• I am willing to travel for client meetings and conferences.

• I understand the importance of face-to-face interactions in sales.

• I am organized and can handle the logistics of travel efficiently.

Print only the leaf nodes of a doubly linked tree.

• Traverse the tree and check if a node has no children and both left and right pointers are null.

• If yes, then it is a leaf node and print it.

• If no, then continue traversing the tree.

• Use recursion to traverse the tree in a depth-first manner.

LRU page replacement algorithm is used to replace the least recently used page in memory with a new page.

• LRU stands for Least Recently Used

• It is a cache eviction algorithm

• It is used to manage memory in operating systems

• It works by keeping track of the pages that are used recently and the ones that are not

• When a new page is to be loaded into memory, the algorithm checks which page has not been used for the longest time

Reverse m nodes and leave n nodes in a linked list till the end.

• Traverse the linked list till m nodes and reverse them

• Traverse n nodes and continue reversing m nodes

• Repeat the above step till the end of the linked list

• Handle edge cases like m or n being greater than the length of the linked list

Inorder traversal is a way of visiting all nodes in a binary tree by visiting the left subtree, then the root, and then the right subtree.

• Start at the root node

• Traverse the left subtree recursively

• Visit the root node

• Traverse the right subtree recursively

• Repeat until all nodes have been visited

Inorder traversal of a tree without recursion

• Create an empty stack and initialize current node as root

• Push the current node to stack and set current = current.left until current is NULL

• If current is NULL and stack is not empty, pop the top item from stack, print it and set current = popped_item.right

• Repeat step 2 and 3 until stack is empty

Find the triplicate number in an array of duplicates.

• Iterate through the array and keep track of the frequency of each number.

• Return the number that appears three times.

• If no number appears three times, return null.

Explanation of search algorithms with their space and time complexities.

• Linear Search - O(n) time complexity, O(1) space complexity

• Binary Search - O(log n) time complexity, O(1) space complexity

• Jump Search - O(√n) time complexity, O(1) space complexity

• Interpolation Search - O(log log n) time complexity, O(1) space complexity

• Exponential Search - O(log n) time complexity, O(1) space complexity

• Fibonacci Search - O(log n)

Find the most repeated number in an array of length n with numbers 1-n.

• Create a dictionary to store the count of each number in the array

• Iterate through the array and update the count in the dictionary

• Find the key with the highest count in the dictionary