Calidad Infotech Sdet-I Interview Questions and Answers

Check if any 3 elements in an array add up to a given number

• Sort the array in ascending order

• Use nested loops to iterate through all possible combinations of 3 elements

• Check if the sum of the 3 elements equals the given number

• Return true if a match is found, else false

Given a number, find the nearest perfect square using modified binary search.

• Start with low=0 and high=num.

• While low<=high, find mid=(low+high)/2.

• If mid*mid==num, return mid.

• If mid*mid

• If mid*mid>num, update high=mid-1.

• Return the closest perfect square to num.

Check if two binary trees are mirrors by comparing their structure and node values recursively.

• Two trees are mirrors if their root nodes are equal.

• The left subtree of one tree must be a mirror of the right subtree of the other tree.

• Recursively check the left and right subtrees for both trees.

• Example: Tree A (1, 2, 3) and Tree B (1, 3, 2) are mirrors.

This method prints the boundary nodes of a binary tree in a specific order.

• 1. Start from the root node and print it.

• 2. Print the left boundary (excluding leaf nodes).

• 3. Print all leaf nodes from left to right.

• 4. Print the right boundary (excluding leaf nodes) in reverse order.

• Example: For a tree with root 1, left child 2, right child 3, the output would be: 1, 2, 4, 5, 3.

Use a stack to find the next greater element for each item in an array efficiently.

• Initialize an empty stack and an output array of the same size as the input.

• Iterate through the array from right to left.

• For each element, pop elements from the stack until you find a greater element or the stack is empty.

• If the stack is not empty, the top element is the next greater element; otherwise, it's -1.

• Push the current element o...read more

Count occurrences of two nodes with same horizontal distance in a binary tree

• Traverse the tree using BFS or DFS and keep track of horizontal distance of each node

• Store nodes with same horizontal distance in a hash table and increment count if collision occurs

• Recursively traverse left and right subtrees with updated horizontal distance

• Time complexity: O(n), Space complexity: O(n)

Program to check if a linked list is a palindrome

• Traverse the linked list and push each element onto a stack

• Traverse the linked list again and compare each element with the top of the stack

• If all elements match, the linked list is a palindrome

Test methods for stress testing of Furniture class

• Create a large number of Furniture objects and check for memory leaks

• Simulate heavy usage by continuously calling methods and check for performance issues

• Test the Furniture class with maximum allowed input values and check for any errors or crashes

Considerations for developing an application for computer aided competitive exams

• User-friendly interface for easy navigation

• Accurate and reliable question bank

• Timed tests to simulate real exam conditions

• Option to save and resume tests

• Detailed performance analysis and feedback

• Compatibility with different devices and operating systems

• Regular updates and bug fixes

• Developer should consider the security of the application t...read more

Reverse every 3 nodes in a singly linked list using recursion

• Create a recursive function that takes in a node and a count

• If count is less than 3, return the node

• Reverse the first 3 nodes and call the function recursively with the 4th node and count 1

• Connect the reversed nodes to the rest of the list

• Return the new head of the reversed list

I want to learn/change 3 things about myself

• Improve my communication skills

• Develop better time management habits

• Learn a new programming language