WeRide

6 questions tracked6 with solutions

🔍

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

Showing 6 of 6 questions

HardFind Edges in Shortest Paths✓ Our Solution

100

Depth-First SearchBreadth-First SearchGraphHeap (Priority Queue)+1

MediumMaximize Greatness of an Array✓ Our Solution

ArrayTwo PointersGreedySorting

HardMaximum Profit in Job Scheduling✓ Our Solution

ArrayBinary SearchDynamic ProgrammingSorting

HardLongest Increasing Path in a Matrix✓ Our Solution

ArrayDynamic ProgrammingDepth-First SearchBreadth-First Search+4

HardSwim in Rising Water✓ Our Solution

ArrayBinary SearchDepth-First SearchBreadth-First Search+3

HardText Justification✓ Our Solution

ArrayStringSimulation