GS OA – Two Flowers

Problem Link - Link The question asks us to find the length of the maximum connected component under the constraint that we can merge at max two different numbers. We…

Continue Reading GS OA – Two Flowers

Largest Tree Uber OA

Question We are given a perfect N-ary tree where N denotes the number of children a node has. The tree has infinite nodes. You are given two nodes x,y. You…

Continue Reading Largest Tree Uber OA