PDC4S:\IT\DSA and Interview Preperation\[INTERVIEW ONLY MAAL] [EXCLUSIVE]\[RBR] INTERVIEW PREPRATION 2021\3.Linked List

Up one directory...
NameSizeDate Modified
1.Notations that we will be using in our code.mp499,830 KB12/12/2021 3:34 AM
10.Implementation for kth node from end.mp486,398 KB12/12/2021 3:34 AM
11.find_kth_node_from_end.PDF5 KB12/12/2021 3:34 AM
12.Given a Linked list, Check if the linked list has loop.mp440,777 KB12/12/2021 3:34 AM
13.Given a Linked list, Check if the linked list has loop (Approach-1).mp450,794 KB12/12/2021 3:34 AM
14.Given a Linked list, Check if the linked list has loop (Approach - 2).mp470,630 KB12/12/2021 3:34 AM
15.Given a Linked list, Check if the linked list has loop (Approach - 3).mp472,391 KB12/12/2021 3:34 AM
16.Floyd's Cycle-Finding Algorithm.mp4186,567 KB12/12/2021 3:34 AM
17.Implementation for detect a loop in a linked list.mp468,391 KB12/12/2021 3:34 AM
18.Find the starting node of cycle if cycle exists in a given linked list.mp4189,223 KB12/12/2021 3:34 AM
19.Implementation for find the start node of the loop,if there is a cycle in a linked list.mp436,113 KB12/12/2021 3:34 AM
2.Implementation of reverse a linked list.mp4208,930 KB12/12/2021 3:34 AM
20.Given a Linked list, Check if the linked list has loop (Implementation - C).mp4104,046 KB12/12/2021 3:34 AM
21.Applications of linked list.mp4135,755 KB12/12/2021 3:34 AM
21.SLL_DETECT_LOOP.c2 KB12/12/2021 3:34 AM
22.Intersect point of two single linked lists.mp466,439 KB12/12/2021 3:34 AM
23.Intersect point of two single linked lists (Approach - 2).mp480,741 KB12/12/2021 3:34 AM
24.Intersect point of two single linked lists (Approach - 3).mp495,274 KB12/12/2021 3:34 AM
25.Intersect point of two single linked lists (Approach - 4).mp466,695 KB12/12/2021 3:34 AM
26.Intersect point of two single linked lists (Approach - 5).mp451,242 KB12/12/2021 3:34 AM
27.Implementation for find intersection point of two linked list.mp4127,066 KB12/12/2021 3:34 AM
28.find_intersection_node.c2 KB12/12/2021 3:34 AM
29.Alternating split of a given linked list.mp4100,113 KB12/12/2021 3:34 AM
3.Finding a middle node in list.mp4105,405 KB12/12/2021 3:34 AM
30.Implementation of Alternating split of a given linked list.mp467,039 KB12/12/2021 3:34 AM
31.alternative_split.c2 KB12/12/2021 3:34 AM
32.Introduction to Cloning the list.mp437,296 KB12/12/2021 3:34 AM
33.Application for Cloning the list.mp474,393 KB12/12/2021 3:34 AM
34.Cloning the list (Approach - 1).mp489,839 KB12/12/2021 3:34 AM
35.Cloning the list (Approach - 2).mp4139,117 KB12/12/2021 3:34 AM
36.Cloning the list (Approach - 3).mp4154,376 KB12/12/2021 3:34 AM
37.Cloning the list (Approach - 4).mp4183,250 KB12/12/2021 3:34 AM
38.Cloning the list (Implementation -C).mp4262,226 KB12/12/2021 3:34 AM
39.Cloning the list (Implementation II - C).mp4213,963 KB12/12/2021 3:34 AM
4.Implementation for find a middle node in a linked list.mp462,653 KB12/12/2021 3:34 AM
40.Implementation for clone a linked list with next and random pointer.mp4206,363 KB12/12/2021 3:34 AM
41.CLONE_LIST.c2 KB12/12/2021 3:34 AM
42.Check whether given linked list is palindrome or not.mp4141,659 KB12/12/2021 3:34 AM
43.Check whether given linked list is palindrome or not (Approach - 2).mp497,619 KB12/12/2021 3:34 AM
44.Check whether given linked list is palindrome or not (Approach - 3).mp4115,399 KB12/12/2021 3:34 AM
45.Check whether given linked list is palindrome or not (Implementation - C).mp4184,750 KB12/12/2021 3:34 AM
46.Merge two sorted linked lists into one sorted linked list.mp465,654 KB12/12/2021 3:34 AM
47.Merge two sorted linked lists into one sorted linked list (Approach - 2).mp4108,444 KB12/12/2021 3:34 AM
48.Merge two sorted linked list into one sorted linked list (Implementation-C).mp4255,730 KB12/12/2021 3:34 AM
49.Implementation for merge two sorted linked lists.mp4236,819 KB12/12/2021 3:34 AM
5.find_middle_node.PDF5 KB12/12/2021 3:34 AM
50.merge_two_sorted_linked_list.c2 KB12/12/2021 3:34 AM
51.Merge K-sorted linked lists.mp438,488 KB12/12/2021 3:34 AM
52.Merge k-sorted linked lists (Heap Approach).mp4305,664 KB12/12/2021 3:34 AM
53.Merge K-sorted linked lists (Approach-3).mp4106,329 KB12/12/2021 3:34 AM
54.Merge k-sorted linked lists ( Binary Search Tree Approach).mp438,649 KB12/12/2021 3:34 AM
55.Implementation of merge k-sorted linked list.mp497,268 KB12/12/2021 3:34 AM
56.merge_k_sorted_lists.PDF6 KB12/12/2021 3:34 AM
57.Merge sort on linked list.mp460,361 KB12/12/2021 3:34 AM
58.Greatest value node in linked list on its right side.mp4101,713 KB12/12/2021 3:34 AM
59.Implementation for finding Greatest value node in linked list on its right side.mp499,583 KB12/12/2021 3:34 AM
6.SLL_FIND_MIDDLE_NODE_2.c2 KB12/12/2021 3:34 AM
60.find_greatest_value_right_side_of_node.c2 KB12/12/2021 3:34 AM
61.Memory efficient Double Linked List.mp4100,814 KB12/12/2021 3:34 AM
62.Memory efficient Double Linked List insertion.mp432,742 KB12/12/2021 3:34 AM
63.Memory efficient Double Linked List deletion.mp421,828 KB12/12/2021 3:34 AM
64.Implementation of memory efficient double linked list.mp476,924 KB12/12/2021 3:34 AM
65.A Memory Efficient Doubly Linked List.txt2 KB12/12/2021 3:34 AM
66.Sort a linked list of 0's 1's and 2's.mp499,104 KB12/12/2021 3:34 AM
67.Add 1 to number represented in linked list.mp4112,689 KB12/12/2021 3:34 AM
7.Find Kth node from the end of linked list.mp4104,836 KB12/12/2021 3:34 AM
8.Find Kth node from the end of linked list (Implementation in C).mp4124,029 KB12/12/2021 3:34 AM
9.Find kth node from the end of linked list (Hash Approach).mp485,541 KB12/12/2021 3:34 AM