I recently attended a tech interview round 1. Where the interviewer asked this question. It seemed like an easy problem to me But took me 30+ minutes to solve it. My LC count is 400+. But I still took 30+ minutes to solve it. I just wanted to see how much time does others take to solve it. I would love it if you can clock your time while trying to solve this question and share it in the comments If you find it medium or easy and how long it took. \n\n```\nQuestion:\n-------------------------------------------------\n\nGiven a array of strings like : ["$", "$$", "$$", "$", "$$", "$$", "$$", "$", "$"]\nprint result array as : [1, 1.1, 1.2, 2, 2.1, 2.2, 2.3, 3, 4]\n\nNote: 1<=length of string <=2\n--------------------------------------------------\n\nFollow up: \nmax string length is dynamic.\n\nexample:\narray of strings : ["$", "$$$", "$$$$", "$", "$$$", "$$$", "$$$", "$", "$", "$$", "$$", "$$$", "$$"]\nresult array : [1, 1.1.1, 1.1.1.1, 2, 2.1.1, 2.1.2, 2.1.3, 3, 4, 4.1, 4.2, 4.2.1, 4.3]\n\nNote: 1<=length of string <=10^4\n\n--------------------------------------------------\n```\n\nThank you.

I recently attended a tech interview round 1. Where the interviewer asked this question. It seemed like an easy problem to me But took me 30+ minutes to solve i