akunacapital | | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The online assessment (OA) link was sent shortly after the application and was valid for one month. The OA consisted of three coding questions, with a total time limit of 120 minutes. The difficulty level was approximately easy to medium, similar to LeetCode problems.
Technical Questions
- Minimum Swap: Determine the minimum number of swaps required to sort an array.
- Array Manipulation: Calculate the difference between each element and the element after it, summing the results.
- Maximum Subarray: Solve a dynamic programming problem to find the maximum sum of a subsequence of an array, with the restriction that no two consecutive numbers can be selected.
Tips & Insights
Focus on practicing array manipulation and dynamic programming problems, as they are commonly featured in technical assessments.