GN Consultancy International Interview Questions and Answers

Use hashing to compare the JSON files in O(1) time complexity.

• Create a hash function to convert the JSON data into a unique hash value.

• Calculate the hash value for each JSON file and compare the hash values.

• If the hash values are equal, the JSON files are identical.

• Example: Use MD5 or SHA-256 hash functions for generating hash values.

Total nodes in a binary tree can be found using depth-first or breadth-first traversal algorithms with time complexity O(n) and space complexity O(h), where h is the height of the tree.

• Use depth-first traversal (pre-order, in-order, post-order) or breadth-first traversal to visit each node and count the total nodes.

• Time complexity is O(n) where n is the number of nodes in the tree.

• Space complexity is O(h) where h is the height of the tree, due to the recursive calls in depth-...read more

Use array indices to map parent to children in a 4 Array tree in O(1) space complexity.

• Assign children of a parent at indices 4*i+1, 4*i+2, 4*i+3, 4*i+4 where i is the index of the parent.

• To find parent of a child at index j, use (j-1)/4 to get the parent index.

Construct 4 Array Tree and implement operations

• Create an array to represent the tree structure

• Implement operations like insert, delete, search, and traversal

• Example: Construct a binary search tree using arrays