Sahil Bhutani

Brings ideas to life with code! ✨

Software Engineer | Building Scalable Products & Microservices at Care Insurance | Experienced in System Design (HLD & LLD) | Skilled in React, JavaScript, Redux Toolkit, Next.js, React Native, and Node.js

Available/resumeNovember 04thJoined June 2021

Keep up to date with my latest projects and adventures!

No spam. Unsubscribe any time.

Pinned Cheep
Sahil Bhutani's feedSahil Bhutani
Sahil Bhutani βœ¨β€’
πŸ“Ή New Video Alert! πŸš€
πŸš€ Built a custom Chrome extension to automate Naukri profile updates with dynamic time settings, boosting visibility and job search efficiency.

Sahil Bhutani's feedSahil Bhutani
Sahil Bhutani βœ¨β€’
πŸ“Ή New Video Alert! πŸš€
πŸŽ₯ Master the basics with Star Pattern Problemsβ€”key for cracking entry-level coding interviews! Includes clear explanations and live coding for better understanding.

Sahil Bhutani's feedSahil Bhutani
Sahil Bhutani βœ¨β€’
πŸ“Ή New Video Alert! πŸš€
πŸŽ₯ Solved a popular Facebook interview question: Finding an element in a sorted infinite array. Includes problem breakdown, step-by-step approach, and an efficient code walkthrough.

Sahil Bhutani's feedSahil Bhutani
Sahil Bhutani βœ¨β€’
πŸ“Ή New Video Alert! πŸš€
πŸŽ₯ Covered how to find the floor and ceiling of a number in a sorted array using Binary Search. Step-by-step explanation with code walkthrough for an O(log n) efficient solution.

Sahil Bhutani's feedSahil Bhutani
Sahil Bhutani βœ¨β€’
πŸ“Ή New Video Alert! πŸš€
πŸŽ₯ Explained Binary Search and why it's more efficient than Linear Search for sorted arrays. Covers the two-pointer method, search range reduction, and O(log n) time complexity.

Sahil Bhutani's feedSahil Bhutani
Sahil Bhutani βœ¨β€’
πŸ“Ή New Video Alert! πŸš€
πŸŽ₯ Explained the time complexity of Linear Search in DSA with clear examples and comparisons. Shows how search time varies based on element position or absence in the array.

Sahil Bhutani's feedSahil Bhutani
Sahil Bhutani βœ¨β€’
πŸ“Ή New Video Alert! πŸš€
πŸŽ₯ Explained Linear Search in DSA using a simple example of finding a user in a database array. Covers concept, implementation, and outcome for easy understanding.