Find all restaurants and sort by `rating` in ascending order.
Problem Statement
Examples
Input: restaurants collection: +-----+--------------+--------+ | _id | name | rating | +-----+--------------+--------+ | 1 | Pizza Palace | 4.5 | | 2 | Burger Barn | 3.8 | | 3 | Sushi Spot | 4.9 | +-----+--------------+--------+
Output: +-----+--------------+--------+ | _id | name | rating | +-----+--------------+--------+ | 2 | Burger Barn | 3.8 | | 1 | Pizza Palace | 4.5 | | 3 | Sushi Spot | 4.9 | +-----+--------------+--------+
Explanation: The collection documents are sorted according to the specified field order.
Complexity
Time Complexity: -
Space Complexity: -
Hints
Editorial & Approach
Problem Overview & Intuition
To solve "Sort Ascending", we query the MongoDB document store. The goal is to find all restaurants and sort by `rating` in ascending order. Using a targeted find query, the database engine filters and structures the BSON documents efficiently.
Step-by-Step Approach
- Identify Target Collection: Access the collection through the
dbinstance. - Construct Query / Pipeline: Build the query filter with appropriate comparison operators.
- Resolve Cursor: Invoke
.toArray()to transform the query cursor into the required array of documents.
Optimal Implementation (MongoDB)
function solve(db) {
return db.restaurants.find({}).sort({ rating: 1 }).toArray();
}
Complexity Analysis
Key Considerations & Edge Cases
- Empty Collections: If no documents match, the query cleanly returns an empty array
[]. - Missing / NULL Fields: Missing fields in documents are handled safely without throwing runtime exceptions.
- Type Coercion: BSON types (ObjectId, Numbers, Strings) are compared strictly according to MongoDB specifications.