Arrays and Lists
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 the elements in a list of integers. An example input would be [1, 2, 3, 4, 5], and the corresponding output would be 15.
About this solution: This solution is complete and solves the problem. The approach is straightforward and easy to understand.
To find the sum of the elements in a list of integers, simply iterate through the list and add each element to a total.
About this solution: This is a good solution that demonstrates a level of completeness and solves the problem. The approach is straightforward and easy to understand.
Given an array of integers, find the maximum sum of a contiguous subarray. For example, given the array [-2, 1, -3, 4, -1, 2, 1 , -5, 4], the maximum sum of a contiguous subarray is 6 (the sum of the subarray [4, -1, 2, 1]).
About this solution: This is a great solution! The candidate has thought about the problem carefully and has come up with a very elegant solution. The candidate has also provided a clear explanation of how the solution works. Well done!
This problem asks you to return the sum of all the odd integers in an array. For example, if the input array is [1, 2, 3, 4, 5], the output should be 9.
About this solution: This solution is optimal because it uses a generator expression to filter out the even numbers and then sums the odd numbers. This is optimal because it is a one-liner and it is also very readable.
Given a list of integers, the largest sum of non-adjacent numbers can be found by writing a function. The function will take the list as input and return the largest sum possible.
About this solution: The candidate's solution is correct and solves the problem. The approach is to use a dynamic programming approach, which is a good approach for this problem. The candidate could have been more concise in their solution, but overall the solution is correct and solves the problem.
To find the sum of integers in an array, simply iterate through the array and add each integer to a total sum.
About this solution: This solution is complete and solves the problem. The approach is straightforward and easy to understand.
This problem asks the programmer to sum the elements of an array of integers. The input is an array of integers and the output is an integer representing the sum of the elements in the array.
About this solution: This solution is complete and solves the problem. The approach is straightforward and easy to understand.
Given a list of integers, the largest difference between any two adjacent elements can be found by using a function. An example input would be [2, 4, 1, 16, 7, 5] and the corresponding output would be 15.
About this solution: This solution is correct and demonstrates a level of completeness. The approach is also optimal, as it only loops through the list once.