Help with an Algorithm problem

No.12206222 ViewReplyOriginalReport
Could anyone help me solve this question or tell me if my response is correct?

I think the accurate count would be 2n - 100 since at most n numbers are being removed from the front and at most n numbers are being removed from the back. 100 are left untouched.