Gaurav Sen's video: Hard interview problems AlgoWorkout with @Kartik Arora

This is a Google Interview Question. You have a robot which can move in the 1-D plane, left and right directions. You need to send the robot as far as you possibly can by deleting a subarray of instructions. Can you do it in O(n) time? Kartik's channel: https://www.youtube.com/channel/UCJZF4VOyV9zfm2SH_QdeOWw 00:00 Intro 00:21 Problem Definition 03:25 Brute Force solution 06:06 Optimized simple Enhancement 08:14 Harder Problem Version 09:17 Prefix sums solution 12:30 Observations 14:20 Simple method recap 21:05 HashMap solution 23:10 Time complexity analysis 24:33 Hard observations 27:06 Optimized solution 31:06 Conclusion 31:34 Final Thoughts InterviewReady System Design Course: https://get.interviewready.io/ You can follow me on: Instagram: https://www.instagram.com/applepie404/ LinkedIn: https://www.linkedin.com/in/gaurav-sen-56b6a941/ Github: https://github.com/coding-parrot/ Twitter: https://twitter.com/gkcs_