ShareChat SDE-2 OA 2023 | Power of Three Wealth Pairs & Dynamic Maze with Toggled Blockades

Problem 1 - Power of Three Wealth Pairs Problem Statement An exclusive venue accepts customers only in pairs. You are given an array wealth of size N, where wealth[i] represents the wealth score of the i-th customer. A pair of customers (i, j) is considered valid if: wealth[i] + wealth[j] = 3^k for some non-negative integer k, and i < j. Find the total number of valid pairs. Constraints Constraint 1 <= N <= 100000 0 <= wealth[i] <= 1000000000 ...