-
Question 1 (Greedy):
- An easy greedy algorithm problem.
-
Question 2 (Dynamic Programming):
- A 1D DP question that was straightforward for those with DP experience.
- The task was to find the maximum sum in an array with the option to either move sequentially or jump to prime numbers ending in 3.
- Solution involved memoization and setting up proper logic for jumps based on number properties.
-
Question 3 (Graph):
- A directed cyclic graph problem.
- Initially thought to use Kahn’s algorithm due to the *directed nature, but it turned out to be a *simpler DFS-based solution as the graph was cyclic.
- *Partially solved, achieving **2.5/3 correct solutions, ranking *5th overall.
-
C Language Code with Pointers:
- Required to code using C pointers and memory allocation with malloc and calloc.
- I requested to use C++ due to syntax familiarity but was asked to proceed with *C, which *impacted my performance.
-
Memory Allocation:
- Explained static, dynamic, and register memory allocation in C/C++.
- Follow-up: Discussed the storage of static and constant variables.
-
Linked List:
- Tasked with reversing a linked list in k-sized parts.
- *Coded it from scratch, presented **two approaches, though faced *some issues.
-
Copy Mechanisms:
- Explained shallow copy and deep copy.