Onsite

Three-Round Onsite With Longest Increasing Path, a Greedy Problem, and an Inventory Service Design

VisaSoftware Engineer · Onsite · Sep 2026

Round 1: the original LeetCode problem, longest-increasing-path-in-a-matrix. Debugging wasn't very convenient. I also had to write my own test cases and my own main, so that held me up for a long time and I didn't have enough time. At the end I brought up the optimal solution, using memoization to record results, but I was out of time. > Given an m x n integers matrix, return the length of the lo…

Shared by a candidate · reported Sep 2026. Interview formats change; use it as a guide, not a script.