Update Givena_linked_list_of_0s_1s_and_2s_sort_it.cpp

STREIN-11 · Oct 19, 2023 · 9d571b7 · 9d571b7
1 parent 486da71
commit 9d571b7
Showing 1 changed file with 0 additions and 1 deletion.
diff --git a/Daily/Givena_linked_list_of_0s_1s_and_2s_sort_it.cpp b/Daily/Givena_linked_list_of_0s_1s_and_2s_sort_it.cpp
@@ -2,7 +2,6 @@
 Given a linked list of N nodes where nodes can contain values 0s, 1s, and 2s only. The task is to segregate 0s, 1s, and 2s 
 linked list such that all zeros segregate to head side, 2s at the end of the linked list, and 1s in the mid of 0s and 2s.
 
-
 Input:
 N = 8
 value[] = {1,2,2,1,2,0,2,2}