Lexicographically Largest Valid Sequence — Algorithm Visualization & Coding Challenge

Choose Your Learning Path

How would you like to learn today?
Visualize algorithms in real time, explore them step by step, or challenge yourself with a test.Choose a path to focus—or scroll down to preview all options.

🧠 Active Learning

Visualize the algorithm step-by-step with interactive animations in real time.

📖 Passive Learning

Read the full explanation, examples, and starter code at your own pace.

🎯 Challenge Mode

Drag and arrange the algorithm steps in the correct execution order.

🧠 Select Active to activate

JUMP INTO VISUALIZATION
Watch algorithms run step by step.

Follow every state change, comparison, and transformation as the execution unfolds in real time.

📖 Select Passive to activate

Understanding Lexicographically Largest Valid Sequence
Detailed explanation and reference materials
Problem Overview

Construct the Lexicographically Largest Valid Sequence

Difficulty: Medium

Problem Statement

Given an integer n, find a sequence that satisfies all of the following:

  • The integer 1 occurs once in the sequence.
  • Each integer between 2 and n occurs twice in the sequence.
  • For every integer i between 2 and n, the distance between the two occurrences of i is exactly i.
  • The distance between two numbers in the sequence, a[i] and a[j], is defined as |j - i|.

Return the lexicographically largest sequence. It is guaranteed that a solution always exists.

A sequence a is lexicographically larger than a sequence b (of the same length) if in the first position where a and b differ, a has a number greater than the corresponding number in b.

For example, [0,1,9,0] is lexicographically larger than [0,1,5,6] because the first position they differ is at the third number, and 9 is greater than 5.


Example 1

Input:

plaintext
n = 3

Output:

plaintext
[3,1,2,3,2]

Explanation:

  • [2,3,2,1,3] is also a valid sequence, but [3,1,2,3,2] is lexicographically larger.

Example 2

Input:

plaintext
n = 5

Output:

plaintext
[5,3,1,4,3,5,2,4,2]

Example 3

Input:

plaintext
n = 4

Output:

plaintext
[4,2,3,2,1,3,4]

Constraints

  • 1 <= n <= 20
— Written by Saurabh Patil • B.Tech CSE • Software Developer

Categories
leetcode-problem-of-the-day
backtracking
arrays
java
Reference Link
https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/description

Loading component...

Starter Code
Test, modify, or copy the starter code. Click "Visualize" to import into the canvas.
Java
Output:
Understood Algorithm, Test Me now 🎮

🎯 Select Challenge to activate

🧠 Logic Puzzle
Think & Arrange, Don't Just Copy-Paste

Drag and arrange the algorithm steps in the correct execution order instead of spending time typing code letter by letter.

Arrange the Algorithm Correctly 🧩

The algorithm is divided into three logical parts. Carefully rearrange each section in the correct order to form a complete and valid solution.

Understand Below Algorithm

Don't Know Current Algorithm ?  

Green text means the instruction is placed in the correct position.

Red text means the instruction is in the wrong position.

Block Colors

Instructions with the same background color indicate particular blocks start and end.

A tick mark means the instruction is correct and locked.

🔒 Locked steps cannot be moved. Only unlocked steps are draggable.

🔊 Enable sound for swap feedback and completion effects.

DrawToCode — Visualize, Practice & Master Algorithms

Learn data structures and algorithms through interactive visualizations. Practice coding problems, track your progress, and understand concepts deeply.

EmailLinkedInTwitterInstagramGitHub
© 2026 DrawToCode. All rights reserved.