Pergunta de entrevista da empresa Meta

One of the key questions was a typical array/string problem solved with a two-pointer or sliding-window technique: maintain a window, update a frequency map/counters as the pointers move, and ensure the solution runs in linear time. I was also asked a graph-style BFS question that required using a queue, tracking visited states, and returning the minimum number of steps under constraints, with careful handling of corner cases.