Time Complexity

Longest Increasing Subsequence

This problem is about finding the longest increasing subsequence in an array of integers. The input is an array of integers, and the output is the length of the longest increasing subsequence.

139
Nov 28
Sum of array elements

This problem asks for the sum of all elements in an array of integers. An example input is given as [1, 2, 3, 4, 5], and the expected output is 15 .

159
Nov 26
Longest Increasing Subsequence

Given an array of integers, this problem aims to find the length of the longest increasing subsequence within that array. For example, given the input array [10, 9, 2, 5 , 3, 7, 101, 18], the longest increasing subsequence would be of length 4, and would be composed of the values 2, 3, 7, 101.

145
Nov 20
Find the Largest Sum of a Contiguous Subarray

This problem asks you to find the largest sum of a contiguous subarray within a given array of integers. For example, given the array [-2, 1, -3, 4, - 1, 2, 1, -5, 4], the largest sum of a contiguous subarray would be 6 (4 + -1 + 2 + 1 = 6).

174
Nov 20
Sum of Array Elements

This problem asks you to write a function that returns the sum of the elements in an array. For example, if the input array is [1, 2, 3, 4, 5], the output should be 15 (1 + 2 + 3 + 4 + 5).

148
Nov 20
Longest Increasing Subsequence in an Array

Given an array of integers, this algorithm finds the length of the longest increasing subsequence in the array. For example, given the input [10, 9, 2, 5, 3, 7, 101, 18], the output would be 4.

156
Nov 19
Longest Increasing Subsequence in an Array

Given an array of integers, this problem aims to find the length of the longest increasing subsequence in the array. For example, given the array [10,9,2,5, 3,7,101,18], the longest increasing subsequence is [2,3,7,101] and the length is 4.

154
Nov 19
Maximum Subarray Sum

The "Maximum Subarray Sum" problem asks us to find the contiguous subarray within an array of numbers that has the largest sum. For example, given the array [-1, 3, -5, 4, 6], the largest sum would be 11, achieved by taking the subarray [3, -5, 4, 6].

171
Nov 19