GitHub - abrarshahok/Data-Structures-Algorithims-CPP: Data Structures & Algorithims Practice Programs in C++

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 45 Commits
.vscode		.vscode
01_Recursion.cpp		01_Recursion.cpp
02_Sum_of_N_Natural_Numbers_Recursion.cpp		02_Sum_of_N_Natural_Numbers_Recursion.cpp
03_Factorial_of_Number_Recursion.cpp		03_Factorial_of_Number_Recursion.cpp
04_Power_of_Number_Recursion.cpp		04_Power_of_Number_Recursion.cpp
05_Power_of_Num_Less_Calls.cpp		05_Power_of_Num_Less_Calls.cpp
06_Taylor_Series.cpp		06_Taylor_Series.cpp
07_Taylor_Series_Using_Honers_Rule.cpp		07_Taylor_Series_Using_Honers_Rule.cpp
08_Print_Fibonnaci_Series.cpp		08_Print_Fibonnaci_Series.cpp
09_Print_Last_Fib.cpp		09_Print_Last_Fib.cpp
10_Last_Fib_Memoization.cpp		10_Last_Fib_Memoization.cpp
11_Find_nCr.cpp		11_Find_nCr.cpp
12_Tower_of_Hanoi.cpp		12_Tower_of_Hanoi.cpp
13_Arrays.cpp		13_Arrays.cpp
14_2D_Arrays.cpp		14_2D_Arrays.cpp
15_Array_ADT.cpp		15_Array_ADT.cpp
16_Find_Single_Missing_Element_in-Sorted_Array.cpp		16_Find_Single_Missing_Element_in-Sorted_Array.cpp
17_Find_Missing_Elements.cpp		17_Find_Missing_Elements.cpp
18_FInd_Missing_Elements_in_Unsorted_Array.cpp		18_FInd_Missing_Elements_in_Unsorted_Array.cpp
19_Find_Duplicates.cpp		19_Find_Duplicates.cpp
20_Count_Duplicates.cpp		20_Count_Duplicates.cpp
21_Find_Duplicates_in_Unsorted_Array.cpp		21_Find_Duplicates_in_Unsorted_Array.cpp
22_Count_Duplicates_in_Unsorted_Array.cpp		22_Count_Duplicates_in_Unsorted_Array.cpp
23_Find_a_Pair_of_Elements_with_SUM_k.cpp		23_Find_a_Pair_of_Elements_with_SUM_k.cpp
24_Find_a_Pair_of_Elements_with_SUM_k_in_Sorted_Array.cpp		24_Find_a_Pair_of_Elements_with_SUM_k_in_Sorted_Array.cpp
25_FInd_Max_and_Min.cpp		25_FInd_Max_and_Min.cpp
26_Change_Case_of_Strings.cpp		26_Change_Case_of_Strings.cpp
27_Count_Vowels_and_Words.cpp		27_Count_Vowels_and_Words.cpp
28_String_Validation.cpp		28_String_Validation.cpp
29_Reverse_a_String_logn.cpp		29_Reverse_a_String_logn.cpp
30_String_Palindrome.cpp		30_String_Palindrome.cpp
31_Find_Duplicates_in_String.cpp		31_Find_Duplicates_in_String.cpp
32_Find_Duplicates_in_String_using_Bitwise_Operators.cpp		32_Find_Duplicates_in_String_using_Bitwise_Operators.cpp
33_Find_String_is_Anagram.cpp		33_Find_String_is_Anagram.cpp
34_Permutation_of_String.cpp		34_Permutation_of_String.cpp
35_isDiagonal_Matrix.cpp		35_isDiagonal_Matrix.cpp
36_Diagonal_Matrix.cpp		36_Diagonal_Matrix.cpp
37_isLower_Triangular_Matrix.cpp		37_isLower_Triangular_Matrix.cpp
38_Lower_Triangular_Matrix.cpp		38_Lower_Triangular_Matrix.cpp
39_isUpper_Traingular_Matrix.cpp		39_isUpper_Traingular_Matrix.cpp
40_Upper_Traingular_Matrix.cpp		40_Upper_Traingular_Matrix.cpp
41_isSymetric_Matrix.cpp		41_isSymetric_Matrix.cpp
42_Symetric_Matrix.cpp		42_Symetric_Matrix.cpp
43_isTriDiagonal_Matrix.cpp		43_isTriDiagonal_Matrix.cpp
44_Tridiagonal_Matrix.cpp		44_Tridiagonal_Matrix.cpp
45_isToeplitz_Matrix.cpp		45_isToeplitz_Matrix.cpp
46_Toeplitz_Matrix.cpp		46_Toeplitz_Matrix.cpp
47_LinkedList.cpp		47_LinkedList.cpp
48_Circular_LinkedList.cpp		48_Circular_LinkedList.cpp
49_Doubly_LinkedList.cpp		49_Doubly_LinkedList.cpp
50_Circular_Doubly_LinkedList.cpp		50_Circular_Doubly_LinkedList.cpp
51_Stack_Array_ADT.cpp		51_Stack_Array_ADT.cpp
52_Stack_LL_ADT.cpp		52_Stack_LL_ADT.cpp
53_Balanced_Parenthesis.cpp		53_Balanced_Parenthesis.cpp
54_Infix_to_Postfix.cpp		54_Infix_to_Postfix.cpp
55_Infix_to_Prefix.cpp		55_Infix_to_Prefix.cpp
56_Evaluate_Postfix_Exp.cpp		56_Evaluate_Postfix_Exp.cpp
57_Queue_ADT.cpp		57_Queue_ADT.cpp
58_Circular_Queue_ADT.cpp		58_Circular_Queue_ADT.cpp
59_Queue_LL_ADT.cpp		59_Queue_LL_ADT.cpp
60_Queue_using_2Stacks.cpp		60_Queue_using_2Stacks.cpp
61_Binary_Tree.cpp		61_Binary_Tree.cpp
62_Binary_Search_Tree.cpp		62_Binary_Search_Tree.cpp
63_AVL_Tree.cpp		63_AVL_Tree.cpp
64_Max_Heap.cpp		64_Max_Heap.cpp
65_Min_Heap.cpp		65_Min_Heap.cpp