---
title: "Discussion on \"Josephus Problem in O(1) Time Complexity\" | Hashnode"
description: "Discussion on \"Josephus Problem in O(1) Time Complexity\". In computer science this is counting puzzle with count-out logic. It is similar to popular Netflix Drama, Squid Game. So the question goes like :\nThere will be n chairs, numbered 1 to n. Person sitting on the first chair will kill the next person(sit..."
url: "https://hashnode.com/posts/josephus-problem-in-o1-time-complexity/61ed5915a12088017fbebf71"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Josephus Problem in O(1) Time Complexity](https://shiwanisinha.hashnode.dev/josephus-problem-in-o1-time-complexity?utm_source=hashnode&utm_medium=feed)

In computer science this is counting puzzle with count-out logic. It is similar to popular Netflix Drama, Squid Game. So the question goes like : There will be n chairs, numbered 1 to n. Person sitting on the first chair will kill the next person(sit...

Jan 23, 2022 · 3 min read · shiwanisinha.hashnode.dev  
Read the article

-   [#data-structures](https://hashnode.com/tag/data-structures)
-   [#problem-solving-skills](https://hashnode.com/tag/problem-solving-skills)
-   [#coding](https://hashnode.com/tag/coding)
-   [#interview](https://hashnode.com/tag/interview)
-   [#microsoft](https://hashnode.com/tag/microsoft)

## Written by

[Shiwani Sinha](https://hashnode.com/@shiwanisinha)

@shiwanisinha

  
[View profile](https://hashnode.com/@shiwanisinha)

SOFTWARE DEVELOPER @Valuelabs

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
