Target Software Engineer interview experience

The OA asked three main problems. One was about computing the distance between two strings where the allowed operations were delete, replace, and insert, repeated across Q queries and returning the minimum distance for each against a set of S strings. Another problem asked me to find “lucky numbers” within a huge range [l, r], where l and r could go up to 10^18 and the definition depended on an integer divisibility by the floor of the square root.

By the time I finished, I realized these weren’t typical “toy” prompts—they were algorithmic and required careful handling of constraints,