Sahil Bhutani

Brings ideas to life with code! ✨

Frontend Developer. @ADG ONLINE Solutions | Skilled in React | Javascript | Redux Toolkit | Next Js | React Native | 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! πŸš€
πŸš€ Automating Naukri Profile Updates with My Custom Chrome Extension

- Developed a custom Chrome extension to automate Naukri profile updates.

- Allows dynamic setting of time limits for profile updates (in minutes).

- Removes the need for manual updates, ensuring your profile stays at the top.

- Enhances visibility and optimizes job search management.

- Practical solution for anyone looking to boost their career growth and profile visibility.

#ChromeExtension #Automation #TechInnovation #CareerGrowth #WebDevelopment #Productivity

Sahil Bhutani's feedSahil Bhutani
Sahil Bhutani βœ¨β€’
πŸ“Ή New Post Alert! πŸš€
Here's an idea πŸ’‘ to tackle a common issue in the Food Rescue feature in Zomato India ie. preventing two users from exploiting the system by 2 person by ordering and canceling to get discounted food as mentioned by Bhanu in Validation listπŸ“„ .

The Solution πŸ’‘:

When a user cancels a Food Rescue order, the system should prevent the same food from being re-ordered or delivered within a certain radius (e.g., 1-2 km) for a set period (e.g., 1-2 hours). This would stop users from exploiting the system by ordering and canceling to get discounted meals.

How It Works:

  • 1. User places a Food Rescue order at a discounted price.
  • 2. User cancels the order.
  • 3. System activates restrictions: No one can reorder that food within the defined radius for a specific time.

zomato_issue

Sahil Bhutani's feedSahil Bhutani
Sahil Bhutani βœ¨β€’
πŸ“Ή New Video Alert! πŸš€
Mastering the basics is the first step to cracking any interview! πŸš€

In my latest video, I dive into Star Pattern Problems, one of the most commonly asked topics in entry-level coding interviews. ✨

πŸ” What's Inside:

- Understanding star patterns

- Step-by-step explanation

- Live coding walkthrough for better clarity

Whether you're starting your coding journey or preparing for interviews, this video is a great way to build confidence with patterns and logic! πŸ’»

πŸ‘€ Watch Now and Level Up Your Skills! πŸ’ͺ

Sahil Bhutani's feedSahil Bhutani
Sahil Bhutani βœ¨β€’
πŸ“Ή New Video Alert! πŸš€
In this video, I dive into a Facebook interview- level question often asked in the DSA(Data Structures and Algorithms) round:

Find an Element in a Sorted Infinite Array". 🌟

πŸ” What's Covered:

- Understanding the problem

- Step - by - step approach

- Efficient solution with code walkthrough Whether you're preparing for an interview or just brushing up on your DSA skills, this video is for you!

πŸ‘€ Watch Now and Level Up Your Skills! πŸ’ͺ

Sahil Bhutani's feedSahil Bhutani
Sahil Bhutani βœ¨β€’
πŸ“Ή New Video Alert! πŸš€
In this video, we tackle two frequently asked questions: finding the floor and the ceiling of a given number in a sorted array using Binary Search. 🌟

πŸ” What's Covered:

- Understanding the problem

- Step - by - step approach

- Efficient solution with code walkthrough By utilizing binary search, we achieve an optimal time complexity of O(log n).Whether you're preparing for an interview or just brushing up on your DSA skills, this video is for you!

πŸ‘€ Watch Now and Level Up Your Skills! πŸ’ͺ

Sahil Bhutani's feedSahil Bhutani
Sahil Bhutani βœ¨β€’
πŸ“Ή New Video Alert! πŸš€
In this video, I explain the concept of Binary Search and why it's preferred over linear search algorithms. 🌟

πŸ” What's Covered:

- Understanding the concept of Binary Search

- Conditions for applying Binary Search(sorted array)

- Detailed explanation of the two - pointer method and while loop

- How to reduce the search range by updating start and end pointers based on the target and middle element comparison

- By using binary search, we achieve an optimal time complexity of O(log n), making it significantly faster than linear search for large datasets.Whether you're preparing for an interview or just brushing up on your DSA skills, this video is for you!

πŸ‘€ Watch Now and Level Up Your Skills! πŸ’ͺ

Sahil Bhutani's feedSahil Bhutani
Sahil Bhutani βœ¨β€’
πŸ“Ή New Video Alert! πŸš€
In this video, I explain the concept of time complexity of Linear Search in DSA using a simple example. 🌟

πŸ” What's Covered:

- Understanding the time complexity of Linear Search

- Example: Time taken to search an element at the very start of the array

- Example: Time taken to search an element that is not present in the array

- Demonstrating the difference in time taken and the comparison checks made during the search

- Whether you're preparing for an interview or just brushing up on your DSA skills, this video is for you!

πŸ‘€ Watch Now and Level Up Your Skills! πŸ’ͺ

Sahil Bhutani's feedSahil Bhutani
Sahil Bhutani βœ¨β€’
πŸ“Ή New Video Alert! πŸš€
In this video, I explain the concept of the Linear Search Algorithm in DSA using a simple example of searching for a user in a database array. 🌟

πŸ” What's Covered:

- Understanding the Linear Search Algorithm

- Example: Searching for a user in a database array

- Implementing a function to find a specific user's details

- Discussing the outcomes based on the search results

- Watch to grasp the basics of linear search and understand the process of searching for a user in an array!

πŸ‘€ Watch Now and Level Up Your Skills! πŸ’ͺ