How Linked List will screw your Interview - Do this in O(1) space!

✅New YouTube Account - Developer Bhaiya 👉🏻https://bit.ly/developer-bhaiya-youtube Gaurav challenges Rachit with a hard interview question on Linked Lists.

The problem becomes extremely difficult when the interviewer asks to solve this in O(1). Watch till end to see how to tackle that part also.
Watch the video to see how Rachit tackles this problem.
Want more such collabs? Let us know in comments :)

================
Important Playlists:
================
Famous Interview Questions You Must Know ► https://www.youtube.com/watch?v=u5-ss5kKy7g&list=PLfBJlB6T2eOshO8-LYaMt-Pes1IFojJ_l
Tips & Tricks for Success in Career ► https://www.youtube.com/playlist?list=PLfBJlB6T2eOv8klCHHNVLOmTOIxKu-xzn
How to Improve at Data Structures ► https://www.youtube.com/playlist?list=PLfBJlB6T2eOup9gVZLAMjEV50YPKcPXuO
OOPS Interview Questions ► https://www.youtube.com/watch?v=qsMahidcehY&list=PLfBJlB6T2eOv0s4dZXm_uhOt5GmmfDs8-
Gaurav Challenges Rachit ► https://www.youtube.com/playlist?list=PLfBJlB6T2eOvIEiSo43vr4vk7ASI4GkVS
Lectures & Tutorials
================
Dynamic Programming: Zero to Hero ► https://www.youtube.com/playlist?list=PLfBJlB6T2eOtMXgK3FLUTawHjzpIEySHF
Dynamic Programming on Trees ► https://www.youtube.com/playlist?list=PLfBJlB6T2eOsET4tlfcLs7oXR7kCyt1xc
Graph Theory for Beginners ► https://www.youtube.com/playlist?list=PLfBJlB6T2eOu3dTPKzvAf2axlmQUXGY91
My Code Library
==============
Github ► https://github.com/rachitiitr/DataStructures-Algorithms
Follow me:
==========
Instagram ►https://www.instagram.com/rachitjain2095
LinkedIn ► https://www.linkedin.com/in/rachitiitr/
Facebook ► http://fb.me/AlgorithmsWithRachitJain
Programming Blog ► http://rachitiitr.blogspot.com
Twitter ► https://twitter.com/RachitJ55307787
Programming Profiles:
===================
CodeForces ► http://www.codeforces.com/profile/rachitjain
CodeChef ► http://www.codechef.com/users/rachitiitr

Видео How Linked List will screw your Interview - Do this in O(1) space! канала Rachit Jain