JobsJob TrackerJob alerts

Veritas · 109 questions

All 109Coding 69System Design 2Low-Level Design 4Behavioral 4
  • Josephus problem in circular linked listsCoding
  • Date format conversion and disjoint subgraph weightsCoding
  • Pointers, linked list operations, tree traversals, and Java OOPCoding
  • Compiler design flow for method overloading and OOP polymorphismLow-Level Design
  • Delete nodes greater than K from linked listCoding
  • Implement Insertion SortCoding
  • Reverse words in a sentence without extra spaceCoding
  • Count set bits and return positions in arrayCoding
  • DSA, strings, and arrays questionsCoding
← Veritas questions
  1. Interview questions
  2. Veritas
  3. Josephus problem in circular linked lists
Coding

Josephus problem in circular linked lists

Filed under Veritas

The question

Write a program to solve the Josephus problem using circular linked lists.

No write-up yet. Related questions below have one.

Related Veritas questions

  • Middle of Linked List
  • Reverse an array without extra space
  • Rolling string
  • Doubly Linked List and Singly Linked List Operations
  • Delete a node given only a pointer to that node
Date format conversion and disjoint subgraph weights →

Collected from public candidate posts and coding forums. Updated Nov 2026.