Cohesity Interview Experience || MTS-3 || 1st Round
Summary
I attended the first round interview for an MTS-3 role at Cohesity. I solved the first coding problem completely but struggled with the second, ultimately receiving a failed verdict.
Full Experience
Questions Asked:
Coding-round in code-signal
Response
- Took some time to solve 1st question but passed for all test cases.
- Second question i tell the approach, but didn't properly code it due to time constraint. It passed 10 test-cases out of 15.
Verdict
Failed. They want to come up with own examples to validate your code. I explain my code with the examples which are mentioned in the question.
Interview Questions (2)
Minimum Number of Days to Make m Bouquets
Problem: Given an array where each element represents the day a flower will bloom, determine the minimum number of days required to make m bouquets, each consisting of k consecutive blooming flowers. Refer to the linked LeetCode problem for full details.
Largest Plus Sign
Problem: Given an n x n binary grid where 1 represents a usable cell and 0 an obstacle, find the order of the largest axis-aligned plus sign of 1's that can be formed. See the linked LeetCode problem for the complete description.