Josephus Problem Algorithm using Bit Manipulation | Bit Manipulation Interview Questions
Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we explain question Josephus Problem and discuss the algorithm to solve this problem using bit manipulation. In this problem,
1. You are given an integer N which represents the total number of soldiers standing in a circle having position marked from 1 to N.
2. A cruel king wants to execute them but in a different way.
3. He starts executing soldiers from 1st position and proceeds around the circle in clockwise direction.
4. In each step, every second soldier is executed.
5. The elimination proceeds around the circle (which is becoming smaller and smaller as the executed soldiers are removed), until only the last soldier remains, who is given freedom.
6. You have to find the position of that lucky soldier.
Click here to submit this question: https://www.pepcoding.com/resources/d...
For a better experience and more exercises, VISIT:
#josephus #bitmanipulation #competitiveprogramming
Have a look at our result:
Follow us on our FB page: / pepcoding
Follow us on Instagram: / pepcoding
Follow us on LinkedIn: / pepcoding-education
Join us on Telegram: https://t.me/joinchat/UVTjJE83a-zFnPB
Nesta página do site você pode assistir ao vídeo on-line Josephus Problem Algorithm using Bit Manipulation | Bit Manipulation Interview Questions duração hora minuto segundo em boa qualidade , que foi baixado pelo usuário Pepcoding 31 Agosto 2020, compartilhe o link com seus amigos e conhecidos, no youtube este vídeo já foi visto 30,427 vezes e gostou 709 espectadores. Boa visualização!
