Leetcode: https://leetcode.com/problems/design-a-stack-with-increment-operation/ Create a simple stack which takes a list of elements. Each element contains a stack operator (push, pop, inc) and a value to either push/pop or two values, n and m, which increment the bottom n values by m. Then print the topmost value of the stack after every operation…

Dictionary encoding is a loss-less compression technique to compress a list of words. Dictionary encoding works by maintaining a mapping of unique words to their compressed value, and replacing occurrence of the words with the compressed value Here is an example: Input String: “USA,USA,USA,USA,Mexico,Canada,Mexico,Mexico,Mexico,Argentina” Potential Encoder Output String: “USA,Mexico,Canada,Argentina:0,0,0,0,1,2,1,1,1,3”