AlphaSense Interview Questions, Process, and Tips

Round duration - 90 minutes
Round difficulty - Medium

2 Coding problems , MCQs (CS related, ML related)

Q1. 
Connect Nodes at Same Level Problem Statement
An assignment is to link adjacent nodes at the same level in a binary tree. Each node in a binary tree has at most two children (left and right) and a next po...read more
Ans. 
Connect adjacent nodes at the same level in a binary tree by setting next pointers.
• Traverse the tree level by level using a queue.

• For each level, connect nodes using the next pointer.

• Set the next pointer of the last node in each level to NULL.

• Use constant space aside from input constraints.

• Example: Input - 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, Output - 1 # 2 3 # 4 5 6 # 7 #
Answered by AI
Add your answer
Q2. 
Loop Detection and Removal in Linked List
In a singly linked list, detect if a loop exists and remove the loop if present. Modify the linked list directly to eliminate any loops before returning it.
Inpu...read more
Ans. 
Detect and remove loop in a singly linked list efficiently.
• Use Floyd's Cycle Detection Algorithm to detect the loop in the linked list.

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

• Break the loop by setting the next pointer of the last node in the loop to null.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

2 Coding problems, No compilation of code. Only pseudocode required

Q1. 
Median of Two Sorted Arrays
Given two sorted arrays A and B of sizes N and M, find the median of the merged array formed by combining arrays A and B. If the total number of elements, N + M, is even, the m...read more
Ans. 
Find the median of two sorted arrays by merging them and calculating the median of the combined array.
• Merge the two sorted arrays into one sorted array.

• Calculate the median of the merged array based on the total number of elements.

• If the total number of elements is even, take the mean of the two middle elements as the median.
Answered by AI
Add your answer
Q2. 
Extracting Leaf Nodes from a Binary Tree
Given a binary tree, develop a solution to retrieve a list of all the leaf nodes in the order they appear from left to right. If two leaf nodes are equidistant fro...read more
Ans. 
Retrieve leaf nodes from a binary tree in left to right order, prioritizing lesser depth or smaller node data if equidistant from leftmost node.
• Traverse the binary tree in level order and keep track of leaf nodes.

• Prioritize leaf nodes with lesser depth or smaller node data if equidistant from leftmost node.

• Return the list of leaf nodes in the order they appear from left to right.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Hard

OS-CN fundamentals

Q1. What is a peer-to-peer connection?
Ans. 
A peer-to-peer connection is a network connection between two or more devices without the need for a central server.
• Allows devices to communicate directly with each other

• Each device can act as both a client and a server

• Commonly used in file sharing applications like BitTorrent
Answered by AI
Add your answer
Q2. What are some key concepts related to virtual memory, and can you discuss any follow-up questions that may arise from them?
Ans. 
Key concepts related to virtual memory and potential follow-up questions
• Key concepts: paging, segmentation, page tables, TLB, page faults, thrashing

• Follow-up questions: How does virtual memory differ from physical memory? What is the role of the operating system in managing virtual memory? How does virtual memory improve system performance?

• Example: Explain the concept of page tables and how they are used in virtual mem
Answered by AI
Add your answer