## Algorithms

##### String permutation checker

This technical problem involves implementing an algorithm to check if one string is a permutation of another. An example input would be "abc" and "cba", with the expected output being " true".

192
Feb 25
##### First Non-Repeating Character in a String

Given a string, this function returns the first character that does not repeat itself anywhere in the string. If there is no such character, the function returns a space.

185
Feb 25
##### Longest Consecutive Sequence

Given an array of integers, this algorithm will find the length of the longest consecutive sequence. It runs in O(n) time and uses only O(1) space.

188
Feb 25
##### Sum of array elements

This problem asks you to sum the elements of an array of integers. For example, if the array is [1, 2, 3, 4], the sum would be 10.

188
Feb 25
##### Find the sum of the elements in an array of integers.

To find the sum of the elements in an array of integers, simply add all of the elements together. In the example given, the sum would be 1 + 2 + 3 + 4 = 10.

200
Feb 25
##### Summing the Elements of an Array

This problem can be solved by iterating through the array and adding each element to a running sum.

215
Feb 25
##### Longest Increasing Subsequence in an Array

Given an array of integers, this problem seeks to find the length of the longest increasing subsequence within that array. A subsequence is defined as a sequence of elements that can be derived from another sequence by deleting some or no elements, without changing the order of the remaining elements. In the given example array, the longest increasing subsequence has a length of 6.

192
Feb 24
##### Sum of integers in an array

This problem asks you to write a function that calculates the sum of a given array of integers.

189
Feb 24