add khushal87 linked-list-code

khushal87 · Feb 22, 2021 · e06cfe0 · e06cfe0
1 parent 2cf2165
commit e06cfe0
Show file tree

Hide file tree

Showing 45 changed files with 545 additions and 96 deletions.
diff --git a/.vscode/c_cpp_properties.json b/.vscode/c_cpp_properties.json
diff --git a/.vscode/launch.json b/.vscode/launch.json
diff --git a/.vscode/settings.json b/.vscode/settings.json
diff --git a/.vscode/tasks.json b/.vscode/tasks.json
diff --git a/Bit Manipulation/check_if_number_is_power_of_2 b/Bit Manipulation/check_if_number_is_power_of_2
diff --git a/Bit Manipulation/copy_set_bits_in_range b/Bit Manipulation/copy_set_bits_in_range
diff --git a/Bit Manipulation/number_of_set_bits b/Bit Manipulation/number_of_set_bits
diff --git a/Bit Manipulation/number_with_kth_bit_set b/Bit Manipulation/number_with_kth_bit_set
diff --git a/Bit Manipulation/power_set_string b/Bit Manipulation/power_set_string
diff --git a/Bit Manipulation/set_bit_position b/Bit Manipulation/set_bit_position
diff --git a/Disjoint Set/teacher_dilemma b/Disjoint Set/teacher_dilemma
diff --git a/Disjoint Set/union_compression b/Disjoint Set/union_compression
diff --git a/Graph/Grid/dfs b/Graph/Grid/dfs
diff --git a/Graph/Grid/number_of_connected_components b/Graph/Grid/number_of_connected_components
diff --git a/Graph/High Level/bellmanford b/Graph/High Level/bellmanford
diff --git a/Graph/High Level/djisktra b/Graph/High Level/djisktra
diff --git a/Graph/bipartite_or_not b/Graph/bipartite_or_not
diff --git a/Graph/breadth_first_search b/Graph/breadth_first_search
diff --git a/Graph/diameter_of_a_tree b/Graph/diameter_of_a_tree
diff --git a/Graph/given_graph_is_tree_or_not b/Graph/given_graph_is_tree_or_not
diff --git a/Graph/graph_has_cycle_or_not b/Graph/graph_has_cycle_or_not
diff --git a/Graph/in_out_time_of_binary_tree b/Graph/in_out_time_of_binary_tree
diff --git a/Graph/mininum_distance_between_two_nodes b/Graph/mininum_distance_between_two_nodes
diff --git a/Graph/number_of_connected_components b/Graph/number_of_connected_components
diff --git a/Graph/subtree_size_of_tree b/Graph/subtree_size_of_tree
diff --git a/Graph/topological_sort b/Graph/topological_sort
diff --git a/LinkedList/add_two_numbers.cpp b/LinkedList/add_two_numbers.cpp
@@ -0,0 +1,49 @@
+#include <iostream>
+using namespace std;
+
+struct Node
+{
+ /* data */
+ int data;
+ Node *next;
+};
+
+Node *newNode(int data)
+{
+ Node *newnode = new Node;
+ newnode->data = data;
+ newnode->next = nullptr;
+ return newnode;
+}
+
+Node *addTwoList(Node *head1, Node *head2)
+{
+ Node *res = NULL;
+ Node *temp, *prev = NULL;
+ int carry = 0, sum;
+ while (head1 != NULL || head2 != NULL)
+ {
+ sum = carry + (head1 ? head1->data : 0) + (head2 ? head2->data : 0);
+ carry = (sum >= 10) ? 1 : 0;
+ sum %= 10;
+ temp = newNode(sum);
+ if (res == nullptr)
+ {
+ res = temp;
+ }
+ else
+ {
+ prev->next = temp;
+ }
+ prev = temp;
+ if (head1)
+ head1 = head1->next;
+ if (head2)
+ head2 = head2->next;
+ }
+ if (carry > 0)
+ {
+ temp->next = newNode(carry);
+ }
+ return res;
+}
diff --git a/LinkedList/clockwise_rotate_linked_list.cpp b/LinkedList/clockwise_rotate_linked_list.cpp
@@ -0,0 +1,57 @@
+#include <iostream>
+using namespace std;
+
+struct ListNode
+{
+ /* data */
+ int val;
+ ListNode *next;
+};
+
+int getCount(ListNode *head)
+{
+ int ctr = 0;
+ ListNode *curr = head;
+ while (curr != NULL)
+ {
+ ctr++;
+ curr = curr->next;
+ }
+ return ctr;
+}
+
+ListNode *rotateRight(ListNode *head, int k)
+{
+ if (k == 0 || head == nullptr)
+ {
+ return head;
+ }
+ else
+ {
+ int n = getCount(head);
+ cout << n;
+ if (k > n)
+ {
+ k %= n;
+ }
+ k = n - k;
+ if (k == 0)
+ {
+ return head;
+ }
+ ListNode *curr = head;
+ while (curr->next != nullptr)
+ {
+ curr = curr->next;
+ }
+ curr->next = head;
+ curr = head;
+ for (int i = 0; i < k - 1; i++)
+ {
+ curr = curr->next;
+ }
+ head = curr->next;
+ curr->next = nullptr;
+ return head;
+ }
+}
diff --git a/LinkedList/delete_node_in_linked_list.cpp b/LinkedList/delete_node_in_linked_list.cpp
@@ -0,0 +1,17 @@
+#include <iostream>
+using namespace std;
+
+struct Node
+{
+ /* data */
+ int data;
+ Node *next;
+};
+
+void deleteNode(Node *node)
+{
+ Node *temp = node->next;
+ node->data = temp->data;
+ node->next = temp->next;
+ delete temp;
+}
diff --git a/LinkedList/delete_nth_node_from_the_end.cpp b/LinkedList/delete_nth_node_from_the_end.cpp
@@ -0,0 +1,34 @@
+#include <iostream>
+using namespace std;
+
+struct Node
+{
+ /* data */
+ int data;
+ Node *next;
+};
+
+Node *deleteFunction(Node *head, int key)
+{
+ Node *first = head;
+ Node *second = head;
+ for (int i = 0; i < key; i++)
+ {
+ if (second->next == NULL)
+ {
+ if (i == key - 1)
+ {
+ head = head->next;
+ }
+ return head;
+ }
+ second = second->next;
+ }
+ while (second->next != NULL)
+ {
+ first = first->next;
+ second = second->next;
+ }
+ first->next = first->next->next;
+ return head;
+}
diff --git a/LinkedList/detect_loop.cpp b/LinkedList/detect_loop.cpp
@@ -1,4 +1,5 @@
-#include <bits/stdc++.h>
+#include <iostream>
+#include <unordered_set>
 using namespace std;
 
 struct Node
