MongoDB
Categories:
Code Problem / Data Structures and Algorithms / Recursion (32)
Code Problem / Data Structures and Algorithms / Binary Search (30)
Code Problem / Data Structures and Algorithms / Linked Lists (26)
Code Problem / Data Structures and Algorithms / Backtracking (26)
Code Problem / Data Structures and Algorithms / Stacks and Queues (25)
Code Problem / Data Structures and Algorithms / Hashing (24)
Databases / SQL / Backup and Recovery (19)
Code Problem / Data Structures and Algorithms / Arrays and Strings (19)
Databases / SQL / Database Normalization (18)
Code Problem / Data Structures and Algorithms / Time Complexity (17)
Databases / SQL / Locking (16)
Databases / SQL / Replication (15)
Databases / SQL / SQL Queries (13)
Code Problem / Data Structures and Algorithms / Graphs (13)
Databases / SQL / Database Security (13)
More...
Recent solutions:
Check these solutions from our community:
Update the email field for all users in a MongoDB document whose id is greater than 100.
About this solution: The candidate's solution is complete and solves the problem. The candidate has used the $gt operator to find all documents where the id is greater than 100 and the $set operator to update the email field for all documents that match the query.
Given an array of integers, this problem asks you to find the lowest positive integer that is not present in the array. You are to do this in linear time and constant space.
About this solution: The candidate's solution is correct and solves the problem. The approach is to sort the array and then iterate through it to find the first missing positive integer. This solution is optimal because it is linear time and constant space.
Given an array of integers, this function will return the sum of all integers that are greater than or equal to 10.
About this solution: This is a great solution! It is very clear and easy to follow, and it efficiently solves the problem.