Back to all interviews

ziphq

5 interview questions available

Maximize non-adjacent sum on an N-ary tree

Find flush and straight groups in cards

Design in-memory DB with TTL and history

Compute maximum sum in a tree without adjacency

Find root IDs and paths