90+ Technical Trainee Interview Questions and Answers

Find the minimum cost to reach a destination in a matrix with specified rules.

• Use Breadth First Search (BFS) algorithm to explore all possible paths from the starting point to the destination.

• Keep track of the cost incurred at each cell and update it as you move through the matrix.

• Return the minimum cost to reach the destination or -1 if it is unreachable.

• Consider edge cases such as when the starting point is the destination or when the destination is blocked.

Given an array where all elements appear twice except two, find and return the two unique elements.

• Use XOR operation to find the XOR of all elements in the array, which will give the XOR of the two unique elements.

• Find the rightmost set bit in the XOR result to divide the array into two groups based on that bit.

• XOR each group separately to find the two unique elements.

• Example: For input [2, 4, 6, 8, 4, 2], XOR result is 6^8=14. Rightmost set bit is at position 1. Group 1: [6,...read more

Find the maximum elements for each subarray of size 'K' in a given array of non-negative integers.

• Iterate through the array and maintain a deque to store the indices of elements in decreasing order.

• Pop elements from the deque if they are out of the current window of size 'K'.

• The front of the deque will always have the index of the maximum element for the current window.

Given a singly linked list with integers separated by '0', merge nodes between '0's into a single node with sum of included nodes.

• Traverse the linked list and keep track of sum between zeroes

• Merge nodes between zeroes by updating the sum in the merged node

• Update the linked list by removing the nodes between zeroes

• Handle edge cases like list starting and ending with '0'

Count the total number of derangements possible for a set of 'N' elements.

• A derangement is a permutation where no element appears in its original position.

• Use the formula for derangements: !n = n! * (1 - 1/1! + 1/2! - 1/3! + ... + (-1)^n/n!)

• Return the answer modulo (10^9 + 7) to handle large results.

The task is to find the distance of the closest points among an array of N points in the plane.

• Calculate the distance between each pair of points using the given formula

• Keep track of the minimum distance found so far

• Return the minimum distance

Count the number of palindrome words in a given string.

• Split the string into words using whitespace as delimiter.

• Check each word if it is a palindrome by comparing it with its reverse.

• Increment a counter for each palindrome word found.

• Output the total count of palindrome words for each test case.

Sort an integer array containing only 0s, 1s, and 2s in-place using a single scan.

• Iterate through the array and maintain three pointers for 0s, 1s, and 2s.

• Swap elements based on the current element's value and the pointers.

• Example: If current element is 0, swap with the 0s pointer and increment both pointers.

The task is to transform an integer array into a max binary heap structure.

• Create a max heap from the given array by rearranging elements.

• Check if each internal node has a value greater than or equal to its children.

• Output '1' if the transformed array represents a max-heap, else output '0'.

Swap two integers 'a' and 'b' and output the swapped values.

• Create a temporary variable to store one of the integers before swapping

• Assign the value of 'a' to 'b' and the temporary variable to 'a'

• Output the swapped values as 'b' followed by 'a'

Reverse groups of K nodes in a doubly linked list.

• Iterate through the linked list in groups of K nodes

• Reverse each group of K nodes

• Handle cases where the number of nodes is less than K

• Update the pointers accordingly

Check if second string can be formed using characters from the first string.

• Iterate through each character in STR2 and check if it exists in STR1.

• Use a hashmap to store the frequency of characters in STR1 for efficient lookup.

• Return 'YES' if all characters in STR2 are found in STR1, otherwise return 'NO'.

Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.

• Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.

• Once the loop is detected, use two pointers to find the start of the loop.

• Adjust the pointers to remove the loop and return the modified linked list.

Calculate the total amount of rainwater that can be trapped within given elevation map.

• Iterate through the array to find the maximum height on the left and right of each bar.

• Calculate the amount of water that can be trapped above each bar by taking the minimum of the maximum heights on the left and right.

• Sum up the trapped water above each bar to get the total trapped water for the elevation map.

The problem involves determining the number of distinct ways to climb from the 0th to the Nth stair by climbing one or two steps at a time.

• Use dynamic programming to solve this problem efficiently.

• The number of ways to reach the Nth stair can be calculated by adding the number of ways to reach the (N-1)th stair and the (N-2)th stair.

• Consider base cases where N=0 and N=1 separately.

• Handle large values of N by using modulo arithmetic.

• Example: For N=3, the number of distinct way...read more

Convert a sorted linked list into a Balanced Binary Search Tree (BST) using the same data values.

• Create a function to convert the linked list to a BST by recursively dividing the list into halves

• Maintain a pointer to the middle element of the list as the root of the BST

• Recursively set the left and right children of the root using the left and right halves of the list

• Perform level order traversal to output the values of the BST nodes in the required format

Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.

• Create a graph representation of the board with snakes and ladders as edges.

• Use Breadth First Search (BFS) to find the shortest path from the starting cell to the last cell.

• Keep track of visited cells and the number of dice throws at each cell.

• Handle cases where the last cell is unreachable by returning -1.

• Consider the special cases where the last cell is reached through a lad...read more

The task is to output the Spiral Order traversal of a binary tree given in level order.

• Implement a function that returns the spiral order traversal as a list

• Traverse the binary tree in a spiral order alternating between left to right and right to left

• Use a queue to keep track of nodes at each level

• Handle null nodes represented by -1 in the input

Distribute N candies among K people in Sanyam's order of likeness, incrementing distribution by K each round until all candies are distributed.

• Distribute candies starting from 1st friend, incrementing by K each round

• If remaining candies are fewer than what a friend is supposed to receive, stop distribution

• Output the number of candies each friend ends up with at the end of distribution

The task is to find all pairs of elements in an array that add up to a given target.

• Iterate through the array and for each element, check if the target minus the element exists in a hash set.

• If it exists, add the pair to the result. If not, add the element to the hash set.

• Print the pairs found or (-1, -1) if no pair is found.

Calculate uneaten carrots after rabbits jump based on their unique factors.

• Iterate through each rabbit's jumping factor and mark the carrots they land on as eaten

• Calculate the remaining uneaten carrots by counting the ones not marked as eaten

• Consider using a data structure like an array to keep track of eaten carrots efficiently

Reverse a singly linked list by altering the links between nodes.

• Iterate through the linked list and reverse the links between nodes

• Use three pointers to keep track of the current, previous, and next nodes

• Update the links between nodes to reverse the list

• Return the head of the reversed linked list

Reverse a given stack of integers using recursion without extra space or loop constructs.

• Use recursion to pop all elements from the original stack and store them in function call stack.

• Once the stack is empty, push the elements back in reverse order using recursion.

• Ensure to handle base cases for empty stack or single element stack.

• Example: If the input stack is [1, 2, 3], after reversal it should be [3, 2, 1].

Implement a function to compress a string by replacing consecutive characters with the character followed by the count of repetitions.

• Iterate through the input string and keep track of consecutive characters and their counts.

• Replace consecutive characters with the character followed by the count of repetitions if count is greater than 1.

• Return the compressed string for each test case.

Calculate the total amount of rainwater that can be trapped between given elevations in an array.

• Iterate through the array and calculate the maximum height on the left and right of each bar.

• Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

• Sum up the trapped water at each bar to get the total trapped water for the entire array.

Find the maximum sum of a simple path between any two nodes in a binary tree.

• Use a recursive approach to traverse the binary tree and calculate the maximum sum path.

• Keep track of the maximum sum path found so far while traversing the tree.

• Consider negative values in the path sum calculation to handle cases where the path can start and end at different nodes.

• Handle cases where the path can go through the root node or not.

The goal is to determine the frequency of each word in a given string.

• Split the input string into individual words

• Create a dictionary to store word frequencies

• Iterate through the words and update the frequency count in the dictionary

• Print each unique word and its frequency

In an undirected graph with distinct edge weights, the lightest edge in a cycle is included in every MST, while the heaviest edge is excluded.

• The lightest edge in a cycle is always included in every MST of the graph.

• The heaviest edge in a cycle is always excluded from every MST of the graph.

• This property holds true for all simple undirected graphs with distinct edge weights.

Check if a given string is a palindrome considering only alphanumeric characters.

• Remove non-alphanumeric characters from the input string.

• Compare characters from start and end of the string to check for palindrome.

• Return true if the string is a palindrome, false otherwise.

Find the closest perfect square to a given positive integer and determine the number of steps required to reach that number.

• Iterate through perfect squares starting from 1 until the square is greater than the given number

• Calculate the distance between the perfect square and the given number

• Return the closest perfect square and the distance as output

The number of steps required to reach the top of a staircase of length n can be calculated using dynamic programming.

• Use dynamic programming to solve the problem

• Create an array to store the number of steps required for each position

• Initialize the first two positions with 1 and 2

• Iterate through the remaining positions and calculate the number of steps based on the previous two positions

• Return the number of steps required for the last position

WFH allows employees to work remotely from their homes, while WFO requires employees to work from a physical office location.

• WFH provides flexibility in work location and schedule, while WFO requires employees to be present in the office during specified hours.

• WFH may lead to increased productivity and work-life balance for some employees, while WFO allows for better collaboration and communication among team members.

• Examples: WFH - working from home on a laptop; WFO - workin...read more

The technology used was artificial intelligence in healthcare.

• AI algorithms for medical image analysis

• Machine learning for predicting patient outcomes

• Natural language processing for analyzing medical records

Explanation of diode, zener diode, clamp meter, transistor, and resistor color code.

• A diode is an electronic component that allows current to flow in only one direction.

• A zener diode is a type of diode that allows current to flow in reverse direction when a certain voltage is reached.

• A clamp meter is a tool used to measure electrical current without disconnecting the circuit.

• A transistor is a semiconductor device used to amplify or switch electronic signals.

• Resistor color cod...read more

I would actively listen to feedback, analyze it, and make necessary adjustments to the lecture plan.

• Actively listen to feedback from students, colleagues, and supervisors.

• Analyze the feedback to identify common themes or areas for improvement.

• Make necessary adjustments to the lecture plan based on the feedback received.

• Seek clarification or additional feedback if needed to ensure understanding.

• Implement changes in a timely manner to improve the effectiveness of the lecture.

Transistor colour coding helps identify the type and polarity of the transistor. Soldering is a process of joining two metal surfaces using a filler metal.

• Transistor colour coding typically involves using colored bands to indicate the type and polarity of the transistor. For example, a common NPN transistor might have a black body with a white band to indicate the base, a red band for the collector, and a green band for the emitter.

• Soldering is the process of joining two meta...read more

Different types of mixes in the field include concrete, mortar, and grout. Types of cement manufactured include Portland cement, white cement, and blended cement. Volumetric mix design ratios vary depending on the specific application.

• Types of mixes in the field: concrete, mortar, grout

• Types of cement manufactured: Portland cement, white cement, blended cement

• Volumetric mix design ratios depend on the specific application

Protecting network and data involves implementing security measures to prevent unauthorized access and data breaches.

• Implement strong passwords and two-factor authentication

• Use firewalls and antivirus software

• Regularly update software and security patches

• Encrypt sensitive data

• Train employees on safe browsing and email practices

• Limit access to sensitive data on a need-to-know basis

• Regularly backup data

Parenteral refers to the administration of drugs or fluids through routes other than the digestive tract.

• Parenteral administration bypasses the gastrointestinal tract.

• Common parenteral routes include intravenous (IV), intramuscular (IM), and subcutaneous (SC) injections.

• Other parenteral routes include intradermal (ID), intrathecal, and intra-articular injections.

• Parenteral administration can also be achieved through intravenous infusion or intravenous bolus.

• Parenteral routes ...read more

Print the leftmost node of each level using BFS.

• Implement BFS algorithm to traverse the tree level by level.

• Keep track of the leftmost node of each level.

• Print the leftmost node of each level after traversal is complete.

NMR values of aromatic rings are affected by electron withdrawing and donating groups.

• Electron withdrawing groups shift NMR values downfield (to higher ppm)

• Electron donating groups shift NMR values upfield (to lower ppm)

• Examples: Nitro group (downfield shift), Methoxy group (upfield shift)

CNC machine is a computer-controlled machine tool used for cutting and shaping materials. G-code is a programming language used to control CNC machines. M-code is used to activate specific machine functions.

• CNC machine is a computer-controlled machine tool used for cutting and shaping materials.

• G-code is a programming language used to control CNC machines by providing instructions for movement, speed, and other parameters.

• M-code is used to activate specific machine functions ...read more

DNS stands for Domain Name System. It is a decentralized system that translates domain names into IP addresses.

• DNS is used to resolve domain names to their corresponding IP addresses.

• It helps in the efficient routing of internet traffic.

• DNS also provides other services like email routing and load balancing.

• Example: When you type a website URL in your browser, DNS translates it to the IP address of the server hosting that website.

The question asks to find all the pairs present in an array of strings.

• Iterate through the array and compare each element with all other elements to find pairs.

• Store the pairs in a separate array or data structure.

• Consider the order of elements in pairs, i.e., (A, B) is different from (B, A).

A linked list is a data structure where each element points to the next one.

• Create a Node class with a value and a next pointer

• Create a LinkedList class with a head pointer and methods to add, remove, and traverse nodes

• Example: LinkedList ll = new LinkedList(); ll.add(5); ll.add(10); ll.remove(5);

Yes, I can draw a simple electrical circuit.

• Start with a power source (battery or outlet)

• Connect the power source to a load (light bulb, resistor, etc.)

• Include wires to complete the circuit

• Label components with symbols (battery symbol, resistor symbol, etc.)

Security is important to protect data, assets, and individuals from unauthorized access, theft, and harm.

• Prevent unauthorized access to sensitive information

• Protect assets from theft or damage

• Ensure the safety and well-being of individuals

• Maintain confidentiality and integrity of data

• Comply with regulations and standards

• Examples: Using strong passwords, encryption, access control measures