Gojek

5 questions tracked5 with solutions

🔍

Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough

Showing 5 of 5 questions

MediumBinary Tree Level Order Traversal✓ Our Solution

100

TreeBreadth-First SearchBinary Tree

MediumSimplify Path✓ Our Solution

100

StringStack

HardSliding Window Maximum✓ Our Solution

100

ArrayQueueSliding WindowHeap (Priority Queue)+1

MediumConvert an Array Into a 2D Array With Conditions✓ Our Solution

ArrayHash Table

ArrayTwo PointersSorting