msatanzeel's blog

By msatanzeel, history, 2 years ago, In English

Today there was Google's Kickstart round H and I have a doubt in the question 3 of it, here's that link to the problem , I have solved this using a doubly linked list data structure for efficient replacements and anyone can easily analyze that over all time time complexity is O(n) , here's is the link to my code.Can someone please tell the reason for the TLE over large inputs..

Full text and comments »

  • Vote: I like it
  • +1
  • Vote: I do not like it