Leetcode 3344. Maximum Sized Array

Given an array and rules that restrict which elements can coexist, determine the largest possible final array (subsequence or multiset) you can obtain by removing elements so all constraints are satisfied. The core challenge is selecting the maximum-size set under pairwise/structural constraints — typically solved with greedy frequency management, sorting/two‑pointers, or matching/DP depending on the specific rule.