Google kickstart round E| Discussion

Revision en2, by loverBoUy, 2022-08-21 10:55:46

As I didn't find any blog regarding this. Let's di ~~~~~ Your code here... ~~~~~

scuss our approach here :) Question A) Simple but tricky.

Question B) I used binary search on multiset to find the largest number <=2*ri.

Question C) My logic was to find the minimum index I (0<= I <=n) such that both sides should be a palindrome.

Question D) I thought to use some brute force and don't know why it passed partially.

Your approach will be welcome in the comment box. Thank you

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English loverBoUy 2022-08-21 14:31:55 202
en4 English loverBoUy 2022-08-21 11:03:39 88
en3 English loverBoUy 2022-08-21 11:02:31 89
en2 English loverBoUy 2022-08-21 10:55:46 99
en1 English loverBoUy 2022-08-21 10:54:44 489 Initial revision (published)