โ† Josh Technology questions

Minimum jumps on bridge array and BST average check

Filed under Josh Technology

The question

Find the minimum number of jumps required to cross a bridge represented as an array of 0s and 1s given an array of jump step limits. Also, check if all root node values in a BST equal the average of their left and right children, deleting nodes where false.

No write-up yet. Related questions below have one.

Related Josh Technology questions

Collected from public candidate posts and coding forums. Updated Nov 2026.