Category
leetcode
Given an array of integers and an integer k, the problem is to find the total number of continuous subarrays whose sum is divisible by k 
Increment Submatrices by One
The problem is to increment all elements of submatrices by 1, given a matrix of integers, the task is to return the updated matrix where all elements of submatrices are incremented by 1 
Closest Subsequence Sum
Given a list of integers and a target number, the problem is to find the closest subsequence of that list that add up to the target number, return the sum of that subsequence -
Stamping The Sequence
Given a target string and a set of characters, the problem is to find the minimal number of times the set of characters need to be used to form the target string, and return the order in which the characters are used 
Sum of Distances in Tree
Given an undirected tree, the problem is to find the sum of the distances between each pair of nodes in the tree, and return an array that contains the sum of distances between the node i and all other nodes, in the same order as the input
Made with love using Svelte, Three.js, TailwindCSS