1. Palindromic Paths in a Graph: You are given a graph where every edge has an English alphabet letter. The goal is to find the number of paths where the letters collected along the edges can be rearranged to form a palindrome.

2. Cuboid Tiling (DP/Math): Given an infinite supply of 1 x 1 x 2 cuboids, find the total number of ways to arrange them to construct a 2 x 2 x n cuboid.

3. Max Path Sum: Find the maximum possible sum along a path in a given graph.

This round focused heavily on grid problems. The interviewer asked two questions:

Maximal Rectangle in a Grid: Finding the largest rectangle containing only 1s. The expected approach was using a Monotonic Stack (similar to the largest rectangle in a histogram).

Maximal Square in a Grid: Finding the largest square containing only 1s. The expected approach for this one was Dynamic Programming (DP).