UnitedHealth
UnitedHealth Software Developer Intern Interview Questions and Answers
Q1. Copy and Reverse the Array
Given an array of non-negative integers ARR, your task is to create another array COPY_ARR with the elements of ARR in reverse order.
Input:
The first line contains an integer T denot...read moreCreate a new array with elements of given array in reverse order.
Iterate through the given array in reverse order and copy elements to a new array.
Ensure to handle edge cases like empty array or single element array.
Use a temporary variable to swap elements for in-place reversal if required.
Q2. Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed linked list: 4 -> 3 -> 2...read moreReverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node.
Update the head of the reversed linked list as the last node encountered.
Ensure to handle edge cases like empty list or single node list.
Time complexity should be O(N) and space complexity should be O(1).
Q3. Maximize Stock Trading Profit
You are given an array prices, representing stock prices over N consecutive days. Your goal is to compute the maximum profit achievable by performing multiple transactions (i.e., b...read more
Calculate maximum profit by buying and selling stocks multiple times.
Iterate through the array of stock prices and find all increasing sequences of prices.
Calculate profit for each increasing sequence and add them up to get the maximum profit.
Make sure to sell before buying again to maximize profit.
Q4. LCA of Binary Tree Problem Statement
You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes.
The ...read more
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to each node, then compare the paths to find the LCA.
Use recursion to traverse the tree efficiently and find the LCA.
Handle cases where one node is an ancestor of the other node.
Consider edge cases like when one or both nodes are not present in the tree.
Optimize the solution to achieve the desired time complexity.
I have worked with SQL queries and JOIN operations in database management projects.
Used INNER JOIN to combine rows from two or more tables based on a related column between them.
Utilized LEFT JOIN to return all rows from the left table and the matched rows from the right table.
Implemented WHERE clause to filter rows based on specified conditions.
Employed GROUP BY to group rows that have the same values into summary rows.
Executed subqueries to nest one query within another que...read more
Fragmentation is the division of memory into smaller blocks, while segmentation is the division of memory into logical segments.
Fragmentation divides memory into smaller blocks, leading to wasted space and inefficient memory usage.
Segmentation divides memory into logical segments based on program structure or data types.
Fragmentation can occur due to external fragmentation (unused memory between allocated blocks) or internal fragmentation (unused memory within allocated block...read more
Top Software Developer Intern Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
