1p3a Question · Oct 2025

MathWorks EDG Online Coding Assessment Interview Experience

Question Details

**Problem Statement** The goal is to find the length of the longest subsequence in an array such that the bitwise XOR of any two adjacent elements in the subsequence equals a specific target value, $k

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays Dynamic Programming Hash Table Bit Manipulation