a problem that can be solved by greedy algorithm，
two bit strings， we have two operation, one changes prefix m*k*i bits to 0s or 1s, the other changes any substrings whose lengths are k bits to be 0s or 1s. Minimize the operation times.

Question

a problem that can be solved by greedy algorithm，
two bit strings， we have two operation, one changes prefix m*k*i bits to 0s or 1s, the other changes any substrings whose lengths are k bits to be 0s or 1s. Minimize the operation times.

someone · Accepted Answer

Can you explain your interview question in detail? What do you mean by "m*k*i"?

Google

Google Interview Question

Interview Answer

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches