Round 1

https://leetcode.com/problems/string-compression/
https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/

Round 2

https://leetcode.com/problems/text-justification/
Assume the input is already given as separate lines but they may contain any number of words.

Instead of max width for each line you are given a max number of words and the words should be evenly distributed across each line.

Round 3

1. https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/

2. A string is stored in a binary tree as below. Only leaf nodes contain the strings. Given an index get char at that index

    Eg:            
   
    							          Node 0: (Length: 12)
    		LeafNode 1: (Length: 1, String: “a”) 	   	Node 2:(Length 11)
    					
    					 LeafNode 3: (Length 3, String: “abc”)             LeafNode4: (Length 8, String : “12345678”)

Round 4

https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string/
https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/