Implement and use a version comparator

Q: Implement and use a version comparator

This question evaluates string parsing, comparator design, sorting algorithm efficiency, and handling of semantic versioning semantics such as numeric versus non-numeric segments, missing segments, and pre-release ordering for large identifier lists.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You are given up to 100,000 version-like identifiers (e.g., "1.0", "01.2.0", "2.0.0-alpha", "1.10.3"). Implement compare(a, b) that orders identifiers by: (

split by '.', compare numeric segments as integers; (
missing segments are treated as 0; (
pre-release tags (e.g., '-alpha', '-beta', '-rcN') sort before the corresponding release; numeric build metadata after a '+' is ignored for ordering. Use your comparator to return the list sorted in ascending order. Discuss time and space complexity and edge cases (leading zeros, different lengths, non-numeric segments). Provide code.

Implement and use a version comparator

Overview

Comments (0)