LoveBabbar-DSA
Lecture wise code files of Love Babbar DSA course in C++
File Explorer
Download Latest Version (.zip)- README.md
- Arithematic_Operators.java
- Datatypes_And_Variables.java
- Logical_Operator.java
- Namaste_Dunia.java
- Relational_Operators.java
- Signed_And_Unsigned_Datatypes.java
- Typecasting.java
- 1_Namaste_Dunia.py
- 2_Datatypes_And_Variables.py
- 3_Typecasting.py
- 4_Signed_And_Unsigned_Datatypes.py
- 5_Arithmetic_Operators.py
- 6_Relational_Operators.py
- 7_Logical_Opeartors.py
- 1_Namaste_Dunia.cpp
- 2_Datatypes_And_Variables.cpp
- 3_Typecasting.cpp
- 4_Signed_And_Unsigned_Datatypes.cpp
- 5_Arithmetic_Operators.cpp
- 6_Relational_Operators.cpp
- 7_Logical_Opeartors.cpp
- README.md
- Check_Positive_Negative_Zero.java
- Counting_Numbers.java
- Fahrenheit_To_Celsius.java
- Greater_Of_Two_Numbers.java
- Lowercase_Uppercase_Number.java
- pattern_01.java
- pattern_02.java
- Sum_Of_Even_Numbers_1_to_N.java
- Sum_Of_Numbers_1_to_N.java
- 1_Check_Positive_Negative_Zero.py
- 2_Greater_Of_Two_Numbers.py
- 3_Lowercase_Uppercase_Number.py
- 4_Counting_Numbers.py
- 5_Sum_Of_Numbers_1-to-N.py
- 6_Sum_Of_Even_Numbers_1-to-N.py
- 7_Fahrenheit_To_Celsius.py
- 8_Pattern_1.py
- 9_Pattern_2.py
- 1_Check_Positive_Negative_Zero.cpp
- 2_Greater_Of_Two_Numbers.cpp
- 3_Lowercase_Uppercase_Number.cpp
- 4_Counting_Numbers.cpp
- 5_Sum_Of_Numbers_1-to-N.cpp
- 6_Sum_Of_Even_Numbers_1-to-N.cpp
- 7_Fahrenheit_To_Celsius.cpp
- 8_Pattern_1.cpp
- 9_Pattern_2.cpp
- README.md
- pattern_01.java
- pattern_02.java
- pattern_03.java
- pattern_04.java
- pattern_05.java
- pattern_06.java
- pattern_07.java
- pattern_08.java
- pattern_09.java
- pattern_10.java
- pattern_11.java
- pattern_12.java
- pattern_13.java
- pattern_14.java
- pattern_15.java
- 01_Pattern.py
- 02_Pattern.py
- 03_Pattern.py
- 04_Pattern.py
- 05_Pattern.py
- 06_Pattern.py
- 07_Pattern.py
- 08_Pattern.py
- 09_Pattern.py
- 10_Pattern.py
- 11_Pattern.py
- 12_Pattern.py
- 13_Pattern.py
- 14_Pattern.py
- 15_Pattern.py
- 16_Pattern.py
- 17_Pattern.py
- 18_Pattern.py
- 19_Pattern.py
- 20_Pattern.py
- 21_Pattern.py
- 22_Pattern.py
- 23_Pattern.py
- 24_Pattern.py
- 25_Pattern.py
- 26_Pattern.py
- 27_Pattern.py
- 28_Pattern.py
- 29_Pattern.py
- 30_Pattern.py
- 31_Pattern.py
- 32_Pattern.py
- 33_Pattern.py
- 34_Pattern.py
- 35_Pattern.py
- 36_Pattern.py
- 01_Pattern.cpp
- 02_Pattern.cpp
- 03_Pattern.cpp
- 04_Pattern.cpp
- 05_Pattern.cpp
- 06_Pattern.cpp
- 07_Pattern.cpp
- 08_Pattern.cpp
- 09_Pattern.cpp
- 10_Pattern.cpp
- 11_Pattern.cpp
- 12_Pattern.cpp
- 13_Pattern.cpp
- 14_Pattern.cpp
- 15_Pattern.cpp
- 16_Pattern.cpp
- 17_Pattern.cpp
- 18_Pattern.cpp
- 19_Pattern.cpp
- 20_Pattern.cpp
- 21_Pattern.cpp
- 22_Pattern.cpp
- 23_Pattern.cpp
- 24_Pattern.cpp
- 25_Pattern.cpp
- 26_Pattern.cpp
- 27_Pattern.cpp
- 28_Pattern.cpp
- 29_Pattern.cpp
- 30_Pattern.cpp
- 31_Pattern.cpp
- 32_Pattern.cpp
- 33_Pattern.cpp
- 34_Pattern.cpp
- 35_Pattern.cpp
- 36_Pattern.cpp
- README.md
- 1_Bitwise_Operator.cpp
- 2_Left_and_Right_Shift_Operator.cpp
- 3_Increment_and_Decrement_Operator.cpp
- 4_Fibonacci_Series.cpp
- 5_Check_Prime_Number.cpp
- 6_Subtract_the_Product_and_Sum_of_Digits_of_an_Integer.cpp
- 7_Number_of_1_Bits.cpp
- README.md
- 1_Decimal_To_Binary.cpp
- 2_Negative_Decimal_To_Binary.cpp
- 3_Binary_To_Decimal.cpp
- Readme.MD
- 1_Reverese_Integer.cpp
- 2_Complement_Of_Base_10_Integer.cpp
- 3_Power_Of_2.cpp
- README.md
- 01_Switch_Introduction.cpp
- 02_Switch_Case_In_Infinite_Loop.cpp
- 03_Calculator.cpp
- 04_Currency_Notes_Distribution.cpp
- 05_Function_Introduction.cpp
- 06_Even_Odd.cpp
- 07_nCr.cpp
- 08_Counting.cpp
- 09_isPrime.cpp
- 10_Nth_Term_Of_AP.cpp
- 11_Total_Setbits.cpp
- 12_Nth_Fibonacci_Number.cpp
- 13_Pass_By_Value.cpp
- README.md
- 1_Array_introduction.cpp
- 2_Max_Min_In_Array.cpp
- 3_Array_Scope.cpp
- 4_Sum_Of_Elements_In_Array.cpp
- 5_Linear_Search.cpp
- 6_Reverse_Array.cpp
- README.md
- 01_Swap_Alternate_Elements.cpp
- 02_Find_Unique_Element.cpp
- 03_Unique_Number_Of_Occurrences.cpp
- 04_Find_Duplicate_Element_In_Array.cpp
- 05_Find_All_Duplicates_In_Array.cpp
- 06_Intersection_Of_Two_Arrays.cpp
- 07_Pair_Sum.cpp
- 08_Triplet_With_Given_Sum.cpp
- 09_Sort_0_1.cpp
- 10_Sort_0_1_2.cpp
- README.md
- Details.txt
- 1_Intro_To_Binary_Search.cpp
- README.md
- 1_First_And_Last_Position_Of_Element_In_Sorted_Array.cpp
- 2_Total_Number_Of_Occurrences_In_Sorted_Array.cpp
- 3_Peak_Index_In_Mountain_Array.cpp
- 4_Pivot_Element_In_An_Array.cpp
- README.md
- 1_Pivot_Element_In_Sorted_Rotated_Array.cpp
- 2_Search_In_Rotated_Sorted_Array.cpp
- 3_Square_Root_Using_Binary_Search.cpp
- 4_Floating_Point_Square_Root.cpp
- 1_Allocate_Books.cpp
- 2_Painters_Partition.cpp
- 3_Aggressive_Cows.cpp
- 4_EKO.cpp
- 5_PRATA.cpp
- 6_Cooking_Ninjas.cpp
- 1_Selection_Sort.cpp
- README.md
- 1_Bubble_Sort.cpp
- 2_Flag_Sort.cpp
- README.md
- 1_Insertion_Sort.cpp
- README.md
- 1_Array.cpp
- 2_Vector.cpp
- 3_Deque.cpp
- 4_List.cpp
- 5_Stack.cpp
- 6_Priority_Queue.cpp
- 7_Set.cpp
- 8_Map.cpp
- 9_Algorithms.cpp
- README.md
- 1_Reverse_The_Array.cpp
- 2_Reverse_Array_From_Given_Position.cpp
- 3_Merge_Sorted_Array.cpp
- 4_Move_Zeroes.cpp
- 1_Rotate_Array.cpp
- 2_Check_Sorted_Rotated.cpp
- 3_Sum_Of_Two_Arrays.cpp
- 01_Character_Array_Intro.cpp
- 02_Length_Of_String.cpp
- 03_Reverse_String.cpp
- 04_Check_Palindrome_String.cpp
- 05_Check_Non-Case_Sensative_Palindrome.cpp
- 06_Valid_Palindrome.cpp
- 07_Reverse_Word_In_A_String.cpp
- 08_Get_Maximum_Occurrence_Of_Character.cpp
- 09_Replace_Spaces.cpp
- 10_Remove_All_Occurrences_Of_A_Substring.cpp
- 11_Permutation_In_String.cpp
- 12_Remove_All_Adjacent_Duplicates_In_String.cpp
- 13_String_Compression.cpp
- README.md
- 01_2D_Array.cpp
- 02_Searching_In_2D_Array.cpp
- 03_Row_Wise_Sum.cpp
- 04_Col_Wise_Sum.cpp
- 05_Largest_Row_Sum.cpp
- 06_Wave_Print.cpp
- 07_Spiral_Print.cpp
- 08_Rotate_Image.cpp
- 09_Binary_Search_In_2D_Array.cpp
- 10_Search_In_2D_Matrix_II.cpp
- 1_Prime_Number.cpp
- 2_Count_Prime.cpp
- 3_Segmented_Sieve.cpp
- 4_GCD.cpp
- 5_Modular_Exponentiation.cpp
- 6_Pigeon_Hole_Principle.cpp
- 7_Catalon_Number.cpp
- 8_Inclusion_Exclusion_Principle.cpp
- 9_Factorial.cpp
- 1_Pointers.cpp
- 1_Pointers_And_Array.cpp
- 2_Pointer_With_Character_Array.cpp
- 3_Pointer_With_Functions.cpp
- 1_Double_Pointer.cpp
- 2_Double_Pointer_With_Function.cpp
- 1_Reference_Variable.cpp
- 2_Dynamic_Array.cpp
- README.md
- 1_Dynamic_2D_Array.cpp
- 2_Jaggered_Array.cpp
- README.md
- 1_Macro_Introduction.cpp
- 2_Global_Variable.cpp
- 3_Inline_Functions.cpp
- 4_Default_Argument.cpp
- README.md
- 1_Factorial.cpp
- 2_Power_Of_Num.cpp
- 3_Print_Counting.cpp
- README.MD
- 1_Walking_Example.cpp
- 2_Nth_Fibonacci_Number.cpp
- 3_Count_Ways_To_Reach_Nth_Stairs.cpp
- 4_Say_Digits.cpp
- README.md
- 1_First_And_Last_Position_Of_Element_In_Sorted_Array.cpp
- 2_Total_Number_Of_Occurrences_In_Sorted_Array.cpp
- 3_Peak_Index_In_Mountain_Array.cpp
- README.md
- README.md
- README.md
- 1_isSorted.cpp
- 2_Sum_Of_Array_Elements.cpp
- 3_Linear_Search.cpp
- 4_Binary_Search.cpp
- README.md
- 1_Reverse_String.cpp
- 2_Check_Palindrome.cpp
- 3_Exponent.cpp
- 4_Bubble_Sort.cpp
- 5_Selection_Sort.cpp
- 6_Insertion_Sort.cpp
- README.md
- 1_Merge_Sort.cpp
- 2_Count_Inversion.cpp
- README.md
- 1_Quick_Sort.cpp
- README.md
- 1_PowerSet.cpp
- 2_Subsequences.cpp
- README.md
- 1_Phone_Keypad_Problem.cpp
- README.md
- 1_Permutations_Of_String.cpp
- 2_Permutations.cpp
- README.md
- 1_Rat_In_A_Maze.cpp
- README.md
- README.md
- 1_Class_Introduction.cpp
- 2_Class_Dynamic_Allocation.cpp
- 3_Constructor.cpp
- 4_Copy_Constructor.cpp
- 5_Deep_And_Shallow_Copy.cpp
- 6_Destructor.cpp
- 7_Static_Keyword.cpp
- README.md
- 01_Inheritance.cpp
- 02_Single_Inheritance.cpp
- 03_Multilevel_Inheritance.cpp
- 04_Multiple_Inheritance.cpp
- 05_Hybrid_Inheritance.cpp
- 06_Hierarchical_Inheritance.cpp
- 07_Inheritance_Ambiguity.cpp
- 08_Function_Overloading.cpp
- 09_Operator_Overloading.cpp
- 10_Runtime_Polymorphism.cpp
- README.md
- 1_LL_Intro.cpp
- 2_Singly_Linked_List.cpp
- 3_Doubly_Linked_List.cpp
- 4_Circular_Linked_List.cpp
- README.md
- 1_Reverse_Linked_List.cpp
- 2_Reverse_DLL.cpp
- 3_MIddle_Of_Linked_List.cpp
- README.md
- 1_Reverse_LL_In_K_Groups.cpp
- 2_Check_Circular_List.cpp
- README.md
- 1_Detect_Loop.cpp
- 2_Floyd_Cycle_Detection.cpp
- 3_Beginning_Of_The_Loop.cpp
- 4_Remove_Loop.cpp
- README.md
- 1_Remove_Duplicates_In_Sorted_Linked_List.cpp
- 2_Remove_Duplicates_In_Unsorted_Linked_List.cpp
- 3_Split_Circular_List.cpp
- README.md
- 1_Sort012_In_LL.cpp
- 2_Sort012_In_LL_2.cpp
- 3_Merge_2_Sorted_List.cpp
- README.md
- 1_Check_Palindrome_In_LL_App1.cpp
- 2_Check_Palindrome_In_LL_App2.cpp
- 3_Check_Palindrome_In_LL_App3.cpp
- README.md
- 1_Add_2_Numbers_Represented_By_LL.cpp
- 2_Add_1_To_A_Number_Represented_By_LL.cpp
- README.md
- 1_Clone_A_Linked_List.cpp
- 2_Clone_A_Linked_List_App2.cpp
- README.md
- 1_Merge_Sort_In_Linked_List.cpp
- 2_Flatten_A_Linked_List.cpp
- README.md
- 1_Stack_STL_Implementation.cpp
- 2_Stack_Array_Implementation.cpp
- 3_Stack_Linked_List_Implementation.cpp
- 4_Two_Stack_In_An_Array.cpp
- README.md
- 01_Reverse_String_Using_Stack.cpp
- 02_Delete_Middle_Of_Stack.cpp
- 03_Valid_Parantheses.cpp
- 04_Insert_An_Element_At_Bottom_Of_Stack.cpp
- 05_Reverse_Stack_Using_Recursion.cpp
- 06_Sort_Stack.cpp
- 07_Redundant_Brackets.cpp
- 08_Minimum_Cost_To_Make_String_Valid.cpp
- README.md
- 1_Next_Smaller_Element.cpp
- 2_Previous_Smaller_Element.cpp
- 3_Largest_Rectangle_In_Histogram.cpp
- README.md
- 1_Celebrity_Problem.cpp
- 2_Max_Rectangle_In_Binary_Matrix_With_All_1s.cpp
- README.md
- 1_N_Stacks_In_An_Array.cpp
- README.md
- 1_getMin_In_O(1)_TC.cpp
- README.md
- 1_Queue_STL_Implementation.cpp
- 2_Queue_Array_Implementation.cpp
- 3_Queue_Linked_List_Implementation.cpp
- 4_Circular_Queue.cpp
- 5_Input_Restricted_Queue.cpp
- 6_Output_Restricted_Queue.cpp
- 7_Doubly_Ended_Queue_STL.cpp
- 8_Doubly_Ended_Queue_Implementation.cpp
- README.md
- 1_Queue_Rervsal.cpp
- README.md
- 1_Binary_Tree_Introduction.cpp
- 2_PreOrder_Traversal.cpp
- 3_InOrder_Traversal.cpp
- 4_PostOrder_Traversal.cpp
- 5_Reverse_Level_Order.cpp
- BinaryTree.h
- README.md
- 1_Height_Of_Binary_Tree.cpp
- 2_Diameter_Of_Binary_Tree.cpp
- 3_Check_Balanced_Tree.cpp
- 4_Check_Identical_Trees.cpp
- 5_Sum_Tree.cpp
- BinaryTree.h
- README.md
- 1_ZigZag_Traversal.cpp
- 2_Boundary_Traversal.cpp
- 3_Vertical_Order_Traversal.cpp
- 4_Top_View.cpp
- 5_Bottom_View.cpp
- 6_Left_View.cpp
- 7_Right_View.cpp
- 8_Diagonal_Traversal.cpp
- BinaryTree.h
- README.md
- 1_Binary_Search_Tree_Implementation.cpp
- 2_BST_Traversals.cpp
- 3_Search_In_BST.cpp
- 4_Min_Max_Of_BST.cpp
- 5_Deletion_In_BST.cpp
- README.md
- 1_Validate_BST.cpp
- 2_Kth_Smallest_In_BST.cpp
- 3_KthSmallest_By_Morris_Traversal.cpp
- 4_Kth_Largest_In_BST.cpp
- 5_Inorder_Predecessor_Successor.cpp
- 6_LCA_In_BST.cpp
- BST.h
- README.md
- tempCodeRunnerFile.cpp
- 1_Two_Sum_In_BST.cpp
- 2_Flatten_BST_To_Sorted_List.cpp
- 3_Normal_BST_To_Balanced_BST.cpp
- 4_Preorder_To_BST.cpp
- BST.h
- README.md
- 1_Merge2BST_Inorder.cpp
- 2_Merge2BST_LinkedList.cpp
- BST.h
- README.md
- 1_Max_BST_In_Binary_Tree.cpp
- BST.h
- 1_Heap_Introduction.cpp
- 2_Build_Min_Heap.cpp
- 3_Heap_Sort.cpp
- 4_Max_Heap_By_Priority_Queue.cpp
- 5_Min_Heap_By_Priority_Queue.cpp
- README.md
- 1_Kth_Smallest_Element.cpp
- 2_Kth_Largest_Element.cpp
- 3_Is_Binary_Tree_Heap.cpp
- 4_Merge_2_MaxHeaps.cpp
- 5_Minimum_Cost_Of_Ropes.cpp
- 6_BST_To_Min_Heap.cpp
- README.MD
- Tree.h
- 1_Kth_Largest_Sum_Of_Subarrays.cpp
- 2_Merge_K_Sorted_Arrays.cpp
- 3_Merge_K_Sorted_List.cpp
- README.md
- 1_Smallest_Range_In_K_List.cpp
- 2_Median_In_A_Stream.cpp
- README.md
- 1_Unordered_Map.cpp
- 2_Maximum_Frequency_Number.cpp
- README.md
- 1_Trie_Intro.cpp
- README.md
- 1_Longest_Common_Prefix_By_Comparisons.cpp
- 2_Longest_Common_Prefix_By_Tries.cpp
- README.md
- 1_Phone_Directory.cpp
- README.md
- 1_Rat_In_A_Maze.cpp
- README.md
- 1_N_Queens.cpp
- 2_N_Queens_HashMap.cpp
- README.md
- 1_Valid_Suduko.cpp
- README.md
- 1_Adjacency_List.cpp
- 2_Adjacency_List_General.cpp
- 3_Adjacency_Matrix.cpp
- 4_Create_Graph_And_Print_It.cpp
- README.md
- 1_BFS_Traversal.cpp
- README.md
- 1_DFS_Traversal.cpp
- README.md
- 1_Cycle_Detection_In_Undirected_Graph_Using_BFS.cpp
- 2_Cycle_Detection_In_Undirected_Graph_Using_DFS.cpp
- README.md
- 1_Cycle_Detection_In_Directed_Graph.cpp
- README.md
- 1_Topological_Sort_Using_DFS.cpp
- README.md
- 1_Topological_Sort_Using_Kahns_Algorithm.cpp
- README.md
- 1_Detect_Cycle_In_A_Directed_Graph.cpp
- README.md
- 1_Shortest_Path_In_Undirected_Graph.cpp
- README.md
- 1_Shortest_Path_In_Directed_Acyclic_Graph.cpp
- 2_Shortest_Path_In_DAG_Using_Graph_Class.cpp
- README.md
- 1_Shortest_Path_Using_Dijkstras_Algorithm.cpp
- README.md
- 1_Prims_MST.cpp
- README.md
- 1_Disjoint_Set.cpp
- 2_Kruskals_MST.cpp
- README.md
- 1_Bridges_In_Graph.cpp
- README.md
- 1_Articulation_Point_In_Graph.cpp
- README.md
- 1_Kosaraju_Algorithm.cpp
- README.md
- 1_Bellmon_Ford_Algorithm.cpp
- README.md
- 1_Fibonacci_Series.cpp
- README.md
- 1_Climbing_Stairs.cpp
- 2_Min_Cost_Climbing_Stairs.cpp
- README.md
- 1_Minimum_Elements.cpp
- README.md
- 1_Max_Non_Adjacent_Sum.cpp
- README.md
- 1_House_Robber_Problem.cpp
- README.md
- 1_Cut_Rod_Into_Segments.cpp
- README.md
- jafs.cpp
- README.md
- streak.txt
// repository documentation
Was this content helpful?
(0 ratings)