Remove empty shells

sanjar-notes · Nov 1, 2023 · d3bfef8 · d3bfef8
1 parent a3fe668
commit d3bfef8
Show file tree

Hide file tree

Showing 78 changed files with 0 additions and 321 deletions.
diff --git a/home/4_resource_itineraries/1_CN_Intro_to_Cpp/2._C++,_W2H.md b/home/4_resource_itineraries/1_CN_Intro_to_Cpp/2._C++,_W2H.md
diff --git a/...bles_and_Operators/2._Variables_and_data_types/2.2_Automatic_Type_Deductions.md b/...bles_and_Operators/2._Variables_and_data_types/2.2_Automatic_Type_Deductions.md
diff --git a/...raries/1_CN_Intro_to_Cpp/4._Conditionals_and_while_loops/4._Pratice_problems.md b/...raries/1_CN_Intro_to_Cpp/4._Conditionals_and_while_loops/4._Pratice_problems.md
diff --git a/...tro_to_Cpp/4._Conditionals_and_while_loops/4._Pratice_problems/2._Patterns_2.md b/...tro_to_Cpp/4._Conditionals_and_while_loops/4._Pratice_problems/2._Patterns_2.md
diff --git a/home/4_resource_itineraries/1_CN_Intro_to_Cpp/5._For_loop_and_bitwise_ops.md b/home/4_resource_itineraries/1_CN_Intro_to_Cpp/5._For_loop_and_bitwise_ops.md
diff --git a/..._Data_Structures_and_OOP/1._Memory_and_Pointers/2._Dynamic_Memory_Allocation.md b/..._Data_Structures_and_OOP/1._Memory_and_Pointers/2._Dynamic_Memory_Allocation.md
diff --git a/..._itineraries/2_CN_Data_Structures_and_OOP/2._Time_and_Space_Analysis/1._Time.md b/..._itineraries/2_CN_Data_Structures_and_OOP/2._Time_and_Space_Analysis/1._Time.md
diff --git a/home/4_resource_itineraries/2_CN_Data_Structures_and_OOP/3._Recursion.md b/home/4_resource_itineraries/2_CN_Data_Structures_and_OOP/3._Recursion.md
diff --git a/..._itineraries/2_CN_Data_Structures_and_OOP/3._Recursion/2._Recursion_Practice.md b/..._itineraries/2_CN_Data_Structures_and_OOP/3._Recursion/2._Recursion_Practice.md
diff --git a/..._Structures_and_OOP/4._OOP_Basics/1._Intro_and_syntax/4._Functions(in_class).md b/..._Structures_and_OOP/4._OOP_Basics/1._Intro_and_syntax/4._Functions(in_class).md
diff --git a/...es/2_CN_Data_Structures_and_OOP/4._OOP_Basics/3._Member_constraints/1._const.md b/...es/2_CN_Data_Structures_and_OOP/4._OOP_Basics/3._Member_constraints/1._const.md
diff --git a/home/4_resource_itineraries/2_CN_Data_Structures_and_OOP/5._Data_Structures.md b/home/4_resource_itineraries/2_CN_Data_Structures_and_OOP/5._Data_Structures.md
diff --git a/...es/2_CN_Data_Structures_and_OOP/5._Data_Structures/1._Linear_Data_Structures.md b/...es/2_CN_Data_Structures_and_OOP/5._Data_Structures/1._Linear_Data_Structures.md
diff --git a/...ructures_and_OOP/5._Data_Structures/1._Linear_Data_Structures/2._Linked_List.md b/...ructures_and_OOP/5._Data_Structures/1._Linear_Data_Structures/2._Linked_List.md
diff --git a/...ta_Structures/2._Linked_List/1._Linked_List_Basics/3._Basic_Operations_on_LL.md b/...ta_Structures/2._Linked_List/1._Linked_List_Basics/3._Basic_Operations_on_LL.md
diff --git a/...1._Linear_Data_Structures/2._Linked_List/2._Popular_LL_problems/zAssignments.md b/...1._Linear_Data_Structures/2._Linked_List/2._Popular_LL_problems/zAssignments.md
diff --git a/...Data_Structures_and_OOP/5._Data_Structures/1._Linear_Data_Structures/zTest_2.md b/...Data_Structures_and_OOP/5._Data_Structures/1._Linear_Data_Structures/zTest_2.md
diff --git a/...esource_itineraries/2_CN_Data_Structures_and_OOP/5._Data_Structures/2._Trees.md b/...esource_itineraries/2_CN_Data_Structures_and_OOP/5._Data_Structures/2._Trees.md
diff --git a/...ctures_and_OOP/5._Data_Structures/2._Trees/1._Generic_Trees/2._Coding_a_tree.md b/...ctures_and_OOP/5._Data_Structures/2._Trees/1._Generic_Trees/2._Coding_a_tree.md
diff --git a/...._Data_Structures/2._Trees/1._Generic_Trees/2._Coding_a_tree/3._IO_for_trees.md b/...._Data_Structures/2._Trees/1._Generic_Trees/2._Coding_a_tree/3._IO_for_trees.md
diff --git a/...ructures_and_OOP/5._Data_Structures/2._Trees/1._Generic_Trees/3._Tree_params.md b/...ructures_and_OOP/5._Data_Structures/2._Trees/1._Generic_Trees/3._Tree_params.md
diff --git a/..._and_OOP/5._Data_Structures/2._Trees/2_.Binary_trees/2._Coding_a_Binary_Tree.md b/..._and_OOP/5._Data_Structures/2._Trees/2_.Binary_trees/2._Coding_a_Binary_Tree.md
diff --git a/...res/2._Trees/2_.Binary_trees/2._Coding_a_Binary_Tree/1._BinaryTreeNode_class.md b/...res/2._Trees/2_.Binary_trees/2._Coding_a_Binary_Tree/1._BinaryTreeNode_class.md
diff --git a/...ata_Structures_and_OOP/5._Data_Structures/2._Trees/2_.Binary_trees/3._Params.md b/...ata_Structures_and_OOP/5._Data_Structures/2._Trees/2_.Binary_trees/3._Params.md
diff --git a/...P/5._Data_Structures/2._Trees/2_.Binary_trees/5._Construction_from_traversal.md b/...P/5._Data_Structures/2._Trees/2_.Binary_trees/5._Construction_from_traversal.md
diff --git a/...P/5._Data_Structures/2._Trees/3._Binary_Search_Trees/4._Common_BST_questions.md b/...P/5._Data_Structures/2._Trees/3._Binary_Search_Trees/4._Common_BST_questions.md
diff --git a/...ures/2._Trees/3._Binary_Search_Trees/4._Common_BST_questions/1._Check_if_BST.md b/...ures/2._Trees/3._Binary_Search_Trees/4._Common_BST_questions/1._Check_if_BST.md
diff --git a/.../3._Auxilary_Data_Structures/1._Priority_Queue_and_Heap/9._Practice_Problems.md b/.../3._Auxilary_Data_Structures/1._Priority_Queue_and_Heap/9._Practice_Problems.md
diff --git a/...._Data_Structures/3._Auxilary_Data_Structures/2._Hashmaps/8._STL_map_and_set.md b/...._Data_Structures/3._Auxilary_Data_Structures/2._Hashmaps/8._STL_map_and_set.md
diff --git a/...OOP/5._Data_Structures/3._Auxilary_Data_Structures/3._Tries/2._Coding_a_Trie.md b/...OOP/5._Data_Structures/3._Auxilary_Data_Structures/3._Tries/2._Coding_a_Trie.md
diff --git a/...source_itineraries/2_CN_Data_Structures_and_OOP/5._Data_Structures/4._Graphs.md b/...source_itineraries/2_CN_Data_Structures_and_OOP/5._Data_Structures/4._Graphs.md
diff --git a/...2_CN_Data_Structures_and_OOP/5._Data_Structures/4._Graphs/1._Graphs_-_Basics.md b/...2_CN_Data_Structures_and_OOP/5._Data_Structures/4._Graphs/1._Graphs_-_Basics.md
diff --git a/..._and_OOP/5._Data_Structures/4._Graphs/1._Graphs_-_Basics/5._Basic_Traversals.md b/..._and_OOP/5._Data_Structures/4._Graphs/1._Graphs_-_Basics/5._Basic_Traversals.md
diff --git a/...OOP/5._Data_Structures/4._Graphs/1._Graphs_-_Basics/6._Basic_path_operations.md b/...OOP/5._Data_Structures/4._Graphs/1._Graphs_-_Basics/6._Basic_path_operations.md
diff --git a/...tructures_and_OOP/5._Data_Structures/4._Graphs/2._Graphs_2/2._MST_algorithms.md b/...tructures_and_OOP/5._Data_Structures/4._Graphs/2._Graphs_2/2._MST_algorithms.md
diff --git a/...ineraries/2_CN_Data_Structures_and_OOP/6._Algorithm_Design/1._Why_algorithms.md b/...ineraries/2_CN_Data_Structures_and_OOP/6._Algorithm_Design/1._Why_algorithms.md
diff --git a/...s/2_CN_Data_Structures_and_OOP/6._Algorithm_Design/2._Analysis_of_Algorithms.md b/...s/2_CN_Data_Structures_and_OOP/6._Algorithm_Design/2._Analysis_of_Algorithms.md
diff --git a/...raries/2_CN_Data_Structures_and_OOP/6._Algorithm_Design/3._Design_Techniques.md b/...raries/2_CN_Data_Structures_and_OOP/6._Algorithm_Design/3._Design_Techniques.md
diff --git a/.../4_resource_itineraries/3_CN_Competitive_programming/1._CP_-_intro_and_tools.md b/.../4_resource_itineraries/3_CN_Competitive_programming/1._CP_-_intro_and_tools.md
diff --git a/...tive_programming/1._CP_-_intro_and_tools/1._Intro_to_Competitive_Programming.md b/...tive_programming/1._CP_-_intro_and_tools/1._Intro_to_Competitive_Programming.md
diff --git a/...ve_programming/1._CP_-_intro_and_tools/2._Time_and_Space_Complexity/Problems.md b/...ve_programming/1._CP_-_intro_and_tools/2._Time_and_Space_Complexity/Problems.md
diff --git a/...-_intro_and_tools/4._Language_Tools/1._STL_-_Data_Structures/0._Conveniences.md b/...-_intro_and_tools/4._Language_Tools/1._STL_-_Data_Structures/0._Conveniences.md
diff --git a/...tools/4._Language_Tools/1._STL_-_Data_Structures/1._Physical_Data_Structures.md b/...tools/4._Language_Tools/1._STL_-_Data_Structures/1._Physical_Data_Structures.md
diff --git a/...g/1._CP_-_intro_and_tools/4._Language_Tools/1._STL_-_Data_Structures/2._ADTs.md b/...g/1._CP_-_intro_and_tools/4._Language_Tools/1._STL_-_Data_Structures/2._ADTs.md
diff --git a/...resource_itineraries/3_CN_Competitive_programming/10._TreesX/2._Segment_Tree.md b/...resource_itineraries/3_CN_Competitive_programming/10._TreesX/2._Segment_Tree.md
diff --git a/...ogramming/10._TreesX/2._Segment_Tree/Assignments/1._Minimum_In_SubArray_-_40.md b/...ogramming/10._TreesX/2._Segment_Tree/Assignments/1._Minimum_In_SubArray_-_40.md
diff --git a/..._programming/10._TreesX/2._Segment_Tree/Assignments/2._Maximum_Pair_Sum_-_80.md b/..._programming/10._TreesX/2._Segment_Tree/Assignments/2._Maximum_Pair_Sum_-_80.md
diff --git a/...ming/10._TreesX/2._Segment_Tree/Assignments/3._Maximum_Sum_In_Subarray_-_120.md b/...ming/10._TreesX/2._Segment_Tree/Assignments/3._Maximum_Sum_In_Subarray_-_120.md
diff --git a/...e_programming/10._TreesX/2._Segment_Tree/Assignments/4._Sum_Of_Squares_-_120.md b/...e_programming/10._TreesX/2._Segment_Tree/Assignments/4._Sum_Of_Squares_-_120.md
diff --git a/...programming/10._TreesX/2._Segment_Tree/zAssignments/1._Counting_EvenOdd_-_40.md b/...programming/10._TreesX/2._Segment_Tree/zAssignments/1._Counting_EvenOdd_-_40.md
diff --git a/...e_programming/10._TreesX/2._Segment_Tree/zAssignments/2._Vasya_vs_Rhezo_-_40.md b/...e_programming/10._TreesX/2._Segment_Tree/zAssignments/2._Vasya_vs_Rhezo_-_40.md
diff --git a/...mpetitive_programming/10._TreesX/2._Segment_Tree/zAssignments/3._2_vs_3_-_80.md b/...mpetitive_programming/10._TreesX/2._Segment_Tree/zAssignments/3._2_vs_3_-_80.md
diff --git a/...rogramming/10._TreesX/2._Segment_Tree/zAssignments/4._Horrible_Queries_-_120.md b/...rogramming/10._TreesX/2._Segment_Tree/zAssignments/4._Horrible_Queries_-_120.md
diff --git a/home/4_resource_itineraries/3_CN_Competitive_programming/11._Number_Theory.md b/home/4_resource_itineraries/3_CN_Competitive_programming/11._Number_Theory.md
diff --git a/...es/3_CN_Competitive_programming/11._Number_Theory/2._Prime_generator_and_GCD.md b/...es/3_CN_Competitive_programming/11._Number_Theory/2._Prime_generator_and_GCD.md
diff --git a/...mpetitive_programming/11._Number_Theory/2._Prime_generator_and_GCD/1._Primes.md b/...mpetitive_programming/11._Number_Theory/2._Prime_generator_and_GCD/1._Primes.md
diff --git a/...ve_programming/11._Number_Theory/2._Prime_generator_and_GCD/2._Euclid's_Algo.md b/...ve_programming/11._Number_Theory/2._Prime_generator_and_GCD/2._Euclid's_Algo.md
diff --git a/...mming/11._Number_Theory/2._Prime_generator_and_GCD/4._Applications_Of_NT_-_1.md b/...mming/11._Number_Theory/2._Prime_generator_and_GCD/4._Applications_Of_NT_-_1.md
diff --git a/...ineraries/3_CN_Competitive_programming/11._Number_Theory/3._Totient_Function.md b/...ineraries/3_CN_Competitive_programming/11._Number_Theory/3._Totient_Function.md
diff --git a/...3_CN_Competitive_programming/11._Number_Theory/4._Solving_equations_using_NT.md b/...3_CN_Competitive_programming/11._Number_Theory/4._Solving_equations_using_NT.md
diff --git a/home/4_resource_itineraries/3_CN_Competitive_programming/12._Game_Theory.md b/home/4_resource_itineraries/3_CN_Competitive_programming/12._Game_Theory.md
diff --git a/...e_programming/2._Unconventional_use_of_Searching_And_Sorting/6._Momos_Market.md b/...e_programming/2._Unconventional_use_of_Searching_And_Sorting/6._Momos_Market.md
diff --git a/...ramming/2._Unconventional_use_of_Searching_And_Sorting/7._Distribute_Candies.md b/...ramming/2._Unconventional_use_of_Searching_And_Sorting/7._Distribute_Candies.md
diff --git a/home/4_resource_itineraries/3_CN_Competitive_programming/3._RecursionX.md b/home/4_resource_itineraries/3_CN_Competitive_programming/3._RecursionX.md
diff --git a/...ackTracking_Assignment_-_BackTracking,_Binary_Search_And_Merge_Sort_Problems.md b/...ackTracking_Assignment_-_BackTracking,_Binary_Search_And_Merge_Sort_Problems.md
diff --git a/...titive_programming/6._Dynamic_ProgrammingX/1._Classic_problems/Assignments_1.md b/...titive_programming/6._Dynamic_ProgrammingX/1._Classic_problems/Assignments_1.md
diff --git a/...titive_programming/6._Dynamic_ProgrammingX/1._Classic_problems/Assignments_2.md b/...titive_programming/6._Dynamic_ProgrammingX/1._Classic_problems/Assignments_2.md
diff --git a/...es/3_CN_Competitive_programming/6._Dynamic_ProgrammingX/2._Practice_Problems.md b/...es/3_CN_Competitive_programming/6._Dynamic_ProgrammingX/2._Practice_Problems.md
diff --git a/...titive_programming/6._Dynamic_ProgrammingX/2._Practice_Problems/Assignment_1.md b/...titive_programming/6._Dynamic_ProgrammingX/2._Practice_Problems/Assignment_1.md
diff --git a/...titive_programming/6._Dynamic_ProgrammingX/2._Practice_Problems/Assignment_2.md b/...titive_programming/6._Dynamic_ProgrammingX/2._Practice_Problems/Assignment_2.md
diff --git a/...ive_programming/6._Dynamic_ProgrammingX/3._DP_&_Bitmasking/5._Code_Iterative.md b/...ive_programming/6._Dynamic_ProgrammingX/3._DP_&_Bitmasking/5._Code_Iterative.md
diff --git a/home/4_resource_itineraries/3_CN_Competitive_programming/7._Greedy_Method.md b/home/4_resource_itineraries/3_CN_Competitive_programming/7._Greedy_Method.md
diff --git a/...ource_itineraries/3_CN_Competitive_programming/7._Greedy_Method/Assignment_1.md b/...ource_itineraries/3_CN_Competitive_programming/7._Greedy_Method/Assignment_1.md
diff --git a/...ource_itineraries/3_CN_Competitive_programming/7._Greedy_Method/Assignment_2.md b/...ource_itineraries/3_CN_Competitive_programming/7._Greedy_Method/Assignment_2.md
diff --git a/home/4_resource_itineraries/3_CN_Competitive_programming/8._GraphsX.md b/home/4_resource_itineraries/3_CN_Competitive_programming/8._GraphsX.md
diff --git a/home/4_resource_itineraries/3_CN_Competitive_programming/9._String_Algorithms.md b/home/4_resource_itineraries/3_CN_Competitive_programming/9._String_Algorithms.md
diff --git a/home/4_resource_itineraries/3_CN_Competitive_programming/Home/1._Motivation.md b/home/4_resource_itineraries/3_CN_Competitive_programming/Home/1._Motivation.md
diff --git a/home/4_resource_itineraries/3_CN_Competitive_programming/Home/2._Roadmap.md b/home/4_resource_itineraries/3_CN_Competitive_programming/Home/2._Roadmap.md