GamifiedGamified challengesPracticeRaceLeaderboardPricing

Learn data structures by watching them move, then doing it yourself. Press M anytime to toggle sound.

A product of Amypo Technologies, Coimbatore.

Learn

  • All topics
  • Learning path
  • How it works
  • About dotprep

Practice

  • Practice arena
  • Daily challenge
  • Gamified challenges
  • Race mode
  • Leaderboard

Interview prep

  • Java interview
  • Coding questions
  • Company questions
  • System design
  • Jobs & careers

You

  • Dashboard
  • Settings
  • Pricing
  • Create account

© 2026 dotprep

Content last updated 20 November 2026

GamifiedGamified challengesPracticeRaceLeaderboardPricing
Log inStart free
Gamified challengesN-Queens

Gamified challenge · Backtracking

N-Queens

Place n queens on an n × n board, one in each row, so that no two queens share a column or a diagonal. One queen is already pinned at row row, column col (0-based) and can't move.

Write placeQueens(n, row, col) (place_queens in Python) that returns q, where q[r] is the column of the queen in row r. Any safe placement counts. For n = 4, row = 0, col = 1 that's [1, 3, 0, 2].

Sign in to play N-Queens

This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.

Sign in with Google

or log in with email · create an account