Solve tiling, probability, and nested-radical puzzles
Company: J.P. Morgan
Role: Data Scientist
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: This multi-part question evaluates combinatorics and algorithmic skills through 2×N and 3×N domino tiling problems, analysis of an infinite nested square root, and exact discrete probability for selecting couples, testing competencies in recurrence relations, dynamic programming reasoning, limit/closed-form evaluation, and combinatorial counting within the Coding & Algorithms domain. It is commonly asked to assess a candidate's ability to recognize and derive mathematical recurrences, translate infinite expressions into closed forms, and perform precise probability counting, representing a blend of conceptual mathematical understanding and practical algorithmic application.