Substring XOR Queries | Leetcode Weekly Contest 322

preview_player
Показать описание
Problem :- Substring XOR Queries
Contest :- Leetcode Weekly contest 322
It was a nice problem , you need to observe that it is irrelevant to find Decimal value of substring of length greater than 31 . And we can find the decima value to be searched by doing basic xor operation .

Do let me know any suggestion of yours related any improvement you want me to have :) .
#algorithm #leetcode #coding #substringxorqueries #weeklycontest
Рекомендации по теме
Комментарии
Автор

-> 30 second part was cut I don't know how, we will start finding value for smaller length them move to larger length from (1 to 31) . This will make sure we get smallest substring occuring first added in our hasmap/map for particular value 'x' . 11 --> 3 and 011-> 3 but if we go smaller to large we will not consider 011 for 3 .

pawangiri
Автор

I'm following you on LinkedIn since 1year
And inspired by you to do cp

If possible can you please create the playlist of patterns to questions or a video for resources that you followed

Thank you 😊

yashbankar
join shbcf.ru