Description
Problem Link: https://bit.ly/3jLfElm
Notes/C++/Java/Python codes: https://takeuforward.org/data-structure/count-the-number-of-subarrays-with-given-xor-k/
We have solved the problem, and we have gone from brute force and ended with the most optimal solution. Every approach's code has been written in the video itself. Also, we have covered the algorithm with intuition.
Full Course: https://bit.ly/tufA2ZYt
You can follow me across social media, all my handles are below:
Linkedin/Instagram/Telegram: https://linktr.ee/takeUforward
0:00 Introduction of Course
01:08 Problem Statement
03:05 Brute force approach
03:46 Pseudocode
05:43 Complexity
06:11 Better approach
07:23 Pseudocode
07:38 Complexity
08:04 Optimal approach
08:11 Intuition
15:18 Pseudocode / Dry-run
21:28 Code
23:21 Complexity
