Відео

Sure, My desktop gave up, once fixed I will be uploading the Heap and Tries. Thanks.

1) when you loop keep saving the nodes in a set or map, as u loop forward keep checking whether the current node is present or not in the set. if you find it then there is a cycle. the logic is same as finding duplicate in an array. 2) Merge sorted array and List are of same algo. it is from Merge Sort . create new list OR array. the run loop on both the sorted array till both exists. compare the top values, Pop the minimum and keep pushing the min to the new Array. at the end one array will remain with some value, push that to the result. 3) to find mid, create 2 pointer , move one pointer by node.next, and other by node.next.next. when the second pointer reaches the Null, fist pointer gives the answer. I will try to put video on these soon 4) rotate, if u use pop and unshift it will be o(n) space, but can use reference, for every rotation, use the last value (length -1) index as swap variable and keep swapping the values with every index. 5) Counting sort : I need to check it. hope this helps, will try to make videos. Thanks.

@@ultimatejavascript thanks. Waiting for your videos on these and more problems.