1p3a_oj
Question
Find the distance from mid index to closest index
Question Details
Given an array, you need to find the index i such that 1s to the left of i are 0, and the distance to the nearest 1 on the right side is minimized. Implement the function def find_mid_index_dista
Full Details
🔒
Unlock all Sofi questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a sofi interview for a swe role during the coding round.
It covers the following topics: Arrays .