Category
dynamic-programming
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 
Minimum One Bit Operations to Make Integers Zero
Given an array of integers, the problem is to find the minimum number of operations needed to make all the integers in the array 0 by performing only one bit operation (flipping one bit) at a time