Good video! You may be aware also that it is possible to implement a double-linked link using just one link per node (instead of the usual two, previous and next), which could save a significant amount of memory if the rest of the node is small. The link in each node is the XOR of the addresses of the previous and next entries (if a node has no previous or no next entry, then use zero). You can iterate the list in either direction. But this technique is of limited practical value because you can't unlink a node if given a pointer to only that node -- you must have pointers to the nodes on either side. (Likewise, to insert a node between two nodes, you need pointers to both nodes.) This is probably why this technique is not used much in practice (that I am aware of).
Divide an array into 4 subarrays such that sum = sum1 - sum2 + sum3 - sum4 is maximum. (sum1 denotes sum of elements of subarray) Conditions : sum1 occurs before sum2, which occurs before sum3 subarray and so on. Also, sum1 sum2 etc can be zero (empty subarray).
Could you please make a video on 'Golden Section Search' algorithm, its applications in computer science/programming, comparison with binary search and relevant details?
Your explanation is very nice but please explain how these swapping methods has come on which you did all the calculations because we can't remember everything
Shruti B Divide an array into 4 subarrays such that sum = sum1 - sum2 + sum3 - sum4 is maximum. (sum1 denotes sum of elements of subarray) Conditions : sum1 occurs before sum2, which occurs before sum3 subarray and so on. Also, sum1 sum2 etc can be zero (empty subarray).
Suraj Agarwal Divide an array into 4 subarrays such that sum = sum1 - sum2 + sum3 - sum4 is maximum. (sum1 denotes sum of elements of subarray) Conditions : sum1 occurs before sum2, which occurs before sum3 subarray and so on. Also, sum1 sum2 etc can be zero (empty subarray).
Naren Suri Divide an array into 4 subarrays such that sum = sum1 - sum2 + sum3 - sum4 is maximum. (sum1 denotes sum of elements of subarray) Conditions : sum1 occurs before sum2, which occurs before sum3 subarray and so on. Also, sum1 sum2 etc can be zero (empty subarray).
Good video! You may be aware also that it is possible to implement a double-linked link using just one link per node (instead of the usual two, previous and next), which could save a significant amount of memory if the rest of the node is small. The link in each node is the XOR of the addresses of the previous and next entries (if a node has no previous or no next entry, then use zero). You can iterate the list in either direction.
But this technique is of limited practical value because you can't unlink a node if given a pointer to only that node -- you must have pointers to the nodes on either side. (Likewise, to insert a node between two nodes, you need pointers to both nodes.) This is probably why this technique is not used much in practice (that I am aware of).
Bro, your teaching skill is very good. Good luck for your next videos.
Divide an array into 4 subarrays such that sum = sum1 - sum2 + sum3 - sum4 is maximum. (sum1 denotes sum of elements of subarray)
Conditions : sum1 occurs before sum2, which occurs before sum3 subarray and so on. Also, sum1 sum2 etc can be zero (empty subarray).
Could you please make a video on 'Golden Section Search' algorithm, its applications in computer science/programming, comparison with binary search and relevant details?
Good explanation... Apply fast and work fast...
Your explanation is very nice but please explain how these swapping methods has come on which you did all the calculations because we can't remember everything
hi Vivekanand, if possible could you please post a video related to "Add two numbers without using arithmetic operators"
Can you please also explain few recursion problems with examples like finding the possible string encodings of a number.ex 123 gives ABC , LC , AW
Shruti B Divide an array into 4 subarrays such that sum = sum1 - sum2 + sum3 - sum4 is maximum. (sum1 denotes sum of elements of subarray)
Conditions : sum1 occurs before sum2, which occurs before sum3 subarray and so on. Also, sum1 sum2 etc can be zero (empty subarray).
Hi Vivek, subscribed your channel today only and find it very useful. can you please post video on reverse stack using recursion.
In functions without arguments .explain the same program, please sir
Why have you removed the Tree from the playlist?
Hi...if possible can you please make videos on concept of Hashing in C.
Thanks
Why you disabled discussion tab from main page of the canal
Awesome explanation
Make videos on bit masking
Suraj Agarwal Divide an array into 4 subarrays such that sum = sum1 - sum2 + sum3 - sum4 is maximum. (sum1 denotes sum of elements of subarray)
Conditions : sum1 occurs before sum2, which occurs before sum3 subarray and so on. Also, sum1 sum2 etc can be zero (empty subarray).
Useful video. Thank you
which language you use?
pls do the programs on string
nicely explained
find xor of elements in a given range, please make video on this
Plz upload some more vidios
Thats not xor symbol, as i know
Naren Suri Divide an array into 4 subarrays such that sum = sum1 - sum2 + sum3 - sum4 is maximum. (sum1 denotes sum of elements of subarray)
Conditions : sum1 occurs before sum2, which occurs before sum3 subarray and so on. Also, sum1 sum2 etc can be zero (empty subarray).
That's XOR in C