Given an array of 0s and 1s and an integer k, the problem is to find the minimum number of times a k-length sequence of bits need to be flipped (i.e. 0s to 1s or 1s to 0s) in order to obtain an array of all 1s 
Kth Smallest Instructions
Find the minimum number of k-length bit flips to make an array of all 1s or kth smallest string of instructions to reach the bottom-right corner of a grid 
Substring With Largest Variance
Given a string and an integer k, the problem is to find the substring of length k that has the largest variance of character frequencies in it 
Split Message Based on Limit
Given a string and an integer limit, the problem is to split the given string into a list of strings such that the length of each string does not exceed the given limit and return the list 
Find Minimum Time to Finish All Jobs
Given an array of jobs where each job has a start time, end time and a penalty if it is not finished on time, the problem is to find the minimum penalty that can be incurred by finishing the jobs in the order they are given
Made with love using Svelte, Three.js, TailwindCSS