The-Complete-FAANG-Preparation
Dive into this repository, a comprehensive resource covering Data Structures, Algorithms, 450 DSA by Love Babbar, Striver DSA sheet, Apna College DSA Sheet, and FAANG Questions! π That's not all! We've got Technical Subjects like Operating Systems, DBMS, SQL, Computer Networks, and Object-Oriented Programming, all waiting for you.
File Explorer
Download Latest Version (.zip)Showing a partial file list β download the zip above to see everything.
- bug_report.md
- codeql-analysis.yml
- FUNDING.yml
- PULL_REQUEST_TEMPLATE.md
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- C_MCQs.md
- Add Contents.txt
- C++_MCQs.md
- Add Contents.txt
- Python_MCQs.md
- Add Contents.txt
- Java_MCQs.md
- Add Contents.txt
- OOP_MCQs.md
- OS_MCQs.md
- DBMS_MCQs.md
- SQL_MCQs.md
- CN_MCQs.md
- Add Contents.txt
- Readme.md
- _001)_Search_Element.cpp
- _002)_Insert_Element.cpp
- _003)_Delete_Element.cpp
- _004)_Reverse_Array.cpp
- _005)_Left_Rotate_Array_by_1.cpp
- _006)_Left_Rotate_Array_by_d_(Time_dN).cpp
- _007)_Left_Rotate_Array_by_d_(Time_N).cpp
- _008)_Left_Rotate_Array_by_d_(Time_N).cpp
- _009)_Remove_Duplicates_from_a_sorted_array.cpp
- _010)_Remove_Duplicates_from_a_sorted_array.cpp
- _011)_Largest_Number.cpp
- _012)_Largest_Number.cpp
- _013)_Second_Largest_Number.cpp
- _014)_Second_Largest_Number.cpp
- _015)_Move_All_ZEROs_to_End.cpp
- _016)_Move_All_ZEROs_to_End.cpp
- _017)_Leaders_in_an_Array.cpp
- _018)_Leaders_in_an_Array.cpp
- _019)_Maximum_Difference.cpp
- _020)_Maximum_Difference.cpp
- _021)_Stock_Buy_and_Shell.cpp
- _022)_Stock_Buy_and_Shell.cpp
- _023)_Trapping_Rain_Water.cpp
- _024)_Trapping_Rain_Water.cpp
- _025)_Maximum_Consecutive_ONEs_in_binary_Array.cpp
- _026)_Maximum_Consecutive_ONEs_in_binary_Array.cpp
- _027)_Maximum_Subarray_Sum.cpp
- _028)_Maximum_Subarray_Sum.cpp
- _029)_Maximum_Circular_Subarray_Sum.cpp
- _030)_Maximum_Circular_Subarray_Sum.cpp
- _031)_Maximum_length_Even_Odd_Subarray.cpp
- _032)_Maximum_length_Even_Odd_Subarray.cpp
- _033)_Majority_Element.cpp
- _034)_Majority_Element.cpp
- _035)_Minimum_Group_flips_to_make_same.cpp
- _036)_Max_Sum_of_K_Consecutive_Element.cpp
- _037)_Max_Sum_of_K_Consecutive_Element.cpp
- _038)_Find_SubArray_of_Given_Sum.cpp
- _039)_Find_SubArray_of_Given_Sum.cpp
- _040)_Print_N_bonacci_Numbers.cpp
- _041)_GetSum_on_Given_Queries.cpp
- _042)_Find_Equilibrium_Point_in_an_Array.cpp
- _043)_Find_Equilibrium_Point_in_an_Array.cpp
- _044)_In_Two_Array_Find_Max_Occuring_Element.cpp
- _045)_sum_of_three_element_is_K.cpp
- _046)_3Sum.cpp
- _047)_4Sum.cpp
- _048)_Jump-Game.cpp
- _049)_Remove-Duplicates-From-Sorted-Array.cpp
- _050)_Reverse-Integer.cpp
- _051)_Set-Matrix-Zeros.cpp
- _052)_Two-Sum.cpp
- _001)_Search_Element.dart
- _002)_Insert_Element.dart
- _003)_Delete_Element.dart
- _004)_Reverse_Array.dart
- _005)_Left_Rotate_Array_by_1.dart
- _006)_Left_Rotate_Array_by_d_(Time_dN).dart
- _007)_Left_Rotate_Array_by_d_(Time_N).dart
- _008)_Left_Rotate_Array_by_d_(Time_N).dart
- _009)_Right_Rotate_Array_by_d_(Time_N).dart
- _010)_Remove_Duplicates_from_a_sorted_array.dart
- _011)_Largest_Number.dart
- _013)_Second_Largest_Number.dart
- _014)_Second_Largest_Number.dart
- _015)_Move_All_ZEROs_to_End.dart
- _016)_Move_All_ZEROs_to_End.dart
- _017)_Leaders_in_an_Array.dart
- _018)_Leaders_in_an_Array.dart
- _019)_Maximum_Difference.dart
- _020)_Maximum_Difference.dart
- _021)_Stock_Buy_and_Sell.dart
- _022)_Stock_Buy_and_Sell.dart
- _023)_Trapping_Rain_Water.dart
- _024)_Trapping_Rain_Water.dart
- _025)_Maximum_Consecutive_ONEs_in_binary_Array.dart
- _026)_Maximum_Consecutive_ONEs_in_binary_Array.dart
- _027)_Maximum_Subarray_Sum.dart
- _028)_Maximum_Subarray_Sum.dart
- _029)_Maximum_Circular_Subarray_Sum.dart
- _030)_Maximum_Circular_Subarray_Sum.dart
- _031)_Maximum_length_Even_Odd_Subarray.dart
- _032)_Maximum_length_Even_Odd_Subarray.dart
- _033)_Majority_Element_in_Array.dart
- _034)_Majority_Element_in_Array.dart
- _035)_Minimum_Group_flips_to_make_same.dart
- _036)_Max_Sum_of_K_Consecutive_Element.dart
- _037)_Max_Sum_of_K_Consecutive_Element.dart
- _038)_Find_SubArray_of_Given_Sum.dart
- _039)_Find_SubArray_of_Given_Sum.dart
- _040)_Print_N_bonacci_Numbers.dart
- _041)_Get_Sum_on_Given_Queries.dart
- _042)_Find_Equilibrium_Point_in_an_Array.dart
- _043)_Find_Equilibrium_Point_in_an_Array.dart
- _044)_In_Two_Array_Find_Max_Occuring_Element.dart
- _046)_Flat_Nested_Array.dart
- _047)_Sort_Zero_One_Two.dart
- _048)_Intersection_of_Arrays.dart
- _45)_sum_of_three_element_is_K.dart
- _01)_Basic_Array.java
- _02)_Reverse_Array.java
- _03)_Duplicate_Array.java
- _04)_Copy_Array.java
- _06)_four_sum_problem.java
- _07)_Valid_Triangle.java
- Contigously_Increasing_Numbers.java
- _001)_Search_Element.js
- _002)_Insert_Element.js
- _003)_Delete_Element.js
- _004)_Reverse_Array.js
- _005)_Left_Rotate_Array_by_1.js
- _006)_Left_Rotate_Array_by_d_(Time_dN).js
- _007)_Left_Rotate_Array_by_d_(Time_N).js
- _008)_Left_Rotate_Array_by_d_(Time_N).js
- _009)_Remove_Duplicates_from_a_sorted_array.js
- _010)_Remove_Duplicates_from_a_sorted_array.js
- _011)_Largest_Number.js
- _012)_Largest_Number.js
- _013)_Second_Largest_Number.js
- _014)_Second_Largest_Number.js
- _015)_Move_All_ZEROs_to_End.js
- _016)_Move_All_ZEROs_to_End.js
- _017)_Leaders_in_an_Array.js
- _018)_Leaders_in_an_Array.js
- _019)_Maximum_Difference.js
- _020)_Maximum_Difference.js
- _021_i_)_Best_Time_to_Buy_and_Sell_Stock.js
- _021_ii_)_Best_Time_to_Buy_and_Sell_Stock.js
- _021_iii_)_Best_Time_to_Buy_and_Sell_Stock.js
- _001)_Search_Element.py
- _002)_Insert_Element.py
- _003)_Delete_Element.py
- _004)_Reverse_Array.py
- _005)_Left_Rotate_Array_by_1.py
- _006)_Left_Rotate_Array_by_d_places.py
- _007)_Right_Rotate_Array_by_d_places.py
- count_hills&valleys.py
- _001)_Search_Element.rs
- Readme.md
- _01)_Print_Snack_Pattern.cpp
- _02)_Print_Boundry_Element.cpp
- _03)_Transpose_of_Matrix.cpp
- _04)_Transpose_of_Matrix.cpp
- _05)_Rotate_Matrix_by_90_Degree.cpp
- _06)_Rotate_Matrix_by_90_Degree.cpp
- _07)_Spiral_Traversal_of_Matrix.cpp
- _08)_Search_in_RowWise_and_ColumnWise.cpp
- _09)_Search_in_RowWise_and_ColumnWise.cpp
- _01)_Multi_Dim_Array.java
- _02)_Adding_Multi_Dim_Array.java
- _01)_Print_Snake_Pattern.py
- _03)_Transposing_Matrix.py
- _1)_Print_Subset_Strings.cpp
- _2)_Rod_Cutting.cpp
- _3)_Sum_of_Digits.cpp
- _4)_Tower_of_Hanoi.cpp
- _5)_Josephus_Problem.cpp
- _6)_Subset_Sum_Problem.cpp
- _7)_Generate_Parentheses.cpp
- _8)_Rat In A Maze.cpp
- _9)_Distinct Occurences.cpp
- Add Contents.txt
- Add Contents.txt
- Binary_Number.py
- Climbing_Stairs.py
- Count_Digits.py
- factorial.py
- Fibonacci_Series.py
- GCD.py
- palindrome_(i).py
- palindrome_(ii).py
- Pow(x,n).py
- Reverse_String.py
- Search_In_A_Binary_Search_Tree.py
- Symmetric_Tree.py
- _01)_Longest-Common-prefix.cpp
- Add Contents.txt
- Add Contents.txt
- Anagram.java
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- HashMap.java
- Add Contents.txt
- _01)_Create_Insert_Delete_Search_Display_Operations_in_Listed_List.c
- _01)_Insert_At_Beginning_Of_LinkedList.cpp
- _02)_Insert_At_End_Of_LinkedList.cpp
- _03)_Delete-Node-in-Linked-List.cpp
- _04)_Intersection-Of-Two-Linked-List.cpp
- _05)_Insert_At_A_Given_Position_Of_LinkedLIst.cpp
- _06)_Add-Two-Numbers.cpp
- _07)_Middle-of-the-Linked-List.cpp
- _08)_Reverse-Linked-List.cpp
- _09)_SortList.cpp
- Add Contents.txt
- _01)_Insert_At_Beginning _Of_LinkedList.java
- _02)_Insert_At_End_End_Of_LinkedLIst.java
- _03)_Delete_From_Beginning_Of_LinkedList.java
- _04)_Delete_From_End_Of_LinkedList.java
- _05)_Insert_At_A_Given_Position_In_LinkedList.java
- _06)i)_Search_In_LinkedList_(Iterative).java
- _06)ii)_Search_In_LinkedList_(Recursive).java
- _07)_Middle_Of_LinkedList.java
- _08)i)_Nth_Node_From_End_Of_LinkedList_(Using length of Linked List).java
- _08)ii)_Nth_Node_From_End_Of_LinkedList_(Using 2 pointers).java
- _09)i)_Reverse_LinkedList_(Iterative).java
- _09)ii)a)_Reverse_LinkedList_(Recursive-Method1).java
- _09)ii)b)_Reverse_LinkedList_(Recursive-Method2).java
- _10)_Remove_Duplicates_From_Sorted_linkedList.java
- _11)i)_Reverse_LinkedList_In_Groups_Of_K_(Iterative).java
- _11)ii)_Reverse_LinkedList_In_Groups_Of_K_(Recursive).java
- _12)i)_Detect_Loop_(Using Pointers).java
- _12)ii)_Detect_Loop_(Using Hashing).java
- _13)_Detect_And_Remove_Loop_In_LinkedList.java
- _14)_Delete_Node_With_Given_Pointer_In_LinkedList.java
- _15)i)_Intersection_Point_Of_2_LinkedLists_(Using Hashing).java
- _15)ii)_Intersection_Point_Of_2_LinkedLists_(Using Difference of Lengths).java
- _16)_Merge_2_LinkedLists.java
- Add Contents.txt
- Add Contents.txt
- addition.py
- compare_strings.py
- count_rotations.py
- DeleteMiddleNode.py
- deletion.py
- insert_whole_LL_at_k.py
- insertion.py
- OddEvenLL.py
- Rotate_LinkedList.py
- swap_nodes.py
- _001)_Palindrome_Checking.c
- _01)_InsertFront_DoublyLinkedList.cpp
- _02)_InsertAfterGivenNode_DoublyLInkedList.cpp
- _03)_InsertEnd_DoublyLinkedList.cpp
- Add Contents.txt
- Add Contents.txt
- DoubleLinkedList.java
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- CircularLinkedList.java
- Add Contents.txt
- check_circular_linkedlist.py
- _01)_The Stock Span Problem.cpp
- _02)_paranthesis.cpp
- _03)_stack_using_2_queue_costly_pop_approach.cpp
- _04)_stack_using_2_queue_costly_push_approach.cpp
- _05)_basics_of_array_imple_of_stack.cpp
- _06)_reverse_sentence_using_stack.cpp
- _07)_reverse_stack.cpp
- _08)_infix_to_postfix_using_stack.cpp
- _09)_postfix_expr_eval_using_stack.cpp
- _10)_prefix_expr_eval_using_stack.cpp
- Add Contents.txt
- Add Contents.txt
- Stacks.java
- Add Contents.txt
- _01)_implementation_of_queue_using_linked_list.cpp
- _02)_implementation_of_queue_using_single_stack.cpp
- _03)_queue_implem_using_2_stack_costly_pop_approach.cpp
- Add Contents.txt
- Add Contents.txt
- Queues.java
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Dequeue.java
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- BinaryTree.java
- N_ary.java
- Add Contents.txt
- Binary_Tree_Height.py
- Binary_Tree_Level_Order_Traversal_(i).py
- Binary_Tree_Level_Order_Traversal_(ii).py
- Binary_Tree_Level_Order_Traversal_(iii).py
- Binary_Tree_Traversal_(i).py
- Binary_Tree_Traversal_(ii).py
- Path_Sum.py
- Symmetric_Tree_(i).py
- Symmetric_Tree_(ii).py
- _01)_Bottom_View_of_Binary_Tree.cpp
- _02)_Ceilingin_BST.cpp
- _03)_Check_For_BST.cpp
- _04)_Fix_BST_with_Two_Nodes_Swapped.cpp
- _05)_Kth_Largest.cpp
- _06)_PairSum.cpp
- _07)_Top_View_of_Binary_Tree.cpp
- _08)_Vertical_Sum_of_Binary_Tree.cpp
- _09)_Vertical_Traversal_of_Binary_Tree.cpp
- _10)_Delete-Node-in-a-BST.cpp
- _11)_Insert-in-BST.cpp
- _12)_LCA-of-a-BST.cpp
- _13)_Search-in-BST.cpp
- Add Contents.txt
- BinarySearchTree.java
- Add Contents.txt
- Validate_Binary_Search_Tree.py
- Add Contents.txt
- Add Contents.txt
- Heap.java
- Add Contents.txt
- Heap.ts
- Add Contents.txt
- Add Contents.txt
- Graph.java
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Trie.java
- Add Contents.txt
- Insert_search_&_delete.py
- Trie.ts
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Readme.md
- 01) Binary Search.cpp
- Add Contents.txt
- BFS.java
- BinarSearch.java
- DepthFirstSearch.java
- 01) Binary Search.py
- 02) Recursive Binary Search.py
- 03) Jump Search.py
- 04) Interpolation Search.py
- 05) Exponential Search.py
- 06) Fibonacci Search.py
- Searching_Algorithms_Explanations.md
- _1)_Merge Sort On 2 Linked Lists.cpp
- _2)_Heap_Sort.cpp
- _3_)_Bubble_Sort.cpp
- _4_)_Insertion_Sort.cpp
- _5_)_Selection_Sort.cpp
- Add Contents.txt
- BubbleSort.java
- InsertionSort.java
- MergeSort.java
- QuickSort.java
- SelectionSort.java
- Add Contents.txt
- Bubble_Sort.py
- Count_Sort.py
- Insertion_Sort.py
- Merge_Sort.py
- Selection_Sort.py
- Sorting_Algorithm_Explainations.md
- _001)_Find_ith_bit.cpp
- _002)_Replace_Bits.cpp
- _003)_Decimal_to_Binary.cpp
- _004)_Clear_ith_bit.cpp
- _005)_If_A_Number_Is_Power_Of_Two.cpp
- _006)_Position_Of_Only_Set_Bit.cpp
- _007)_Two_Non_Repeating_Elements.cpp
- _008_i_)_Count_Set_Bits_In_An_Integer.cpp
- _008_ii_)_Count_Set_Bits_In_An_Integer.cpp
- _008_iii_)_Count_Set_Bits_In_An_Integer.cpp
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- DijkstraAlgorithm.java
- PrimsAlgorithm.java
- Add Contents.txt
- Dijkstra's Algorithm.py
- Kruskalβs Minimum Spanning Tree Algorithm.py
- _1)_Minimum Steps to reach the end.cpp
- _2)_.Frog Jump-1.cpp
- _3)_Number of Coins.cpp
- _4)_Wines Problem Top Down dp.cpp
- _5)_Ladders Problem Bottom up dp.cpp
- _6)_Box Stacking Problem.cpp
- _7)_Friends pairing problem bottom up.cpp
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Readme.md
- _1)_Sudoku Solver.cpp
- Add Contents.txt
- Add Contents.txt
- N-Queens.py
- Rat_maze.py
- sudoku.py
- _01)_Reverse_String.cpp
- _02)_Max_Min_Element.cpp
- _03)_1_Kth_Max_Min_Element.cpp
- _03)_2_Kth_Max_Min_Element.cpp
- _04)_Sort_an_Array_012.cpp
- _05)_Move_All_Negative_Elements.cpp
- _06) Union_of_two_arrays.cpp
- _07)_Cyclically_rotate_an_array_by_one.cpp
- _08)_Kadane's_Algorithm.cpp
- _09)_Minimize_the_Height.cpp
- _10)_Minimum_number_of_jumps.cpp
- _11)_Find_the_Duplicate_Number.cpp
- _12)_Merge_Without_Extra_Space.cpp
- _13)_Kadanes_Algorithm.cpp
- _14)_Merge_Intervals.cpp
- _15)_Next_Permutation.cpp
- _16)_Count_Inversions.cpp
- _17)_Best_Time_to_Buy_and_Sell_Stock.cpp
- _18)_Count_pairs_with_given_sum.cpp
- _19)_Common_elements.cpp
- _20)_Rearrange_Array_in altenating_posotive_and_negative.cpp
- _21)_SubArray_with_0_Sum.cpp
- _22)_Factorial_of_Large_Numbers.cpp
- _23)_Maximum_Product_SubArray.cpp
- _24)_Largest_consecutive_SubArray.cpp
- _25)_Count_more_than_n-k_Occurences.cpp
- _26)_Maximum_Profit_buy_sell_almost_twice.cpp
- _27)_Array_Subset_of_Another_Array.cpp
- _28)_Triplet_Sum_in_Array.cpp
- _29)_Trapping_Rain_Water.cpp
- _30)_Chocolate_Distribution_Problem.cpp
- _31)_Smallest_SubArray_with_Sum_Greater_than_x.cpp
- _32)_Three_way_partitioning.cpp
- _33)_Minimum_Swaps_and_K_together.cpp
- _34)_Palindromic_Array.cpp
- _35)_Find_the _Median.cpp
- _36)_Median_of_two_Sorted_Arrays_of_Different_Size.cpp
- _01)_Spirally_traversing_a_matrix.cpp
- _02)_1)_Search_a_2D_Matrix.cpp
- _02)_2)_Search_a_2D_Matrix.cpp
- _03)_Median_in_a_row_wise_sorted_Matrix.cpp
- _04)_Row_with_max_1s.cpp
- _05)_Sorted_matrix.cpp
- _06)_Max_Rectangle.cpp
- _07)_Find_a_Specific_Pair_in_Matrix.cpp
- _08)_Rotate_a_Matrix_by_90_Degree_in_Clockwise_without_Extra_Space.cpp
- _09)_Kth_element_in_Matrix.cpp
- _10)_Common_elements_in_all_rows_of_matrix.cpp
- _01)_0_Reverse_String.cpp
- _01)_1_Reverse_a_String.cpp
- _02)_Palindrome_String.cpp
- _03)_Print_all_Duplicates_String.cpp
- _05)_Check_String_are_Rotations_of_Each_Other.cpp
- _06)_Check_String_is_valid_Suffle_of_two_different_Strings.cpp
- _01)_First_and_Last_Position_of_an_Element.cpp
- _02)_find_fixed_point(value equals to index).cpp
- _03)_Search_in_Rotated_Sorted_Array.cpp
- _04)_Count_Squares.cpp
- _05)_Middle-of_Three.cpp
- _07)_Find_Missing_And_Repeating.cpp
- _08)_Majority_Element.cpp
- _10)_Find_Pair_Given_Difference.cpp
- _11)_Find_All_Four_Sum_Numbers.cpp
- _12)_Stickler_Thief.cpp
- _13)_Count_triplets_with_sum_smaller_than_X.cpp
- _14)_Merge_Without_Extra_Space.cpp
- _15)_Zero_Sum_Subarrays.cpp
- _16)_Product_array_puzzle.cpp
- _17)_Sort_by_Set_Bit_Count.cpp
- _18)_Minimum_Swaps_to_Sort.cpp
- _22)_Find_pivot_element_in_a_sorted_array.cpp
- Add Contents.txt
- 01)_i_Write_a_Program_to_reverse_the_Linked_List.[Iterative_Solution].cpp
- 01)_ii_Write_a_Program_to_reverse_the_Linked_List.cpp
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- _01)_Construct_a_trie_from_scratch.cpp
- _03)_Word_Break_Problem_(Trie solution).cpp
- Add Contents.txt
- _07)_Edit_Distance.cpp
- _14)_Longest_Common_Subsequence.cpp
- _35)_LargestSum_Contiguous_Subarray.cpp
- Add Contents.txt
- _01)_Number_of_1_Bits.cpp
- _02)_Non_Repeating_Numbers.cpp
- _03)_Bit_Difference.cpp
- _04)_Count_total_set_bits.cpp
- _05)_Power_of_2.cpp
- _06)_Find_position_of_set_bit.cpp
- Add Contents.txt
- _01)_Reverse_String.java
- _02)_Max_Min_Element.java
- _03)_kth_max_min.java
- _04)_Sort_an_Array_012.java
- _05)_MOve_all_neg_elements.java
- _06)_Union_intersection_ofSorted_Arrays.java
- _07)_rotate_array_by one.java
- _08)_Largest_sum_contiguous_subarray.java
- _10)_min_jumps_to_reach_end.java
- Add Contents.txt
- _06)_Check_String_is_valid_Suffle_of_two_different_Strings.java
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- _01)_0_Count_SetBit.java
- _01)_1_Count_SetBits.java
- _02)_0_Non_Repeating_Elements.java
- _02)_1_Non_Repeating_Elements.java
- _03)_Bits_To_Flip.java
- _04)_0_Total_SetBits_in_Range.java
- _04)_1_Total_SetBits_in_Range.java
- _04)_2_Total_SetBits_in_Range.java
- _05)_Power_Of_2_or_Not.java
- _06)_Position_Of_Only_SetBit.java
- _07)_0_Copy_SetBits_From_X_to_Y.java
- _07)_1_Copy_SetBits_From_X_to_Y.java
- _08)_Division.java
- _09)_Square_Of_a_Number.java
- _10)_0_Power_Set.java
- _10)_1_Power_Set.java
- 01_)_Reverse_Array.py
- 02_)_Max_Min_Element.py
- 03_)_Kth_Max_Min_Element.py
- 04_i_)_Sort012.py
- 04_ii_)_Sort0123.py
- 05_i_)_Move_All_Negative_Element_To_Front.py
- 05_ii_)_Move_All_Negative_Element_To_Front.py
- 06_)_Union_Of_Two_Array.py
- 07_)_Cyclically_Rotate_An_Array_By_One.py
- 08_i_)_Kadane's_Algorithm.py
- 08_ii_)_Kadane's_Algorithm.py
- 09_)_Minimize_The_Height.py
- 14_Merge_Intervals.py
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Readme.md
- 1]. Set Matrix Zeros.cpp
- 2]. Pascalβs Triangle.cpp
- 3]. Next Permutation.cpp
- 4]. Kadaneβs Algorithm.cpp
- 5]. Sort an array of 0βs 1βs 2βs.cpp
- 6]. Stock buy and Sell.cpp
- 1]. Set Matrix Zeros.cpp
- 2]. Pascalβs Triangle.cpp
- 3]. Next Permutation.cpp
- 4]. Kadaneβs Algorithm.cpp
- 5]. Sort an array of 0βs 1βs 2βs.cpp
- 6]. Stock buy and Sell.cpp
- 1]. Set Matrix Zeros.cpp
- 2]. Pascalβs Triangle.cpp
- 3]. Next Permutation.cpp
- 4]. Kadaneβs Algorithm.cpp
- 5]. Sort an array of 0βs 1βs 2βs.cpp
- 6]. Stock buy and Sell.cpp
- 1]. Rotate Matrix.cpp
- 2]. Merge Overlapping Subintervals.cpp
- 3]. Merge two sorted Arrays without extra space.cpp
- 4]. Find the duplicate in an array of N+1 integers.cpp
- 5]. Repeat and Missing Number.cpp
- 6]. Count Inversions.cpp
- 5]. Repeat and Missing Number.cpp
- 1]. Rotate Matrix.cpp
- 2]. Merge Overlapping Subintervals.cpp
- 3]. Merge two sorted Arrays without extra space.cpp
- 4]. Find the duplicate in an array of N+1 integers.cpp
- 1]. Search in a 2d Matrix.cpp
- 2]. Pow(X,n).cpp
- 3]. Majority Element (N-2 times).cpp
- 4]. Majority Element (N-3 times).cpp
- 5]. Grid Unique Paths.cpp
- 6]. Reverse Pairs.cpp
- 1]. Search in a 2d Matrix.cpp
- 2]. Pow(X,n).cpp
- 3]. Majority Element (N-2 times).cpp
- 4]. Majority Element (N-3 times).cpp
- 5]. Grid Unique Paths.cpp
- 6]. Reverse Pairs.cpp
- 1]. 2-Sum-Problem.cpp
- 2]. 4-sum-Problem.cpp
- 3]. Longest Consecutive Sequence.cpp
- 4]. Largest Subarray with 0 sum.cpp
- 5]. Count number of subarrays with given Xor K.cpp
- 6]. Longest Substring without repeat.cpp
- 4]. Largest Subarray with 0 sum.cpp
- 5]. Count number of subarrays with given Xor K.cpp
- 1]. 2-Sum-Problem.cpp
- 2]. 4-sum-Problem.cpp
- 3]. Longest Consecutive Sequence.cpp
- 6]. Longest Substring without repeat.cpp
- 1]. Reverse a LinkedList.cpp
- 2]. Find the middle of LinkedList.cpp
- 3]. Merge two sorted Linked List.cpp
- 4]. Remove N-th node from back of LinkedList.cpp
- 5]. Add two numbers as LinkedList.cpp
- 6]. Delete a given Node when a node is given.cpp
- 1]. Reverse a LinkedList.cpp
- 2]. Find the middle of LinkedList.cpp
- 3]. Merge two sorted Linked List.cpp
- 4]. Remove N-th node from back of LinkedList.cpp
- 5]. Add two numbers as LinkedList.cpp
- 6]. Delete a given Node when a node is given.cpp
- 1]. Find intersection point of Y LinkedList.cpp
- 2]. Detect a cycle in Linked List.cpp
- 3]. Reverse a LinkedList in groups of size k.cpp
- 4]. Check if a LinkedList is palindrome or not.cpp
- 5]. Find the starting point of the Loop of LinkedList.cpp
- 6]. Flattening of a LinkedList.cpp
- 6]. Flattening of a LinkedList.cpp
- 1]. Find intersection point of Y LinkedList.cpp
- 2]. Detect a cycle in Linked List.cpp
- 3]. Reverse a LinkedList in groups of size k.cpp
- 4]. Check if a LinkedList is palindrome or not.cpp
- 5]. Find the starting point of the Loop of LinkedList.cpp
- 1]. Rotate a LinkedList.cpp
- 2]. Clone a Linked List with random and next pointer.cpp
- 3]. 3 sum.cpp
- 4]. Trapping rainwater.cpp
- 5]. Remove Duplicate from Sorted array.cpp
- 6]. Max consecutive ones.cpp
- 1]. Rotate a LinkedList.cpp
- 2]. Clone a Linked List with random and next pointer.cpp
- 3]. 3 sum.cpp
- 4]. Trapping rainwater.cpp
- 5]. Remove Duplicate from Sorted array.cpp
- 6]. Max consecutive ones.cpp
- 1]. N meetings in one room.cpp
- 2]. Minimum number of platforms required for a railway.cpp
- 3]. Job sequencing Problem.cpp
- 4]. Fractional Knapsack Problem.cpp
- 5]. Greedy algorithm to find minimum number of coins.cpp
- 6]. Activity Selection.cpp
- 1]. N meetings in one room.cpp
- 2]. Minimum number of platforms required for a railway.cpp
- 3]. Job sequencing Problem.cpp
- 4]. Fractional Knapsack Problem.cpp
- 5]. Greedy algorithm to find minimum number of coins.cpp
- 6]. Activity Selection.cpp
- 1]. Subset Sums.cpp
- 2]. Subset-II.cpp
- 3]. Combination sum-1.cpp
- 4]. Combination sum-2.cpp
- 5]. Palindrome Partitioning.cpp
- 6]. K-th permutation Sequence.cpp
- 1]. Subset Sums.cpp
- 2]. Subset-II.cpp
- 3]. Combination sum-1.cpp
- 4]. Combination sum-2.cpp
- 5]. Palindrome Partitioning.cpp
- 6]. K-th permutation Sequence.cpp
- 1]. Print all permutations of a string-array.cpp
- 2]. N queens Problem.cpp
- 3]. Sudoku Solver.cpp
- 4]. M coloring Problem.cpp
- 5]. Rat in a Maze.cpp
- 6]. Word Break.cpp
- 4]. M coloring Problem.cpp
- 5]. Rat in a Maze.cpp
- 1]. Print all permutations of a string-array.cpp
- 2]. N queens Problem.cpp
- 3]. Sudoku Solver.cpp
- 1]. The N-th root of an integer.cpp
- 2]. Matrix Median.cpp
- 3]. Find the element that appears once in a sorted array, and the rest element appears twice.cpp
- 4]. Search element in a sorted and rotated array.cpp
- 5]. Median of 2 sorted arrays.cpp
- 6]. K-th element of two sorted arrays.cpp
- 7]. Allocate Minimum Number of Pages.cpp
- 8]. Aggressive Cows.cpp
- 6]. K-th element of two sorted arrays.cpp
- 2]. Matrix Median.cpp
- 7]. Allocate Minimum Number of Pages.cpp
- 3]. Find the element that appears once in a sorted array, and the rest element appears twice.cpp
- 4]. Search element in a sorted and rotated array.cpp
- 5]. Median of 2 sorted arrays.cpp
- 8]. Aggressive Cows.cpp
- 1]. Max heap, Min Heap Implementation.cpp
- 2]. Kth Largest Element.cpp
- 3]. Maximum Sum Combination.cpp
- 4]. Find Median from Data Stream.cpp
- 5]. Merge K sorted arrays.cpp
- 6]. K most frequent elements.cpp
- 3]. Maximum Sum Combination.cpp
- 2]. Kth Largest Element.cpp
- 4]. Find Median from Data Stream.cpp
- 6]. K most frequent elements.cpp
- 1]. Implement Stack Using Arrays.cpp
- 2]. Implement Queue Using Arrays.cpp
- 3]. Implement Stack using Queue.cpp
- 4]. Implement Queue using Stack.cpp
- 5]. Check for balanced parentheses.cpp
- 6]. Next Greater Element.cpp
- 7]. Sort a Stack.cpp
- 3]. Implement Stack using Queue.cpp
- 4]. Implement Queue using Stack.cpp
- 5]. Check for balanced parentheses.cpp
- 6]. Next Greater Element.cpp
- 10]. The Celebrity Problem.cpp
- 1]. Next Smaller Element.cpp
- 2]. LRU cache.cpp
- 3]. LFU Cache.cpp
- 4]. Largest rectangle in a histogram.cpp
- 5]. Sliding Window maximum.cpp
- 6]. Implement Min Stack.cpp
- 7]. Rotten Orange.cpp
- 8]. Stock Span Problem.cpp
- 9]. Find the maximum of minimums of every window size.cpp
- 1]. Next Smaller Element.cpp
- 2]. LRU cache.cpp
- 3]. LFU Cache.cpp
- 4]. Largest rectangle in a histogram.cpp
- 5]. Sliding Window maximum.cpp
- 6]. Implement Min Stack.cpp
- 7]. Rotten Orange.cpp
- 8]. Stock Span Problem.cpp
- 1]. Reverse Words in a String.cpp
- 2]. Longest Palindrome in a string.cpp
- 3]. Roman Number to Integer and vice versa.cpp
- 4]. Implement ATOI-STRSTR.cpp
- 5]. Longest Common Prefix.cpp
- 6]. Rabin Karp.cpp
- 1]. Reverse Words in a String.cpp
- 2]. Longest Palindrome in a string.cpp
- 3]. Roman Number to Integer and vice versa.cpp
- 4]. Implement ATOI-STRSTR.cpp
- 5]. Longest Common Prefix.cpp
- 6]. Rabin Karp.cpp
- 1]. Z-Function.cpp
- 2]. KMP algo - LPS(pi) array.cpp
- 3]. Minimum characters needed to be inserted in the beginning to make it palindromic.cpp
- 4]. Check for Anagrams.cpp
- 5]. Count and Say.cpp
- 6]. Compare version numbers.cpp
- 3]. Minimum characters needed to be inserted in the beginning to make it palindromic.cpp
- 1]. Z-Function.cpp
- 2]. KMP algo - LPS(pi) array.cpp
- 4]. Check for Anagrams.cpp
- 5]. Count and Say.cpp
- 6]. Compare version numbers.cpp
- 10]. Vertical order traversal.cpp
- 11]. Root to node path in a Binary Tree.cpp
- 12]. Max width of a Binary Tree.cpp
- 1]. Inorder Traversal.cpp
- 2]. Preorder Traversal.cpp
- 3]. Postorder Traversal.cpp
- 6]. LeftView Of Binary Tree.cpp
- 7]. Bottom View of Binary Tree.cpp
- 8]. Top View of Binary Tree.cpp
- 9]. Preorder inorder postorder in a single traversal.cpp
- 6]. LeftView Of Binary Tree.cpp
- 7]. Bottom View of Binary Tree.cpp
- 8]. Top View of Binary Tree.cpp
- 11]. Root to node path in a Binary Tree.cpp
- 10]. Vertical order traversal.cpp
- 12]. Max width of a Binary Tree.cpp
- 1]. Inorder Traversal.cpp
- 2]. Preorder Traversal.cpp
- 3]. Postorder Traversal.cpp
- 4]. Morris Inorder Traversal.cpp
- 5]. Morris Preorder Traversal.cpp
- 1]. Level order Traversal.cpp
- 2]. Height of a Binary Tree.cpp
- 3]. Diameter of Binary Tree.cpp
- 4]. Check if the Binary tree is height-balanced or not.cpp
- 5]. LCA in Binary Tree.cpp
- 6]. Check if two trees are identical or not.cpp
- 7]. Zig Zag Traversal of Binary Tree.cpp
- 8]. Boundary Traversal of Binary Tree.cpp
- 1]. Level order Traversal.cpp
- 2]. Height of a Binary Tree.cpp
- 3]. Diameter of Binary Tree.cpp
- 4]. Check if the Binary tree is height-balanced or not.cpp
- 5]. LCA in Binary Tree.cpp
- 6]. Check if two trees are identical or not.cpp
- 7]. Zig Zag Traversal of Binary Tree.cpp
- 1]. Maximum path sum.cpp
- 2]. Construct Binary Tree from inorder and preorder.cpp
- 3]. Construct Binary Tree from Inorder and Postorder.cpp
- 4]. Symmetric Binary Tree.cpp
- 5]. Flatten Binary Tree to LinkedList.cpp
- 6]. Check if Binary Tree is the mirror of itself or not.cpp
- 7]. Check for Children Sum Property.cpp
- 6]. Check if Binary Tree is the mirror of itself or not.cpp
- 1]. Maximum path sum.cpp
- 2]. Construct Binary Tree from inorder and preorder.cpp
- 3]. Construct Binary Tree from Inorder and Postorder.cpp
- 4]. Symmetric Binary Tree.cpp
- 5]. Flatten Binary Tree to LinkedList.cpp
- 1]. Populate Next Right pointers of Tree.cpp
- 2]. Search given Key in BST.cpp
- 3]. Construct BST from given keys.cpp
- 4]. Construct BST from preorder traversal.cpp
- 5]. Check is a BT is BST or not.cpp
- 6]. Find LCA of two nodes in BST.cpp
- 7]. Find the inorder predecessor.cpp
- 7]. Find the inorder predecessor.cpp
- 1]. Populate Next Right pointers of Tree.cpp
- 2]. Search given Key in BST.cpp
- 3]. Construct BST from given keys.cpp
- 4]. Construct BST from preorder traversal.cpp
- 5]. Check is a BT is BST or not.cpp
- 6]. Find LCA of two nodes in BST.cpp
- 1]. Floor in a BST.cpp
- 2]. Ceil in a BST.cpp
- 3]. Find K-th smallest element in BST.cpp
- 4]. Find K-th largest element in BST.cpp
- 5]. Find a pair with a given sum in BST.cpp
- 6]. BST iterator.cpp
- 7]. Size of the largest BST in a Binary Tree.cpp
- 8]. Serialize and deserialize Binary Tree.cpp
- 4]. Find K-th largest element in BST.cpp
- 3]. Find K-th smallest element in BST.cpp
- 5]. Find a pair with a given sum in BST.cpp
- 6]. BST iterator.cpp
- 7]. Size of the largest BST in a Binary Tree.cpp
- 8]. Serialize and deserialize Binary Tree.cpp
- 1]. Binary Tree to Double Linked List.cpp
- 2]. Find median in a stream of running integers.cpp
- 3]. K-th largest element in a stream.cpp
- 4]. Distinct numbers in Window.cpp
- 5]. K-th largest element in an unsorted array.cpp
- 6]. Flood-fill Algorithm.cpp
- 4]. Distinct numbers in Window.cpp
- 1]. Binary Tree to Double Linked List.cpp
- 2]. Find median in a stream of running integers.cpp
- 3]. K-th largest element in a stream.cpp
- 5]. K-th largest element in an unsorted array.cpp
- 6]. Flood-fill Algorithm.cpp
- 01]. Clone a graph.cpp
- 02]. DFS.cpp
- 03]. BFS.cpp
- 04]. Detect A cycle in Undirected Graph using BFS.cpp
- 05]. Detect A cycle in Undirected Graph using DFS.cpp
- 06]. Detect A cycle in a Directed Graph using DFS.cpp
- 07]. Detect A cycle in a Directed Graph using BFS.cpp
- 08]. Topological Sort BFS.cpp
- 09]. Topological Sort DFS.cpp
- 10]. Number of islands.cpp
- 11]. Bipartite Check using BFS.cpp
- 12]. Bipartite Check using DFS.cpp
- 2]. DFS.cpp
- 3]. BFS.cpp
- 8]. Topological Sort BFS.cpp
- 9]. Topological Sort DFS.cpp
- 01]. Clone a graph.cpp
- 04]. Detect A cycle in Undirected Graph using BFS.cpp
- 05]. Detect A cycle in Undirected Graph using DFS.cpp
- 06]. Detect A cycle in a Directed Graph using DFS.cpp
- 07]. Detect A cycle in a Directed Graph using BFS.cpp
- 10]. Number of islands.cpp
- 11]. Bipartite Check using BFS.cpp
- 12]. Bipartite Check using DFS.cpp
- 1]. Strongly Connected Component.cpp
- 2]. Dijkstraβs Algorithm.cpp
- 3]. Bellman-Ford Algo.cpp
- 4]. Floyd Warshall Algorithm.cpp
- 5]. MST using Primβs Algo.cpp
- 6]. MST using Kruskalβs Algo.cpp
- 2]. Dijkstraβs Algorithm.cpp
- 3]. Bellman-Ford Algo.cpp
- 4]. Floyd Warshall Algorithm.cpp
- 5]. MST using Primβs Algo.cpp
- 6]. MST using Kruskalβs Algo.cpp
- 1]. Strongly Connected Component.cpp
- 1]. Max Product Subarray.cpp
- 2]. Longest Increasing Subsequence.cpp
- 3]. Longest Common Subsequence.cpp
- 4]. 0-1 Knapsack.cpp
- 5]. Edit Distance.cpp
- 6]. Maximum sum increasing subsequence.cpp
- 7]. Matrix Chain Multiplication.cpp
- 6]. Maximum sum increasing subsequence.cpp
- 7]. Matrix Chain Multiplication.cpp
- 1]. Max Product Subarray.cpp
- 2]. Longest Increasing Subsequence.cpp
- 3]. Longest Common Subsequence.cpp
- 4]. 0-1 Knapsack.cpp
- 5]. Edit Distance.cpp
- 1]. Minimum sum path in the matrix.cpp
- 2]. Coin change.cpp
- 3]. Subset Sum.cpp
- 4]. Rod Cutting.cpp
- 5]. Egg Dropping.cpp
- 6]. Word Break.cpp
- 7]. Palindrome Partitioning.cpp
- 8]. Maximum profit in Job scheduling.cpp
- 5]. Egg Dropping.cpp
- 6]. Word Break.cpp
- 7]. Palindrome Partitioning.cpp
- 8]. Maximum profit in Job scheduling.cpp
- 1]. Minimum sum path in the matrix.cpp
- 2]. Coin change.cpp
- 3]. Subset Sum.cpp
- 4]. Rod Cutting.cpp
- 1]. Implement Trie (Prefix Tree).cpp
- 2]. Implement Trie-2 (Prefix Tree).cpp
- 3]. Longest String with All Prefixes.cpp
- 4]. Count Distinct Substrings in a String.cpp
- 4]. Number of Distinct Substrings in a String.cpp
- 5]. Power Set.cpp
- 6]. Maximum XOR of two numbers in an array.cpp
- 7]. Maximum XOR With an Element From Array.cpp
- 5]. Power Set.cpp
- 1]. Implement Trie (Prefix Tree).cpp
- 6]. Maximum XOR of two numbers in an array.cpp
- 7]. Maximum XOR With an Element From Array.cpp
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Readme.md
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Readme.md
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Add Context.txt
- Readme.md
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Practice Questions - Arrays .pdf
- Solutions for Practice Qs - Arrays.pdf
- Add Contents.txt
- Practice Questions - Strings.pdf
- Solution for Practice Qs - Strings.pdf
- Add Contents.txt
- Practice Questions - 2D Array.pdf
- Solutions for Practice Qs - 2D Array.pdf
- Add Contents.txt
- Practice Questions - Basic Sorting Algorithm.pdf
- Solutions for Practice Qs - Basic Sorting Algorithm.pdf
- Add Contents.txt
- Practice Questions - Backtracking.pdf
- Solution for Practice Qs - Backtracking.pdf
- Add Contents.txt
- Practice Questions - Linked List.pdf
- Reading Material (Circular LInked List).pdf
- Solution for Practice Qs - Linked List.pdf
- Add Contents.txt
- Practice Questions - Queues.pdf
- Practice Questions - Stacks.pdf
- Solutions for Practice Qs - Queues.pdf
- Solutions for Practice Qs - Stacks.pdf
- Add Contents.txt
- Practice Questions - Greedy Algorithms.pdf
- Reading Material - Comparatos In Java.pdf
- Solutions for Practice Qs - Greedy Algorithms.pdf
- Add Contents.txt
- Practice Questions - Binary Tree.pdf
- Solutions for Practice Qs - Binary Tree.pdf
- Add Contents.txt
- Practice Questions - BST.pdf
- Reading Material(AVL Trees).pdf
- Reading Material(Red Black Trees).pdf
- Solutions for Practice Qs - BST.pdf
- Add Contents.txt
- Maps Comparision Table.pdf
- Practice Questions - Hashing.pdf
- Practice Questions - Heaps.pdf
- Solutions for Practice Qs - Hashing.pdf
- Solutions for Practice Qs - Heaps.pdf
- Add Contents.txt
- Practice Questions - Graphs.pdf
- Solutions for Practice Qs - Graphs.pdf
- Add Contents.txt
- Practice Questions - Tries.pdf
- Solutions for Practice Qs - Tries.pdf
- Add Contents.txt
- Practice Questions - DP.pdf
- Solutions for Practice Qs - DP.pdf
- Add Contents.txt
- Practice Questions - Bit Manipulation.pdf
- Solution for Practice Qs - Bit Manipulation.pdf
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- 01). Punched Cards.py
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- Add Contents.txt
- A.cpp
- B.cpp
- C.cpp
- D.cpp
- Add Contents.txt
- Readme.md
- Add Contents.txt
- Add Contents.txt
- Readme.md
- 0001]. Two Sum.cpp
- 0002]. Add Two Numbers.cpp
- 0003]. Longest Substring Without Repeating Characters.cpp
- 0004]. Median of Two Sorted Arrays.cpp
- 0005]. Longest Palindromic Substring.cpp
- 0006]. Zigzag Conversion.cpp
- 0007]. Reverse Integer.cpp
- 0008 (i)]. String to Int atoi.cpp
- 0008 (ii)]. String to Int atoi.cpp
- 0009]. Palindrome Number.cpp
- 0010]. Regular Expression Matching.cpp
- 0011 (i)]. Container with Most Water.cpp
- 0011 (ii)]. Container With Most Water.cpp
- 0012]. Integer to Roman.cpp
- 0013]. Roman to Integer.cpp
- 0014]. Longest Common Prefix.cpp
- 0015]. 3Sum.cpp
- 0016]. 3Sum Closest.cpp
- 0017 (i)]. Letter Combinations of a Phone Number.cpp
- 0017 (ii)]. Letter Combinations of a Phone Number.cpp
- 0018]. 4Sum.cpp
- 0035]. Search Insert Position.cpp
- 0053]. Maximum Subarray.cpp
- 0088]. Merge Sorted Array.cpp
- 0108]. Convert Sorted Array to BST.cpp
- 0128]. Longest Consecutive Subsequence.cpp
- 0154]. Find Minimum in Rotated Sorted Array II.cpp
- 0386]. Lexicographical Numbers.cpp
- 0387]. First Unique Character in a String.cpp
- 0388]. Longest Absolute File Path.cpp
- 0389]. Find the Difference.cpp
- 0390]. Elimination Game.cpp
- 0391]. Perfect Rectangle.cpp
- 0438]. Find All Anagrams in a String.cpp
- 0442]. Find All Duplicates in an Array.cpp
- 0448]. Find All Numbers Disappeared in an Array.cpp
- 0997]. Find the Town Judge.cpp
- 2190]. Most Frequent Number Following Key In an Array.cpp
- 2191]. Sort the Jumbled Numbers.cpp
- 2192]. All Ancestors of a Node in a Directed Acyclic Graph.cpp
- 2193]. Minimum Number of Moves to Make Palindrome.cpp
- 0001]. Two Sum.java
- 0002]. Add Two Numbers.java
- 0003]. Longest Substring Without Repeating Characters.java
- 0046]. Permutations.java
- 0051] N-Queens.java
- 0399]. EvaluateDivision.java
- 0001)_Two_Sum.py
- 0002)_i_Add_Two_Nubers.py
- 0002)_ii_Add_two_numbers.py
- 0003)_Longest_Substring.py
- 0003)Longest_Substring_Without_Repeating_Characters.py
- 0004)_Median_of_Two_Sorted_Arrays.py
- 0005)_i_Longest_Palindromic_Substring.py
- 0005)_ii_Longest_palindromic_substring.py
- 0006)_ZigZag_Conversion.py
- 0007)_Reverse_Integer.py
- 0008)_String_to_Integer.py
- 0009)_i_Palindrome_Number.py
- 0009)_ii_Palindrome_Number.py
- 0010)_Regular_Expression_Matching.py
- 0011)_Container_With_Most_Water.py
- 0012)_i_Integer_to_Roman.py
- 0012)_ii_Int_to_Roman.py
- 0013)_i_Roman_to_Integer.py
- 0013)_ii_Roman_to_integer.py
- 0014)_i_Longest_Common_Prefix.py
- 0014)_ii_Longest_common_prefix.py
- 0015)_Three_Sum.py
- 0016)_Three_Sum_Closest.py
- 0017)_i_Letter_Combinations_of_Phone Number.py
- 0017)_ii_Letter_Combinations_of_a_Phone_Number.py
- 0018)_Four_Sum.py
- 0019)_Remove_Nth_Node_from_End.py
- 0020) _ii_Valid_Parentheses.py
- 0020)_i_Valid_Parenntheses.py
- 0021)_i_Merge_Two_Sorted_List.py
- 0021)_ii_Merge_Two_Sorted_Lists.py
- 0022)_i_Generate_Parentheses.py
- 0022)_ii_Generate_Parentheses.py
- 0023)_Merge_K_Sorted_List.py
- 0024)_Swap_Nodes_in_Pairs.py
- 0025)_Reverse_Nodes_in_K-Group.py
- 0026)_i_Remove_Duplicates_from_Sorted Array.py
- 0026)_ii_Remove_Duplicates_from_Sorted_Array.py
- 0027)_Remove_Element.py
- 0028)_i_Implement_strStr().py
- 0028)_ii_Implement_strStr().py
- 0029)_i_Divide_Two_Integers.py
- 0029)_ii_Divide_Two_Integers.py
- 0030)_Substring_with_Concatenation_of_All_words.py
- 0031)_Next_Permutation.py
- 0032)_Longest_Valid_Parentheses.py
- 0033)_Search_in_Rotated_Sorted_Array.py
- 0034)_Find_First_and_Last_Element_in_Sorted_Array.py
- 0035)_Search_Insert_Position.py
- 0036)_Valid_Sudoku.py
- 0037)_Sudoku_Solver.py
- 0038)_Count_and_Say.py
- 0039)_Combination_Sum.py
- 0040)_Combination_Sum_ii.py
- 0041)_First_Missing_Positive.py
- 0042)_Trapping_Rain_Water.py
- 0043)_Multiply_Strings.py
- 0044)_Wildcard_Matching.py
- 0045)_Jump_Game_ii.py
- 0046)_Permutations.py
- 0047)_Permutations_ii.py
- 0048)_Rotate_Image.py
- 0049)_Group_Anagrams.py
- 0050)_Pow(x, n).py
- 0191)_number of 1-bits.py
- 0344)_reverse string.py
- 0680)_valid-palindrome-ii.py
- 1523)_count odd numbers in an interval-range.py
- 386]. Lexicographical Numbers.cpp
- 387]. First Unique Character in a String.cpp
- 388]. Longest Absolute File Path.cpp
- 389]. Find the Difference.cpp
- 390]. Elimination Game.cpp
- 391]. Perfect Rectangle.cpp
- 2190]. Most Frequent Number Following Key In an Array.cpp
- 2191]. Sort the Jumbled Numbers.cpp
- 2192]. All Ancestors of a Node in a Directed Acyclic Graph.cpp
- 2193]. Minimum Number of Moves to Make Palindrome.cpp
- Add Contents.txt
- Readme.md
- Add Contents.txt
- Readme.md
- Readme.md
- Readme.md
- .gitignore
// repository documentation
Was this content helpful?
(0 ratings)