โ† Flipkart questions

Prisoner cell division and path ways with obstacles

Filed under Flipkart

The question

Determine if enemies among a set of prisoners can be divided equally into two cells, and find the total number of ways a monkey can reach the end of a path containing stop-movement obstacle nodes.

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

Related Flipkart questions

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