title: Chunk SMS into SMSes of size 30 characters
body: <p>The problem statement is as follows - </p>
  
  <pre><code>There is a text messaging service.It provides with an API to send SMSes to a user, 
  but they can be at most 30 characters long. 
  Also it doesn't guarantee the order in which the messages will be received.
  
  
  You have to build a function which splits the text in chunks so that it can 
  be sent in multiple messages. Each chunk has to be :
  - upto 30 characters long
  - no word should be split in the middle
  - each chunk has to have its order suffixed in the form of '(k/n)' 
    e.g. "this is the first chunk (1/2)", "this is the second chunk (2/2)"
  - if the text provided to the function is within 30 characters limit, 
    no ordering should be suffixed
  
  Input/Output Format 
  Each test case consists of a single line of words. Words are space 
  separated. Any other character other than space is considered part of 
  the word. For each test case, output the minimum number of chunks C 
  required to fit the entire SMS. 
  
  Restrictions
  1 &lt;=C&lt;= 99; Input will be such that C remain in this mentioned limit 
  if your algorithm is optimal. No word will have a length that does 
  not fit in a single chunk (even after considering the suffix).
  
  Sample Input: 
  The best lies are always mixed with a little truth 
  There is no creature on earth half so terrifying as a truly just man!!!!!
  You know nothing, Jon Snow 
  
  Sample Output 
  3
  3
  1
  
  Explanation: 
  In first case, we will have to split as below 
  
  The best lies are always (1/3)
  mixed with a little (2/3)
  truth (3/3)
  
  First line is fully utilised with 30 characters in it. 
  Second line has 25 characters but if we try to fit last word in this line, 
  it becomes 31 characters. 'mixed with a little truth (2/2) 
  Hence we must split into 3 parts as above.
  </code></pre>
  
  <p>My approach -> was more around finding the approximate number of chunks first and then expanding on it but that didn't work. I was wondering is it even possible to first calculate how many chunks will be required mathematically or do we actually have to build chunks and see but then how do we build chunks without knowing 'n' of 'k/n'?</p>