Skip to content

Cipher-Schools/DSA_Vivek-2026_PEP

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

28 Commits
00_OOPS_fundamentals.cpp
00_OOPS_fundamentals.cpp
 
 
01_OOPS_classes.cpp
01_OOPS_classes.cpp
 
 
02_OOPS_array_revision_question.cpp
02_OOPS_array_revision_question.cpp
 
 
03_OOPS_constructors_destructors.cpp
03_OOPS_constructors_destructors.cpp
 
 
03_Search_in_Rotated_Sorted_Array.cpp
03_Search_in_Rotated_Sorted_Array.cpp
 
 
04_Find_Peak_Elements.cpp
04_Find_Peak_Elements.cpp
 
 
04_OOPS_function_overloading.cpp
04_OOPS_function_overloading.cpp
 
 
05_Koko_Eating_Bananas.cpp
05_Koko_Eating_Bananas.cpp
 
 
05_OOPS_area_overloading.cpp
05_OOPS_area_overloading.cpp
 
 
06_Allocate_Min_Pages.cpp
06_Allocate_Min_Pages.cpp
 
 
06_OOPS_function_overriding.cpp
06_OOPS_function_overriding.cpp
 
 
09_02_User_defined_stack.exe
09_02_User_defined_stack.exe
 
 
31_Bubble_Sort.cpp
31_Bubble_Sort.cpp
 
 
32_Insertion_Sort.cpp
32_Insertion_Sort.cpp
 
 
33_Selection_Sort.cpp
33_Selection_Sort.cpp
 
 
34_Merge_Sort.cpp
34_Merge_Sort.cpp
 
 
3_5_Quick_Sort.cpp
3_5_Quick_Sort.cpp
 
 
4_1_Move_Zeroes.cpp
4_1_Move_Zeroes.cpp
 
 
4_2_Best_Time_To_Buy_And_Sell_Stocks.cpp
4_2_Best_Time_To_Buy_And_Sell_Stocks.cpp
 
 
4_3_Remove_Duplicates_From_Sorted_Array.cpp
4_3_Remove_Duplicates_From_Sorted_Array.cpp
 
 
4_4_Merge_Sorted_Array.cpp
4_4_Merge_Sorted_Array.cpp
 
 
6_1_Reverse_Array_In_Groups.cpp
6_1_Reverse_Array_In_Groups.cpp
 
 
6_2_Max_Sum_Subarray_Of_Size_Of_K.cpp
6_2_Max_Sum_Subarray_Of_Size_Of_K.cpp
 
 
6_3_Min_Swaps_To_Groups_All_1's_Together.cpp
6_3_Min_Swaps_To_Groups_All_1's_Together.cpp
 
 
7_1_basic_traverlsal.cpp
7_1_basic_traverlsal.cpp
 
 
7_2_matrrix_mul.cpp
7_2_matrrix_mul.cpp
 
 
7_3_Matrix_Boundary_Traversal.cpp
7_3_Matrix_Boundary_Traversal.cpp
 
 
7_4_Print_Matrix_In_Snake_Pattern.cpp
7_4_Print_Matrix_In_Snake_Pattern.cpp
 
 
7_5_Search_2D_Matrix_II.cpp
7_5_Search_2D_Matrix_II.cpp
 
 
7_6_Spiral_Matrix.cpp
7_6_Spiral_Matrix.cpp
 
 
8_10_Insert_In_a_sorted_list.cpp
8_10_Insert_In_a_sorted_list.cpp
 
 
8_11_Merge_Two_Sorted_Lists.cpp
8_11_Merge_Two_Sorted_Lists.cpp
 
 
8_12_Intersection_of_two_linkedlist.cpp
8_12_Intersection_of_two_linkedlist.cpp
 
 
8_13_linked_list_cycle.cpp
8_13_linked_list_cycle.cpp
 
 
8_14_linked_list_cycle_II.cpp
8_14_linked_list_cycle_II.cpp
 
 
8_15_Swap_Nodes_In_Pairs.cpp
8_15_Swap_Nodes_In_Pairs.cpp
 
 
8_16_Reverse_In_K_Group.cpp
8_16_Reverse_In_K_Group.cpp
 
 
8_17_doubly_linklist.cpp
8_17_doubly_linklist.cpp
 
 
8_18_Delete_In_Doubly_Linklist.cpp
8_18_Delete_In_Doubly_Linklist.cpp
 
 
8_1_Create_List_using_Struct.cpp
8_1_Create_List_using_Struct.cpp
 
 
8_2_Create_List_Using_Class.cpp
8_2_Create_List_Using_Class.cpp
 
 
8_3_Insertion_In_Linklist.cpp
8_3_Insertion_In_Linklist.cpp
 
 
8_4_Reversal_Of_Linklist.cpp
8_4_Reversal_Of_Linklist.cpp
 
 
8_5_Linklist_insertion.cpp
8_5_Linklist_insertion.cpp
 
 
8_6_Reverse_Linklist.cpp
8_6_Reverse_Linklist.cpp
 
 
8_7_Middle_of_the_Linkedlist.cpp
8_7_Middle_of_the_Linkedlist.cpp
 
 
8_8_palindrome_linklist.cpp
8_8_palindrome_linklist.cpp
 
 
8_9_Remove_Duplicates_from_sorted_list.cpp
8_9_Remove_Duplicates_from_sorted_list.cpp
 
 
9_01_User_defined_stack.cpp
9_01_User_defined_stack.cpp
 
 
9_02_builtin.cpp
9_02_builtin.cpp
 
 
9_03_Reverse_A_Stack.cpp
9_03_Reverse_A_Stack.cpp
 
 
9_04_Delete_Mid_Of_Stack.cpp
9_04_Delete_Mid_Of_Stack.cpp
 
 
9_05_Valid_Parenthese.cpp
9_05_Valid_Parenthese.cpp
 
 
9_06_Stack_using_queue.cpp
9_06_Stack_using_queue.cpp
 
 
9_07_Next_Greater_Element_I.cpp
9_07_Next_Greater_Element_I.cpp
 
 
9_08_Next_Greater_Element_II.cpp
9_08_Next_Greater_Element_II.cpp
 
 
9_09_Remove_Duplicate_letters.cpp
9_09_Remove_Duplicate_letters.cpp
 
 
9_10_Largest_Rect_In_Histogram.cpp
9_10_Largest_Rect_In_Histogram.cpp
 
 
9_11_Infix_To_Postfix.cpp
9_11_Infix_To_Postfix.cpp
 
 
Readme.md
Readme.md
 
 
a_01_inbuilt_queue_library.cpp
a_01_inbuilt_queue_library.cpp
 
 
a_02_queue_reversal.cpp
a_02_queue_reversal.cpp
 
 
a_03_design_circular_queue.cpp
a_03_design_circular_queue.cpp
 
 
b_01_inorder_traversal.cpp
b_01_inorder_traversal.cpp
 
 
b_02_preorder_traversal.cpp
b_02_preorder_traversal.cpp
 
 
b_03_postorder_traversal.cpp
b_03_postorder_traversal.cpp
 
 
b_04_count_complete_tree_nodes.cpp
b_04_count_complete_tree_nodes.cpp
 
 
b_05_height_of_binary_tree.cpp
b_05_height_of_binary_tree.cpp
 
 
b_06_same_tree.cpp
b_06_same_tree.cpp
 
 
b_07_Invert_binary_tree.cpp
b_07_Invert_binary_tree.cpp
 
 
b_08_binary_tree_level_order_traversal.cpp
b_08_binary_tree_level_order_traversal.cpp
 
 
c_01_search_in_balanced_binary_search_tree.cpp
c_01_search_in_balanced_binary_search_tree.cpp
 
 
c_02_Range_sum_balanced_BST.cpp
c_02_Range_sum_balanced_BST.cpp
 
 
c_03_sorted_array_to_BST.cpp
c_03_sorted_array_to_BST.cpp
 
 
c_04_two_sum.cpp
c_04_two_sum.cpp
 
 
c_05_insertion_in_balanced_binary_search_tree.cpp
c_05_insertion_in_balanced_binary_search_tree.cpp
 
 
c_06_kth_smallest_in_bst.cpp
c_06_kth_smallest_in_bst.cpp
 
 
c_07_validate_BST.cpp
c_07_validate_BST.cpp
 
 
devops and cloud session 1.pdf
devops and cloud session 1.pdf
 
 
devops and cloud session 3 and 4.pdf
devops and cloud session 3 and 4.pdf
 
 
devops and cloud sessions 2.pdf
devops and cloud sessions 2.pdf
 
 

Repository files navigation

All the files for topics and problems discussed in class are all deployed in this gthub repository

About

No description, website, or topics provided.

Resources

Readme
Activity
Custom properties

Stars

4 stars

Watchers

0 watching

Forks

2 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages