Given API: int Read4K(char* buf); It reads data from a file and records the position so that the next time when it is called it read the next 4k chars (or the rest of the file, whichever is smaller) from the file. The return is the number of chars read. Todo: Use above API to Implement API "int Read(char* buf, int n)" which reads any number of chars from the file.

Given a mapping of alphabets to integers as follows: 1 = A 2 = B 3 = C ... 26 = Z Given any combination of the mapping numbers as string, return the number of ways in which the input string can be split into sub-strings and represented as character strings. For e.g. given "111" -> "AAA", "AK", "KA" -> 3 Valid combinations are ({1,1,1}, {1,11},{11,1}) = 3 "11" -> "AA", "K" -> 2 Valid combinations are ({1,1},{11}) = 2 "123" -> "ABC", "LC", "AW" -> 3 Valid combinations are ({1,2,3},{1,23},{12,3}) = 3 You don't have to return all the mappings, only the number of valid mappings.