I just took the OA from an SDE I/SDE II position, United States.  The first problem was one that I hadn\'t seen menitoned before.  It was quite easy.\n\n![image](https://assets.leetcode.com/users/images/4b1887e3-8a41-489e-ab0f-e8b3b629e023_1665446752.7020428.jpeg)\n![image](https://assets.leetcode.com/users/images/1088dfb5-5e5b-4727-a5f0-d8e03d378f99_1665446764.5614402.jpeg)\n\nI solved this with a sort and a dfs, marking visited bags.  Time complexity nLog(n)\n\nThe second problem I got was [2272. Substring With Largest Variance,](https://leetcode.com/problems/substring-with-largest-variance/)

I just took the OA from an SDE I/SDE II position, United States.  The first problem was one that I hadn\'t seen menitoned before.  It was quite easy.\n\n\n\n\nI