Parity Cube Interview Questions and Answers

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.

To identify whether a binary tree is a Binary Search Tree or not.

• Check if the left subtree is a Binary Search Tree

• Check if the right subtree is a Binary Search Tree

• Check if the root node is greater than all the nodes in the left subtree

• Check if the root node is less than all the nodes in the right subtree

Solution for inorder traversal in sorted order without using array

• Implement a binary search tree and perform inorder traversal

• Use a stack to simulate the recursive function call stack

• Maintain a variable to keep track of the previously visited node

• Compare the current node with the previously visited node to check if it is in sorted order

Convert a BST to a binary tree with each element replaced by sum of all greater elements.

• Traverse the BST in reverse inorder and keep track of the sum of all greater elements.

• Replace each node's value with the sum and update the sum.

• Recursively perform the above steps on left and right subtrees.

• Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.

Find the 2nd highest salary from an employee table in SQL.

• Use the SELECT statement to retrieve the salaries in descending order.

• Use the LIMIT keyword to limit the result set to the second row.

• Use a subquery to exclude the highest salary from the result set.

I am a software engineer with experience in developing web applications and a passion for problem-solving.

• Experienced in developing web applications using languages such as Java, Python, and JavaScript

• Proficient in using frameworks such as Spring, Django, and React

• Strong problem-solving skills and ability to work in a team environment

• Passionate about learning new technologies and keeping up with industry trends

Given an array, determine if it follows one of four patterns: increasing, decreasing, increase then decrease, or decrease then increase.

• Iterate through the array and compare each element to the previous one.

• If all elements are increasing, it follows the increasing pattern.

• If all elements are decreasing, it follows the decreasing pattern.

• If there is a point where the elements start decreasing after increasing, it follow...read more

Given an array of distinct positive numbers, find the maximum sum of non-adjacent elements.

• Use dynamic programming to keep track of the maximum sum at each index

• At each index, choose between including the current element or skipping it

• The maximum sum at index i is the maximum of the sum including i-2 and i or the sum excluding i

• Return the maximum sum at the last index

Use machine learning algorithms to analyze user behavior and preferences to suggest personalized coupons.

• Collect user data such as purchase history, search history, and demographics

• Use machine learning algorithms to analyze the data and identify patterns

• Create personalized coupon suggestions based on the identified patterns

• Regularly update and refine the algorithm to improve accuracy

• Allow users to provide feedback on t