Recently I gave an online coding interview where I was asked the following question - Largest possible square that can be built by cutting two sticks: We want
Why I created a duplicate thread I created this thread after reading Longest increasing subsequence with K exceptions allowed. I realised that the person who wa
I did search and looked at these below links but it didn't help . Point covering problem Segments poked (covered) with points - any tricky test cases? Need eff