#Dsa

The online assessment consisted of two Data Structures and Algorithms questions. Focus was on problem-solving skills, writing clean code, and handling edge cases effectively.

Solve a tricky binary search problem that goes beyond the typical element-finding tasks. You will need to apply binary search with insight into the specific problem constraints.

Solve a dynamic programming problem that is categorized as medium to hard. Ensure you understand the problem constraints and provide a robust solution.

During this round, six multiple-choice questions focused on data structures and algorithms (DSA) theory were administered. Topics included trees and other data structure fundamentals.

Solve the Array Intersection problem. Please discuss your approach and consider edge cases in your solution.