Round 2: Stepping Up the Complexity
The second round of Code Frenzy was considerably more challenging, putting participants’ problem-solving skills to the test. Just like in the first round, three questions were presented, but this time, the complexity increased significantly.
Round 2 Problems
|
Problem Name |
Description |
|---|---|
|
The K-Diff Subarray |
Find the maximum subarray of length K with minimal difference between the maximum and minimum elements. |
|
String Manipulation Maze |
Transform one string into another using a series of character and substring operations. |
|
Pointer Labyrinth |
Navigate a maze-like data structure through complex pointer manipulation to extract specific information. |