Тёмный

3133 Minimum Array End || How to 🤔 in Interview || Bit Manipulation + Simulation 

Ayush Rao
Подписаться 1,6 тыс.
Просмотров 1,3 тыс.
50% 1

Question Link: leetcode.com/p...
Solution Link: leetcode.com/p...
Leetcode Profile : leetcode.com/a...
Code_With_Confidence community link: chat.whatsapp....
Connect with me on Linkedin: / ayush-nemmaniwar
Video Link: • How I solved 550 LeetC...
Greetings RU-vid Community,
I have created a Code_With_Confidence WhatsApp community. If you are interested, you can join. In this community, we will track consistency (Eg: Leetcode daily challenge, Upsolving Contest problems ) and discuss trending technologies.
Code_With_Confidence community link: chat.whatsapp....
Video Link: • How I solved 550 LeetC...
In have made a Video on my past learnings and experience, I will be covering the following topics:
1.Consistency: How I solved 550 LeetCode problems in 2023 by dedicating an average of 30 minutes on weekdays and 2 hours on weekends.
2.How many days should you dedicate to studying Data Structures and Algorithms?
3.The importance of system design in interviews.
4.How service-based companies contribute to your early career.
5.How to break down your goals and achieve them step by step (Progressing from Service-Based roles to FAANG companies)
6.FOMO (Fear Of Missing Out).
Video Link: • How I solved 550 LeetC...

Опубликовано:

 

28 сен 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 20   
@anshulsharma3137
@anshulsharma3137 5 месяцев назад
Amazing explanation bro !! Came from leetcode comments
@Code_With_Confidence
@Code_With_Confidence 5 месяцев назад
Thank you :)
@Manishkumar-kj6fr
@Manishkumar-kj6fr 5 месяцев назад
Simple and easy to understand. Thanks brother.
@Code_With_Confidence
@Code_With_Confidence 5 месяцев назад
Thank you 😀
@Ethical-Boy-No-1
@Ethical-Boy-No-1 5 месяцев назад
Sir ji your explanation is superb..
@Code_With_Confidence
@Code_With_Confidence 5 месяцев назад
Thank you 😊
@kafuu1
@kafuu1 5 месяцев назад
Thank you so much!
@Code_With_Confidence
@Code_With_Confidence 5 месяцев назад
Glad it helped!
@gunduboinadileep9523
@gunduboinadileep9523 4 месяца назад
God level explanation
@Code_With_Confidence
@Code_With_Confidence 4 месяца назад
Thank you dileep ☺️
@Ethical-Boy-No-1
@Ethical-Boy-No-1 5 месяцев назад
And also I'm u er new subscriber..
@Code_With_Confidence
@Code_With_Confidence 5 месяцев назад
Thanks for subscribing ❤️
@lavendarswiftie
@lavendarswiftie 5 месяцев назад
How is [4, 3, 1] coming out to be 101 ? Can you please explain it?
@astitwapanwar9621
@astitwapanwar9621 4 месяца назад
bro literally your explanation is the best keep consistent may you grow exponentially
@Code_With_Confidence
@Code_With_Confidence 4 месяца назад
Thank you 😊
@astitwapanwar9621
@astitwapanwar9621 4 месяца назад
for(int i=31;i
@Code_With_Confidence
@Code_With_Confidence 4 месяца назад
We are storing the bits indexes from 31 to 63
@ramanpreetsingh5677
@ramanpreetsingh5677 4 месяца назад
please explain why did you use 30 in first for loop and 31 to 63 in second for loop. I'm having issues understanding both the terms. Please refer me some video or you yourself make a video explaining those terms.
@Code_With_Confidence
@Code_With_Confidence 4 месяца назад
It is based on constraints, In question they have mentioned that we can have values upto 10 power 8. So 2 power 30 can accommodate that value so we are using till 30. Remaining bits are to generate our required output. I hope you understood
@ramanpreetsingh5677
@ramanpreetsingh5677 4 месяца назад
@@Code_With_Confidence No, I still didn't get the 2^30. 10 ^ 8 = 5 x 2 ^ 9 ? How it does equal to 2 ^ 30 and why 2^31 to 2 ^63
Далее
L6. Single Number II | Bit Manipulation
31:19
Просмотров 47 тыс.
I Solved 100 LeetCode Problems
13:11
Просмотров 19 тыс.
How I landed my Dream Job as a Software Engineer
24:40
Просмотров 1,8 тыс.
OpenAI’s New ChatGPT: 7 Incredible Capabilities!
6:27
The LeetCode Fallacy
6:08
Просмотров 522 тыс.
How to Solve ANY LeetCode Problem (Step-by-Step)
12:37
Просмотров 232 тыс.