Hello friends, do let me know if u need referral in startup called Avataar. Avataar is a 3D AI company that helps large enterprise customers create immersive and interactive shopping experiences for their end consumers. Avataar’s vision is to bridge the gap between offline-online experiences by replacing the current 2D visuals with life-size and hyper-realistic 3D XR/AR experiences.

Avataar’s use of AR technology brings spatial depth to the onscreen buying/browsing experience — delivering life-like photorealism, mobile responsiveness, interactivity and personalization – key influences re-shaping the digital commerce industry today. open positions: SDE 1,2,3

https://avataar.me

Given an array of even size containing only 1,2,3. We can recursively take two adjacent position and remove them until size of array is 0. However we have one additional constraint, that we can not remove two adjacent if they are 1,2 or 2,1. In how many ways array can be formed(containing only 1,2,3) so that we can recursively remove adjacent position till size of array is 0.

constraints: n(size of array)<=1e5 and even

test case : for n=2 answer =7 ({1,2,3} x {1,2,3} — ((1,2) ,(2,1) ) )