JavaScript
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:
This technical problem deals with finding the sum of all elements in an array. An example input is given as [1, 2, 3, 4] and the expected output is 10.
About this solution: This is a great solution! The candidate has clearly thought through the problem and has provided a very efficient solution.
Given an object with nested objects, this function flattens the object by creating key paths for nested values.
About this solution: This solution is correct and demonstrates a level of completeness. It solves the problem and takes a general approach of flattening the object.
The function should take an array of integers as input and return the sum of the odd integers in the array.
About this solution: This is a great solution! The candidate has thought through the problem and provided a detailed explanation of their approach. This solution is optimal because it uses a for loop to iterate through the array and check if each element is odd. If it is, it adds it to the sum. This solution is optimal because it only iterates through the array once, and it doesn't use any extra space.
Given an array of integers, this function returns the largest difference between any two elements in the array.
About this solution: The candidate's solution is correct and demonstrates a level of completeness. The approach is also correct.
This problem asks the programmer to write a function that takes in an array of integers and returns the sum of the odd numbers in the array. For example, given the input array [1, 2, 3, 4, 5], the function should return 9 (1 + 3 + 5).
About this solution: This is a great solution! The candidate has thought through the problem and provided a detailed explanation of their approach. This solution is optimal because it uses a for loop to iterate through the array and check if each element is odd. If it is, it adds it to the sum. This solution is optimal because it only iterates through the array once, and it doesn't use any extra space.
The function should take in an array of integers and return the sum of the elements in the array.
About this solution: This is a great solution! The candidate has clearly thought through the problem and has provided a very efficient solution.
This technical problem involves writing a function that takes an array of integers as input and returns the sum of the integers in the array. An example input and output are provided in the problem statement.
About this solution: This is a great solution! The candidate has used the reduce method, which is an efficient way to iterate over an array and return a single value.
This technical problem deals with determining whether a string of parentheses is balanced. A string is considered balanced if there are an equal number of open and closed parentheses, and each open parentheses is matched with a closed parentheses.
About this solution: This solution is correct and demonstrates a good understanding of the problem. The approach is simple and efficient, and the code is clean and easy to read.