Round 1 : DSA Round

• Given a string containing lowercase letters and digits, find the largest continuous numeric grouping. Example: "gt12cty65mt1" Numeric groups are: 12, 65, 1 Largest = 65
• This problem is the classic Minimum Swaps to Sort an Array. Optimal Approach Store element values with original indices. Sort the array. Detect cycles. For a cycle of size k, swaps needed = k - 1.