How to Solve the Josephus Problem Using a Linked List in Python

Submitted by razormist on Saturday, November 15, 2025 - 23:10.

In this tutorial, we will learn how to program "How to Solve the Josephus Problem Using a Linked List in Python". The objective is to solve the Josephus problem using a linked list. This tutorial will guide you step by step through methods for solving the Josephus problem. By the end of this tutorial, you will have a solid understanding of how to implement this task effectively in Python, helping you strengthen your problem-solving abilities and improve your coding skills.

This topic is straightforward and easy to understand. Simply follow the instructions provided, and you will complete it with ease. The program will guide you step by step through the process of solving the Josephus problem. So, let’s dive into the coding process!

Getting Started:

First you will have to download & install the Python IDLE's, here's the link for the Integrated Development And Learning Environment for Python https://www.python.org/downloads/.

Creating Main Function

This is the main function of the application. The following code will display a simple GUI in terminal console that will display program. To do this, simply copy and paste these blocks of code into the IDLE text editor.

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None
 
 
class CircularLinkedList:
    def __init__(self):
        self.head = None
 
    def append(self, data):
        node = Node(data)
        self.insert_at_end(node)
 
    def get_node(self, index, start):
        if self.head is None:
            return None
        current = start
        for _ in range(index):
            current = current.next
        return current
 
    def get_prev_node(self, ref_node):
        if self.head is None:
            return None
        current = self.head
        while current.next != ref_node:
            current = current.next
        return current
 
    def insert_after(self, ref_node, new_node):
        new_node.next = ref_node.next
        ref_node.next = new_node
 
    def insert_before(self, ref_node, new_node):
        prev_node = self.get_prev_node(ref_node)
        self.insert_after(prev_node, new_node)
 
    def insert_at_end(self, new_node):
        if self.head is None:
            self.head = new_node
            new_node.next = new_node
        else:
            self.insert_before(self.head, new_node)
 
    def remove(self, node):
        if self.head.next == self.head:
            self.head = None
        else:
            prev_node = self.get_prev_node(node)
            prev_node.next = node.next
            if self.head == node:
                self.head = node.next
 
 
def has_one_node(cllist):
    return cllist.head.next == cllist.head
 
 
def get_josephus_solution(cllist, k):
    if cllist.head is None:
        return None
    start = cllist.head
    while not has_one_node(cllist):
        to_remove = cllist.get_node(k - 1, start)
        start = to_remove.next
        cllist.remove(to_remove)
    return cllist.head.data
 
 
# ------------------- MAIN PROGRAM LOOP -------------------
while True:
    print("\n================ Solve the Josephus Problem Using a Linked List ================\n")
 
    a_cllist = CircularLinkedList()
    n = int(input('Input number of people: '))
    k = int(input('The kth person will be executed. Input k: '))
 
    for i in range(1, n + 1):
        a_cllist.append(i)
 
    ans = get_josephus_solution(a_cllist, k)
    print(f'The person at position {ans} won\'t be killed.')
 
    opt = input("\nDo you want to try again? (yes/no): ").strip().lower()
    if opt == 'no':
        print("Exiting program...")
        break
    elif opt != 'yes':
        print("Invalid choice. Exiting program...")
        break

Output:

There you have it we successfully created How to Solve the Josephus Problem Using a Linked List in Python. I hope that this simple tutorial help you to what you are looking for. For more updates and tutorials just kindly visit this site. Enjoy Coding!

More Tutorials for Python Language

Python Tutorials