From 36b387c93903c94ebc168e6809e6a4debaff61bc Mon Sep 17 00:00:00 2001 From: Danilo rv Date: Sat, 25 Dec 2021 07:16:48 -0300 Subject: [PATCH] Fix 404 links and file names (#7578) --- C-Plus-Plus/README.md | 71 +++++++++---------- C-Plus-Plus/{ => cp}/Generic_Swaps.cpp | 0 ...ne_Alogorithm.cpp => Kadane_Algorithm.cpp} | 0 ...ically_largest_palindrome_subsequence.cpp} | 0 C-Plus-Plus/{ => cp}/adjacent.cpp | 0 ...t.cpp => find_single_occuring_element.cpp} | 0 ...ix's_principal_secondary_diagonal_sum.cpp} | 0 C-Plus-Plus/{ => cp}/power.cpp | 0 ...=> Max_subarray_sum_constant_space_DP.cpp} | 0 ...ist.cpp => Detect_Cycle_In_LinkedList.cpp} | 0 ...Remove_all_Duplicates_from_Linkedlist.cpp} | 0 ...pp => SLL_Operations_using_Unique_Key.cpp} | 0 ...apping_Nodes_of_Linked_list-Using_CPP.cpp} | 0 ...st.cpp => detectionOfCycle_linkedList.cpp} | 0 ...p => Connecting_Dots-Graphs_using_cpp.cpp} | 0 ...s_Algoirthm.cpp => Tarjan's_Algorithm.cpp} | 0 ...ir_Of_nodes_in_the_BST_which_Sum_to_S.cpp} | 0 ...one_a_stack_without_using_extra_space.cpp} | 0 18 files changed, 35 insertions(+), 36 deletions(-) rename C-Plus-Plus/{ => cp}/Generic_Swaps.cpp (100%) rename C-Plus-Plus/cp/{Kadane_Alogorithm.cpp => Kadane_Algorithm.cpp} (100%) rename C-Plus-Plus/cp/{Lexicographyically_largest_palindrome_subsequence.cpp => Lexicographically_largest_palindrome_subsequence.cpp} (100%) rename C-Plus-Plus/{ => cp}/adjacent.cpp (100%) rename C-Plus-Plus/cp/{find_single _occuring_element.cpp => find_single_occuring_element.cpp} (100%) rename C-Plus-Plus/cp/{matrix's_principal_seconday_diagonal_sum.cpp => matrix's_principal_secondary_diagonal_sum.cpp} (100%) rename C-Plus-Plus/{ => cp}/power.cpp (100%) rename C-Plus-Plus/dp/{Max_subarray_sum_constant_space(DP).cpp => Max_subarray_sum_constant_space_DP.cpp} (100%) rename C-Plus-Plus/ds/{Detet_Cycle_In_LinkedList.cpp => Detect_Cycle_In_LinkedList.cpp} (100%) rename C-Plus-Plus/ds/{Remove_all_Duplicates_from_Linnkedlist.cpp => Remove_all_Duplicates_from_Linkedlist.cpp} (100%) rename C-Plus-Plus/ds/{SLL_Operations_Usnig_Unique_Key.cpp => SLL_Operations_using_Unique_Key.cpp} (100%) rename C-Plus-Plus/ds/{Sawpping_Nodes_of_Linked_list-Using_CPP.cpp => Swapping_Nodes_of_Linked_list-Using_CPP.cpp} (100%) rename C-Plus-Plus/ds/{detectionOfCycle_likedList.cpp => detectionOfCycle_linkedList.cpp} (100%) rename C-Plus-Plus/graphs/{Connecting _Dots-Graphs_using_cpp.cpp => Connecting_Dots-Graphs_using_cpp.cpp} (100%) rename C-Plus-Plus/graphs/{Tarjan's_Algoirthm.cpp => Tarjan's_Algorithm.cpp} (100%) rename C-Plus-Plus/search/{Pair Of Nodes In The BST Which Sum To S.cpp => Pair_Of_nodes_in_the_BST_which_Sum_to_S.cpp} (100%) rename C-Plus-Plus/stack/{clone_a_stack_without_usinig_extra_space.cpp => clone_a_stack_without_using_extra_space.cpp} (100%) diff --git a/C-Plus-Plus/README.md b/C-Plus-Plus/README.md index 0e8fbd6cc8..62f2ed0a06 100644 --- a/C-Plus-Plus/README.md +++ b/C-Plus-Plus/README.md @@ -28,7 +28,7 @@ - [Length of last word](cp/length_of_last_word.cpp) - [Container with most water](cp/Container_with_most_water.cpp) - [Contiguous Sub Array with Given Sum](cp/SubArrayWithGivenSum.cpp) - [Continuous_Seq](cp/Continuous_Seq.cpp) +- [Continuous_Seq](cp/Continuous_Seq.cpp) - [Generic Function for Swapping](cp/Generic_Swaps.cpp) - [Adjacent Difference Algorithm](cp/adjacent.cpp) - [Recursive Modular Exponentiation](cp/power.cpp) @@ -43,9 +43,9 @@ - [Find Single Occurring element from an array](cp/find_single_occuring_element.cpp) - [Infix to Postfix](cp/infix_to_postfix.cpp) - [Intersection of Y-shaped linked list](cp/Intersection_Point_of_Y_shaped_LinkedList.cpp) -- [Interval List Intersection](cp/Interval_List_Intersection.cpp) +- [Interval List Intersection](cp/Interval_list_Intersection.cpp) - [Josephus Problem](cp/Josephus.cpp) -- [Kadane's Algorithm for max sum subArray](cp/Kadane_Alogorithm.cpp) +- [Kadane's Algorithm for max sum subArray](cp/Kadane_Algorithm.cpp) - [Knuth–Morris–Pratt algorithm](cp/Knuth_Morris_Pratt.cpp) - [Long Factorials using Vectors](cp/long_factorials.cpp) - [Longest Common Prefix](cp/longestCommonPrefix.cpp) @@ -90,7 +90,7 @@ - [Sort Color](cp/Sort_Color.cpp) - [Ticket Auction](cp/tkt_auction.cpp) - [Replace Pi using recursion](cp/replace_pi.cpp) -- [Lexicographically largest palindrome subsequence](cp/Lexicographyically_largest_palindrome_subsequence.cpp) +- [Lexicographically largest palindrome subsequence](cp/Lexicographically_largest_palindrome_subsequence.cpp) - [Binary tree to doubly linked list](cp/Binary_Tree_to_Doubly_Linked_List.cpp) - [Check if given Binary Tree is symmetric or not](cp/Binary_Tree_Symmetric_or_not.cpp) - [Generate all combinations of well-formed parentheses](cp/Generate_all_valid_parentheses_combinations.cpp) @@ -179,7 +179,7 @@ - [Strange Hotel](cp/strange_hotel.cpp) - [Find subtrees with total nodes sum equal to x](cp/total_subtrees.cpp) - [Remove cycle in a tree to form a linked list](cp/remove_cycle.cpp) -- [Meeting Rooms](cp/Meeting_Rooms) +- [Meeting Rooms](cp/Meeting_Rooms.cpp) - [Largest BST in binary tree](cp/largest_bst_in_btree.cpp) - [Total Pairs Chosen](cp/total_pairs_chosen.cpp) - [Minimum cost to construct temple](cp/min_cost_to_construct_temple.cpp) @@ -198,8 +198,9 @@ - [Boundary traversal of a Binary Search Tree](ds/boundary_traversal_bst.cpp) - [Construct binary tree using inorder and preorder](ds/Construct_binary_tree_using_inorder_and_preorder.cpp) - [Detection of Cycle in Linked List](ds/detectionOfCycle_linkedList.cpp) +- [Detect Cycle in Linked List ](ds/Detect_Cycle_In_LinkedList.cpp) - [Reverse Queue content using Stack](ds/Reverse_Queue_content_using_Stack.cpp) -- [Singly Linked List Operations Using Unique Key](ds/SLL_Operations_Usnig_Unique_Key.cpp) +- [Singly Linked List Operations Using Unique Key](ds/SLL_Operations_using_Unique_Key.cpp) - [Add Post-Order Tree Traversal](ds/postorder.cpp) - [Number of Good Pairs](ds/Number_of_good_pairs.cpp) - [Level Order Tree Traversal](ds/LevelOrderTraversal.cpp) @@ -215,10 +216,9 @@ - [Heap Sort](ds/heap_sort.cpp) - [Middle Element of a Linked List](ds/linked_list_middle_element.cpp) - [Leaf Nodes in Binary Search Tree](ds/Leaf_Nodes_BST.cpp) -- [Detect Cycle in Linked List ](ds/Detect_Cycle_In_LinkedList.cpp) - [Linked List](ds/LinkedList.cpp) - [Max and Min heap Implementation](ds/max_min_heap.cpp) -- [Nodes At A Distance K From A Given Target Node In A Binary Tree](ds\K_Distance_Nodes_Binary_Tree.cpp) +- [Nodes At A Distance K From A Given Target Node In A Binary Tree](ds/K_Distance_Nodes_Binary_Tree.cpp) - [Prims Algorithm](ds/prims_algo.cpp) - [Priority Queue](ds/Priority_Queue.cpp) - [Queue](ds/queue.cpp) @@ -243,12 +243,12 @@ - [Linear Probing](ds/linear-probing.cpp) - [Quadratic Probing](ds/quadratic-probing.cpp) - [Double Hashing](ds/double-hashing.cpp) -- [Flattening binary tree into Linkedlist in-place](ds/linkedlisttree.cpp) +- [Flattening binary tree into Linkedlist in-place](ds/Linkedlisttree.cpp) - [Ascending Priority Queue](ds/Ascending_priority_queue.cpp) - [Priority Queue using Linked List](ds/Priority_Queue_using_LinkedList.cpp) - [Maximum Width of Binary Tree](ds/Maximum_Width_BinaryTree.cpp) - [Inversion Vector of a Singly Linked List](ds/inversion_vector.cpp) -- [inverse of an array](C-Plus-Plus/ds/inverse_of_an_array.cpp) +- [inverse of an array](ds/inverse_of_an_array.cpp) - [Iterative postorder traversal](ds/iterative_postorder.cpp) - [Iterative preorder traversal](ds/iterative_preorder.cpp) - [Iterative inorder traversal](ds/iterative_inorder.cpp) @@ -259,7 +259,7 @@ - [Maximum Sum Level Of Binary Tree](ds/Max_Sum_Level_Of_Binary_Tree.cpp) - [Sort linked list of zeros, ones and twos](ds/sort_list_of_0s_1s_2s.cpp) - [Vertical Order Traversal Of Binary Tree](ds/vertical_order_traversal_BinaryTree.cpp) -- [Height of Binary Tree without using Recusrsion](ds/Height_Of_Binary_Tree_Non_Recursive.cpp) +- [Height of Binary Tree without using Recursion](ds/Height_Of_Binary_Tree_Non_Recursive.cpp) - [Print all Root to Leaf paths of Given Binary Tree](ds/Binary_Tree_Print_All_Root_To_Leaf_Paths.cpp) - [Maximum Root to Leaf Path sum of a Binary Tree](ds/Binary_Tree_Max_Root_To_Leaf_Path_Sum.cpp) - [Common Ancestors of Given Nodes of a Binary Tree](ds/Common_Ancestors_Of_Nodes_Of_Binary_Tree.cpp) @@ -271,18 +271,18 @@ - [Check if given two Binary Trees are structurally identical or not](ds/Structurally_Identical_Binary_Trees.cpp) - [Shortest Distance between two nodes of BST](ds/Shortest_Distance_Between_Nodes_Of_BST.cpp) - [Floor value of a given number in the given BST](ds/Floor_of_a_number_in_BST.cpp) -- [Print all node values of a given BST, which lies within the given range](ds\BST_Range_Print.cpp) +- [Print all node values of a given BST, which lies within the given range](ds/BST_Range_Print.cpp) - [Check if two given trees are Quasi Isomorphic or not](ds/Quasi_Isomorphic_Binary_Trees.cpp) - [Build a Balanced BST with given vector of values](ds/Balanced_BST_From_a_vector_of_values.cpp) - [Given a BST check if it is AVL Tree or not](ds/AVL_Tree_or_not.cpp) -- [Next Larger Element-tree](ds/Next_Larger_Element-tree_using_CPP.cpp) -- [Swapping Node of Linked List](ds/Sawpping_Nodes_of_Linked_list-Using_CPP.cpp) + +- [Swapping Node of Linked List](ds/Swapping_Nodes_of_Linked_list-Using_CPP.cpp) - [Auto Complete - Using Trie](ds/Auto_complete.cpp) - [Append Last N To First](ds/Append_Last_N_To_First.cpp) - [Searching in BST](ds/Searching_in_BST.cpp) - [Binary tree using stack (iterative method to construct tree)](ds/BinaryTreeUsingStack.cpp) - [Merge Sort- Linked List](ds/MergeSortLL.cpp) -- [Remove all Duplicated from Sorted Linked List](ds/Remove_all_Duplicates_from_Linnkedlist.cpp) +- [Remove all Duplicated from Sorted Linked List](ds/Remove_all_Duplicates_from_Linkedlist.cpp) - [Queue using Stacks](ds/Queue_using_Stacks.cpp) - [First Fit memory Allocation](ds/first_fit.cpp) - [Best Fit memory Allocation](ds/best_fit_memory.cpp) @@ -308,7 +308,7 @@ - [Bellman Ford's Algorithm](graphs/BellmanFord.cpp) - [Best First Search Algorithm](graphs/Best_First_Search_Algorithm.cpp) - [Breadth First Search Tree Traversal](graphs/bfs.cpp) -- [Bidirectional Seach using BFS in undirected graph](graphs/Bidirectional_search_using_BFS_in_undirected_graph.cpp) +- [Bidirectional Search using BFS in undirected graph](graphs/Bidirectional_search_using_BFS_in_undirected_graph.cpp) - [Bridges in an Undirected Graph](graphs/Bridges.cpp) - [Boruvka's Algorithm for finding MST](graphs/Boruvka_algorithm_for_finding_MST.cpp) - [Celebrity Problem](graphs/celebrity_problem.cpp) @@ -316,7 +316,7 @@ - [Cycle Detection in Undirected Graph using BFS](graphs/checkCycle_bfs.cpp) - [Cycle Detection in a Directed Graph](graphs/DirectedCycleDetection.cpp) - [Cycle Detection in Graph](graphs/detect_cycle.cpp) -- [Depth First Search Algorithm](graphs/DFS.cpp) + - [Depth Of Tree](graphs/Depth_of_tree.cpp) - [Detect Negative Cycle in Graph](graphs/DetectNegativeCycle.cpp) - [Diagonal Traversal](graphs/Diagonal_traversal.cpp) @@ -334,8 +334,8 @@ - [Pre-order (NLR) Tree Traversal](/graphs/Preorder_Traversal.cpp) - [Prim's Algorithm](graphs/Prim_Algorithm.cpp) - [Minimum distance of each node using SSSP on trees by DFS](graphs/minimum_distance_using_SSSP_on_trees_by_DFS.cpp) -- [Toplogical Sort in Directed Acyclic Graph (DAG) using DFS](graphs/TopologicalSort.cpp) -- [Toplogical Sort in Directed Acyclic Graph (DAG) using BFS](graphs/topologicalSort_bfs.cpp) +- [Topological Sort in Directed Acyclic Graph (DAG) using DFS](graphs/TopologicalSort.cpp) +- [Topological Sort in Directed Acyclic Graph (DAG) using BFS](graphs/topologicalSort_bfs.cpp) - [Tarjan's Algorithm](graphs/Tarjan's_Algorithm.cpp) - [Vertical Order print of Binary Tree](graphs/Vertical_order_print_of_binary_tree.cpp) - [Left view of Tree](graphs/left_view_of_tree.cpp) @@ -362,7 +362,7 @@ - [Interpolation Search](search/Interpolation_Search.cpp) - [Jump Search](search/Jump_Search.cpp) - [Linear Search](search/Linear_Search.cpp) -- [Manacher's Algorithm](search/Manacher's_Algorithm.cp) +- [Manacher's Algorithm](search/Manacher's_Algorithm.cpp) - [Randomized Select Search](search/Randomized_Select.cpp) - [Staircase Search](search/Staircase_Search.cpp) - [Ternary Search](search/TernarySearch.cpp) @@ -370,7 +370,7 @@ - [Unbounded Binary Search](search/Unbounded_Binary_Search.cpp) - [Sublist Search](search/sublist_Search.cpp) - [Recursive Binary Search](search/Binary_Recursive_Search.cpp) -- [Pair of nodes in the BST which sum to S](search/PairOfNodesInTheBSTWhichSumToS.cpp) +- [Pair of nodes in the BST which sum to S](search/Pair_Of_nodes_in_the_BST_which_Sum_to_S.cpp) - [Sqrt Monotonic Binary Search](search/Sqrt_Monotonic_Binary_Search.cpp) - [Order Agnostic Binary Search](search/orderAgnosticBS.cpp) @@ -394,7 +394,7 @@ - [Radix Sort](sort/radix_sort.cpp) - [Randomized Quick Sort](sort/Randomized_Quick_Sort.cpp) - [Selection Sort](sort/selection_sort.cpp) -- [Shell Sort](sort/ShellSort.cpp) +- [Shell Sort](sort/Shellsort.cpp) - [Single loop sorting](sort/Single_loop_sort.cpp) - [Topological Sort](sort/Topological_Sorting_DFS.cpp) - [Topological Sort](sort/Topological_Sort.cpp) @@ -426,8 +426,8 @@ - [Infix to Postfix conversion](stack/infixToPostfix.cpp) - [Next smallest element to the right](stack/nextSmallestToRight.cpp) - [Smallest element in an array](stack/smallest_element_in_an_array.cpp) -- [Sort stack using recursion](stack\Sort_stack_using_recursion.cpp) -- [Cloning stack without extra space ](stack\clone_a_stack_without_usinig_extra_space.cpp) +- [Sort stack using recursion](stack/Sort_stack_using_recursion.cpp) +- [Cloning stack without extra space ](stack/clone_a_stack_without_using_extra_space.cpp) - [Checking if a linked list is palindromic](stack/palindromic_list.cpp) - [Check palindrome using stack](stack/CheckPalindrome.cpp) - [Postfix to Prefix Conversion](stack/postfix_to_prefix.cpp) @@ -442,10 +442,10 @@ - [K Closest Points to Origin](heap/K_Closest_Points_to_Origin.cpp) - [Cheapest flights within k stops](heap/cheapest_flights_within_k_stops.cpp) - [Heap implementation and basic queries on it](heap/heap_implementation.cpp) -- [Reconstruct Itinerary Problem implementation using Hashmap](heap/reconstruct_Itinerary.cpp) +- [Reconstruct Itinerary Problem implementation using Hashmap](heap/Reconstruct_Itinerary.cpp) - [Convert BST to Min Heap](heap/BSTtoMinHeap.cpp) - [Convert Min Heap To Max Heap](heap/ConvertMinHeapToMax.cpp) -- [Kth Smallest Element in an array](heap/KthSmallest.cpp) +- [Kth Smallest Element in an array](heap/KthSmallestElement.cpp) - [Connect N ropes with Minimum Cost](heap/ConnectNRopesWithMinumumCost.cpp) - [Merge K Sorted Lists](heap/MergeKSortedList.cpp) @@ -537,23 +537,23 @@ _add list here_ - [Longest common sub sequence](dp/longest_increasing_subsequence.cpp) - [Longest Decreasing Subsequence](dp/length_longest_decreasing_subsequence.cpp) - [Longest increasing subsequence](dp/longest_increasing_subsequence.cpp) -- [Maximum Subarray Sum (Constant Space)]() +- [Maximum Subarray Sum (Constant Space)](dp/Max_subarray_sum_constant_space_DP.cpp) - [Maximum Sum Rectangle](dp/max_sum_rectangle.cpp) - [Maximum Sum Decreasing Subsequence](dp/maximum_sum_decreasing_subsequence.cpp) - [Maximum Sum Increasing Subsequence](dp/maximum_sum_increasing_subsequence.cpp) - [Maximum Square Matrix With All 1s](dp/maxSquareMatrixWithOnes.cpp) -- [Minimum Sum Partition using DP](dp/minimum_sum_partition_dp.cpp) +- [Minimum Sum Partition using DP](dp/Minimum_Sum_Partition_dp.cpp) - [Number Of Binary Trees](dp/number_of_binary_trees.cpp) - [Number of subsets with given difference](dp/subsets_with_given_diff.cpp) - [Palindrome_Partioning](dp/Palindrome_Partitioning.cpp) -- [Partition Problem](dp/Partition_Problem.cpp) + - [Rectangle Cutting Problem](dp/Rectangle_cutting.cpp) - [Golomb Sequence](dp/golomb_sequence.cpp) - [String permutations](dp/string_permutations.cpp) -- [Wild Card Pattern Matching](dp/WildCardMatching.cpp) +- [Wild Card Pattern Matching](dp/wildcard_matching.cpp) - [Unique BST](dp/Unique_BST.cpp) - [Zero One Knapsack](dp/Zero_One_Knapsack.cpp) -- [ZeroN Knapsack](dp/Zero_N_knapsack.cpp) +- [ZeroN Knapsack](dp/Zero_N_Knapsack.cpp) - [K-Tree](dp/K-Tree.cpp) - [Sprague Grundy Theorem on Strings](dp/Sprague_Grundy_Theorem.cpp) - [Minimum number of deletion to make palindrome](dp/Minimum_number_of_deletion.cpp) @@ -667,8 +667,8 @@ _add list here_ - [Russian Peasant Algorithm](other/RussianPeasantAlgo.cpp) - [Sliding Window Technique](other/Calculate_max_sum_of_k_consecutive_elements.cpp) - [String Rotation based on Queries](other/string_rotation.cpp) -- [Sudoku Solver](other/sudoku.cpp) -- [Sum of all the possible divisors of a natural number](other/sum_of_divisors.cpp) +- [Sudoku Solver](other/sudoku_solver.cpp) +- [Sum of all the possible divisors of a natural number](other/Sum_of_divisors.cpp) - [Swap Two Nibbles](other/SwapTwoNibbles.cpp) - [Unique_Number_III](other/Unique_Number_III.cpp) - [Find array is Subset of another array](other/Find_array_is_Subset_of_another_array.cpp) @@ -680,7 +680,7 @@ _add list here_ - [Nth Most Occurring Strings](other/most_occurrence_strings.cpp) - [Find a Median of two Sorted arrays of equal size](other/Median_of_two_Sorted_arrays_of_equal_size.cpp) - [Find a Median of two Sorted arrays of different size](other/Median_of_two_Sorted_arrays_of_different_size.cpp) -- [Find Kth smallest element in a Sorted Matrix](other/Find_Kth_smallest_element_in_Sorted_Matrix.cpp) +- [Find Kth smallest element in a Sorted Matrix](other/Find_Kth_smallest_element_in_sorted_Matrix.cpp) - [Find Common Element in row-wise sorted matrix](other/Find_Common_Element_in_matrix.cpp) - [Vector of Strings Occurs More than Once](other/vector_of_strings_occurs_more_than_one_time.cpp) - [KnapSack Fractional using Greedy Approach](other/knapsackfraction.cpp) @@ -692,7 +692,6 @@ _add list here_ - [Concatenate given strings](other/n_string_concatenate.cpp) - [Decimal to Gray code Conversion](other/Decimal_to_gray.cpp) - [Trapping Rainwater](other/trappingRainwater.cpp) -- [4Sum](other/4Sum.cpp) - [Maximum ELement in a bitonic Array](other/Max_in_BitonicArray.cpp) - [Find Kth Element of Two Sorted Array](other/Find_kth_Element_of_two_sorted_array.cpp) - [Find median in a row-wise sorted Matrix](other/Median_in_row_wise_sorted_matrix.cpp) @@ -709,7 +708,7 @@ _add list here_ - [Kth missing Positive integer in sorted Array](other/kth_missing.cpp) - [Triplet Sum in array](other/Triplet_sum_in_array.cpp) - [Maximize consecutive average integer pair](other/Maxm_consecutive_avgint_pairs.cpp) -- [Minimum Sum Partition using Recursion](other/minimum_sum_partition_recursion.cpp) +- [Minimum Sum Partition using Recursion](other/Minimum_Sum_Partition_recursion.cpp) - [Zig Zag Array(unsorted)](other/zig-zag_array_unsorted.cpp) - [Zig Zag Array(sorted)](other/zig-zag_array_sorted.cpp) - [Minimum no. of jumps to reach end of an array](other/MinJumpsToReachEndofArray.cpp) diff --git a/C-Plus-Plus/Generic_Swaps.cpp b/C-Plus-Plus/cp/Generic_Swaps.cpp similarity index 100% rename from C-Plus-Plus/Generic_Swaps.cpp rename to C-Plus-Plus/cp/Generic_Swaps.cpp diff --git a/C-Plus-Plus/cp/Kadane_Alogorithm.cpp b/C-Plus-Plus/cp/Kadane_Algorithm.cpp similarity index 100% rename from C-Plus-Plus/cp/Kadane_Alogorithm.cpp rename to C-Plus-Plus/cp/Kadane_Algorithm.cpp diff --git a/C-Plus-Plus/cp/Lexicographyically_largest_palindrome_subsequence.cpp b/C-Plus-Plus/cp/Lexicographically_largest_palindrome_subsequence.cpp similarity index 100% rename from C-Plus-Plus/cp/Lexicographyically_largest_palindrome_subsequence.cpp rename to C-Plus-Plus/cp/Lexicographically_largest_palindrome_subsequence.cpp diff --git a/C-Plus-Plus/adjacent.cpp b/C-Plus-Plus/cp/adjacent.cpp similarity index 100% rename from C-Plus-Plus/adjacent.cpp rename to C-Plus-Plus/cp/adjacent.cpp diff --git a/C-Plus-Plus/cp/find_single _occuring_element.cpp b/C-Plus-Plus/cp/find_single_occuring_element.cpp similarity index 100% rename from C-Plus-Plus/cp/find_single _occuring_element.cpp rename to C-Plus-Plus/cp/find_single_occuring_element.cpp diff --git a/C-Plus-Plus/cp/matrix's_principal_seconday_diagonal_sum.cpp b/C-Plus-Plus/cp/matrix's_principal_secondary_diagonal_sum.cpp similarity index 100% rename from C-Plus-Plus/cp/matrix's_principal_seconday_diagonal_sum.cpp rename to C-Plus-Plus/cp/matrix's_principal_secondary_diagonal_sum.cpp diff --git a/C-Plus-Plus/power.cpp b/C-Plus-Plus/cp/power.cpp similarity index 100% rename from C-Plus-Plus/power.cpp rename to C-Plus-Plus/cp/power.cpp diff --git a/C-Plus-Plus/dp/Max_subarray_sum_constant_space(DP).cpp b/C-Plus-Plus/dp/Max_subarray_sum_constant_space_DP.cpp similarity index 100% rename from C-Plus-Plus/dp/Max_subarray_sum_constant_space(DP).cpp rename to C-Plus-Plus/dp/Max_subarray_sum_constant_space_DP.cpp diff --git a/C-Plus-Plus/ds/Detet_Cycle_In_LinkedList.cpp b/C-Plus-Plus/ds/Detect_Cycle_In_LinkedList.cpp similarity index 100% rename from C-Plus-Plus/ds/Detet_Cycle_In_LinkedList.cpp rename to C-Plus-Plus/ds/Detect_Cycle_In_LinkedList.cpp diff --git a/C-Plus-Plus/ds/Remove_all_Duplicates_from_Linnkedlist.cpp b/C-Plus-Plus/ds/Remove_all_Duplicates_from_Linkedlist.cpp similarity index 100% rename from C-Plus-Plus/ds/Remove_all_Duplicates_from_Linnkedlist.cpp rename to C-Plus-Plus/ds/Remove_all_Duplicates_from_Linkedlist.cpp diff --git a/C-Plus-Plus/ds/SLL_Operations_Usnig_Unique_Key.cpp b/C-Plus-Plus/ds/SLL_Operations_using_Unique_Key.cpp similarity index 100% rename from C-Plus-Plus/ds/SLL_Operations_Usnig_Unique_Key.cpp rename to C-Plus-Plus/ds/SLL_Operations_using_Unique_Key.cpp diff --git a/C-Plus-Plus/ds/Sawpping_Nodes_of_Linked_list-Using_CPP.cpp b/C-Plus-Plus/ds/Swapping_Nodes_of_Linked_list-Using_CPP.cpp similarity index 100% rename from C-Plus-Plus/ds/Sawpping_Nodes_of_Linked_list-Using_CPP.cpp rename to C-Plus-Plus/ds/Swapping_Nodes_of_Linked_list-Using_CPP.cpp diff --git a/C-Plus-Plus/ds/detectionOfCycle_likedList.cpp b/C-Plus-Plus/ds/detectionOfCycle_linkedList.cpp similarity index 100% rename from C-Plus-Plus/ds/detectionOfCycle_likedList.cpp rename to C-Plus-Plus/ds/detectionOfCycle_linkedList.cpp diff --git a/C-Plus-Plus/graphs/Connecting _Dots-Graphs_using_cpp.cpp b/C-Plus-Plus/graphs/Connecting_Dots-Graphs_using_cpp.cpp similarity index 100% rename from C-Plus-Plus/graphs/Connecting _Dots-Graphs_using_cpp.cpp rename to C-Plus-Plus/graphs/Connecting_Dots-Graphs_using_cpp.cpp diff --git a/C-Plus-Plus/graphs/Tarjan's_Algoirthm.cpp b/C-Plus-Plus/graphs/Tarjan's_Algorithm.cpp similarity index 100% rename from C-Plus-Plus/graphs/Tarjan's_Algoirthm.cpp rename to C-Plus-Plus/graphs/Tarjan's_Algorithm.cpp diff --git a/C-Plus-Plus/search/Pair Of Nodes In The BST Which Sum To S.cpp b/C-Plus-Plus/search/Pair_Of_nodes_in_the_BST_which_Sum_to_S.cpp similarity index 100% rename from C-Plus-Plus/search/Pair Of Nodes In The BST Which Sum To S.cpp rename to C-Plus-Plus/search/Pair_Of_nodes_in_the_BST_which_Sum_to_S.cpp diff --git a/C-Plus-Plus/stack/clone_a_stack_without_usinig_extra_space.cpp b/C-Plus-Plus/stack/clone_a_stack_without_using_extra_space.cpp similarity index 100% rename from C-Plus-Plus/stack/clone_a_stack_without_usinig_extra_space.cpp rename to C-Plus-Plus/stack/clone_a_stack_without_using_extra_space.cpp