Create a function `sum` that implements currying. Currying is a transformation of functions that translates a function from being callable as f(x, y, z) into callable as f(x)(y)(z).

Implement Currying

Given two arrays of integers, find the pair of values (one value in each array) with the smallest (non-negative) difference.

Smallest Difference

Create a Form Component in React that renders out a list of input fields and validates them before finally submitting the form. Create the form from scratch WITHOUT using any third-party libraries like Formik or react-hook-forms.

Form Validation

Given 2 strings, find the minimum number of operations required to change one string to the other. An operation is defined as either replacement of a character, deletion of a character, or addition of a character. This problem is also called Levenshtein Distance. Levenshtein distance is a string metric for measuring the difference between two sequences.

Spotify

Implement Currying

Smallest Difference

Form Validation

Levenshtein Distance

Pages

Algochurn

Frontend Churn

Friends

Links