Walmart Global Tech Software Engineer interview experience

The first was the most algorithmic: given two equal-length arrays, I had to compute a value based on comparisons across A and B, then maximize it over all permutations of B. That one pushed me the hardest.

The second problem was more about implementing an API-driven scheduler: I had to support add-task and execute-tasks behavior with priorities. My initial mental model assumed it would run one task at a time repeatedly, but the example clarified that all tasks were executed at once, which flipped the way I approached the ordering logic.

The third question was a data