Two Lists, Sorted Apart

Problem

An auction tool keeps a table `auction_book` with columns `(low_bid, high_bid)`. There is no primary key and the table may contain duplicate values.

Produce a single two-column result that sorts each column independently and lines them up row by row:
1. `low_bid` sorted ascending.
2. `high_bid` sorted descending.
3. The two sorted sequences placed side by side (the smallest `low_bid` next to the largest `high_bid`, and so on).

The two columns are sorted separately; values that shared a row in the source are not kept together.

Tables

Example rows — the live problem includes the full dataset.

Expected output

Your answer should return 4 rows with the columns low_bid, high_bid.

Starter code (SQL)

SELECT *
FROM auction_book;

Related SQL questions

• 3-Day Tweet Rolling AverageMedium
• 7-Day vs 28-Day Rolling Avg DivergenceMedium
• A/B Test Sample Ratio Mismatch (SRM) CheckMedium
• Accounts Streaming From Two Devices at OnceMedium
• Ad Campaign Funnel AnalysisMedium
• Agent Resolution RateMedium