Interview Question for Software Engineer / Developers
- 0of 0 votes
Write an algorithm that uses the divide and conquer technique. Given an array V with n int elements the algorithm should calculate the number of times that two consecutive 0's appear. Example :If V = [3, 0, 0, 1, 0, 1, 3, 2, 0, 0, 0, 1, 2], the algorithm should return 3, Note that 0, 0, 0 corresponds to having 2 pairs of consecutive zeros.- KH November 17, 2014 in United States
I was wondering if you guys can give me a step by step approach in solving these questions. I'm a recent grad and I want to know the best solutions to solve these problems. Thanks!
| Report Duplicate | Flag | PURGE
Software Engineer / Developer Algorithm
Interview Type: Written Test
Open Chat in New Window