String Compression, Longest Increasing Path, and a Kafka Trace-Grouping Design

Question 1: Implement a method that does basic string compression by counting consecutive repeated characters. If the compressed string is not shorter than the original string, return the original string. Discuss time complexity and space complexity Discuss edge cases Discuss code optimization Question 2: Longest Increasing Path in a Matrix. You can only move in four directions (up, down, left, r…

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