SJ Jaiswal and Associates Interview Questions and Answers

The task is to count the occurrences of words from a dictionary in a big string efficiently.

• Create a hash map to store the count of each word from the dictionary.

• Split the big string into words and iterate through each word.

• Check if the word exists in the dictionary and update its count in the hash map.

• Return the hash map with word counts.

Given a directed dependency graph, find sequence to install packages if each node has a structure of package name and dependency list.

• Use topological sorting algorithm to find the installation sequence

• Start with nodes that have no dependencies and gradually remove dependencies as packages are installed

• If there is a cycle in the graph, it is not possible to find a valid installation sequence

Find peak in increasing and decreasing sequence

• Use binary search to find the peak element

• Compare the middle element with its neighbors to determine if it's a peak

• If the middle element is smaller than its left neighbor, search in the left half of the array

• If the middle element is smaller than its right neighbor, search in the right half of the array

Concatenation of two strings in C

• Use the strcat() function to concatenate two strings in C

• Make sure the destination string has enough space to hold the concatenated result

• The destination string should be null-terminated before concatenation

Inorder traversal is a depth-first traversal algorithm that visits the left subtree, then the root, and finally the right subtree.

• Start at the root node

• Traverse the left subtree recursively

• Visit the root node

• Traverse the right subtree recursively

BST stands for Binary Search Tree.

• BST is a type of binary tree where each node has at most two children.

• In a BST, the left child of a node is always smaller than the node, and the right child is always greater.

• BSTs are commonly used for efficient searching, insertion, and deletion operations.

• Example: [5, 3, 7, 2, 4, 6, 8] is a BST.