@@ -40,7 +41,3 @@ bool detectLoop1(Node *head)
  }
  return false;
 }
-
-int main()
-{
-}
diff --git a/LinkedList/find_intersection_in_two_linked_list.cpp b/LinkedList/find_intersection_in_two_linked_list.cpp
@@ -0,0 +1,64 @@
+#include <iostream>
+using namespace std;
+
+struct ListNode
+{
+ /* data */
+ int val;
+ ListNode *next;
+};
+
+int getCount(ListNode *root)
+{
+ ListNode *curr = root;
+ int ctr = 0;
+ while (curr != nullptr)
+ {
+ ctr++;
+ curr = curr->next;
+ }
+ return ctr;
+}
+
+ListNode *_getIntersectionNode(int d, ListNode *list1, ListNode *list2)
+{
+ ListNode *curr1 = list1;
+ ListNode *curr2 = list2;
+ for (int i = 0; i < d; i++)
+ {
+ if (curr1 == NULL)
+ {
+ return nullptr;
+ }
+ curr1 = curr1->next;
+ }
+ while (curr1 != nullptr && curr2 != nullptr)
+ {
+ if (curr1 == curr2)
+ return curr1;
+ curr1 = curr1->next;
+ curr2 = curr2->next;
+ }
+ return nullptr;
+}
+
+ListNode *getIntersectionNode(ListNode *list1, ListNode *list2)
+{
+ if (list1 == nullptr)
+ return nullptr;
+ if (list2 == nullptr)
+ return nullptr;
+ int ctr1 = getCount(list1);
+ int ctr2 = getCount(list2);
+ int d;
+ if (ctr1 > ctr2)
+ {
+ d = ctr1 - ctr2;
+ return _getIntersectionNode(d, list1, list2);
+ }
+ else
+ {
+ d = ctr2 - ctr1;
+ return _getIntersectionNode(d, list2, list1);
+ }
+}
diff --git a/LinkedList/find_middle_in_linked_list.cpp b/LinkedList/find_middle_in_linked_list.cpp
@@ -0,0 +1,22 @@
+#include <iostream>
+using namespace std;
+
+struct Node
+{
+ /* data */
+ int data;
+ Node *next;
+};
+
+//fastest approach
+Node *middleElement(Node *head)
+{
+ Node *slow = head;
+ Node *fast = head;
+ while (fast && slow && fast->next)
+ {
+ slow = slow->next;
+ fast = fast->next->next;
+ }
+ return slow;
+}