This is the company https://front.com/\nIt\'s currently worth 1.3B\n\n**First Question**:\nhttps://leetcode.com/problems/word-break/\n\nI told them the recurrsive approch.\nThey asked if I had seen this question before, when I answered yes, they manually asked me to calculate time complexity.\nWhen I said exponential, they further asked to dig deep and come with exact answer.\nThe guy was helpful and I was finally able to come up with 2^n as Time complexity.\nAfter coding the solution, they asked me to further optimize it, I used memoization but couldn\'t complete the code.\n\n**Second Question**\nGiven different images, how would you sort them according to their similarity.\n\nFor context, I am a pure back end engineer. I told them I would take the color hex value of each pixel and compare them against each and every image and put them in priority queue.\nI guess he just wanted to see how i approach the problem.\n\nRejected \uD83D\uDC69\uD83C\uDFFD\u200D\uD83D\uDCBB

This is the company https://front.com/\nIt\'s currently worth 1.3B\n\nFirst Question:\nhttps://leetcode.com/problems/word-break/\n\nI told them the recurrsive a