DSA Interview Prep

Description

This repository contains a collection of Data Structures and Algorithms (DSA) interview problems along with their solutions, aimed at helping candidates prepare for technical interviews.

Features

Comprehensive coverage of DSA topics
Solutions in C++ programming languages
Example problems with detailed explanations

Getting Started

To get a copy of this repository up and running on your local machine, follow these steps:

Clone the repository: git clone https://github.com/Ankit2004tiwari/DSA-Problem-Set-1.git
Navigate to the project directory: cd DSA-Problem-Set-1

Usage

To run the solutions, simply execute the relevant files in your preferred programming environment.

Contributing

Contributions are welcome! Please read the CONTRIBUTING.md for details on how to contribute.

License

This project is licensed under the MIT License - see the LICENSE file for details.

Acknowledgments

Resource Name for inspiration and guidance.

Contact Information

For questions or feedback, reach out to me at [[email protected]].

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
Add_Number_Linked_Lists.cpp		Add_Number_Linked_Lists.cpp
Array_Deletion.cpp		Array_Deletion.cpp
Array_To_Linked_List.cpp		Array_To_Linked_List.cpp
Array_insertion.cpp		Array_insertion.cpp
BST_To_Make_Heap.cpp		BST_To_Make_Heap.cpp
BinaryTree_To_DLL.cpp		BinaryTree_To_DLL.cpp
Bipertile_graph.cpp		Bipertile_graph.cpp
Boolean_Matrix.cpp		Boolean_Matrix.cpp
Circle_of_Strings.cpp		Circle_of_Strings.cpp
CircularLinkedList.cpp		CircularLinkedList.cpp
Clone_A_LinkedList_With_Next_And_Random_Pointer.cpp		Clone_A_LinkedList_With_Next_And_Random_Pointer.cpp
Course_Schedule.cpp		Course_Schedule.cpp
Dijkstra_Algorithm_Using_Priority_Queue.cpp		Dijkstra_Algorithm_Using_Priority_Queue.cpp
Dijkstra_algorithm_Using_Set_Data_Structure.cpp		Dijkstra_algorithm_Using_Set_Data_Structure.cpp
Directed_graph_cycle.cpp		Directed_graph_cycle.cpp
Distance_of_nearest_cell_having_1.cpp		Distance_of_nearest_cell_having_1.cpp
Element_with_left_side_smaller_and_right_side_greater.cpp		Element_with_left_side_smaller_and_right_side_greater.cpp
Evantual_Safe_States.cpp		Evantual_Safe_States.cpp
Find_number_of_closest_islands.cpp		Find_number_of_closest_islands.cpp
Find_number_of_island.cpp		Find_number_of_island.cpp
Find_the_element_that_appears_once_in_sorted_array.cpp		Find_the_element_that_appears_once_in_sorted_array.cpp
Flattening_A_Linked_List.cpp		Flattening_A_Linked_List.cpp
Flood_fill_algorithm.cpp		Flood_fill_algorithm.cpp
Form_a_number_divisible_by_3_using_array_digits.cpp		Form_a_number_divisible_by_3_using_array_digits.cpp
Intersection_Of_Two_linked_list.cpp		Intersection_Of_Two_linked_list.cpp
Intersection_in_Y_Shaped_Linked_Lists.cpp		Intersection_in_Y_Shaped_Linked_Lists.cpp
Is_Binary_Number_Multiple_Of_3.cpp		Is_Binary_Number_Multiple_Of_3.cpp
K_Largest_Element.cpp		K_Largest_Element.cpp
K_Sized_Sub_array_Maximum.cpp		K_Sized_Sub_array_Maximum.cpp
Left_Most_And_Right_Most_Of_Indexs.cpp		Left_Most_And_Right_Most_Of_Indexs.cpp
Level_Order_Traversal_In_Spiral_Form.cpp		Level_Order_Traversal_In_Spiral_Form.cpp
Longest_Prefix_Suffix.cpp		Longest_Prefix_Suffix.cpp
Make_Array_Elements_Unique.cpp		Make_Array_Elements_Unique.cpp
Max_Sum_In_Configuration.cpp		Max_Sum_In_Configuration.cpp
Median_of_Two_Sorted_Arrays.cpp		Median_of_Two_Sorted_Arrays.cpp
Meeting_Rooms.cpp		Meeting_Rooms.cpp
Merge_K_Sorted_Linked_List.cpp		Merge_K_Sorted_Linked_List.cpp
Merge_Two_BST's.cpp		Merge_Two_BST's.cpp
Merge_Two_Sorted_LinkedList_In_Reverse_Order.cpp		Merge_Two_Sorted_LinkedList_In_Reverse_Order.cpp
Merge_Two_Sorted_Linked_List.cpp		Merge_Two_Sorted_Linked_List.cpp
Minimal_Cost.cpp		Minimal_Cost.cpp
Minimize_the_heights_II.cpp		Minimize_the_heights_II.cpp
Minimum_Sum.cpp		Minimum_Sum.cpp
Minimum_number_in_a_rotated_sorted_array.cpp		Minimum_number_in_a_rotated_sorted_array.cpp
Minimum_repeat_to_make_substring.cpp		Minimum_repeat_to_make_substring.cpp
Mirror_Tree.cpp		Mirror_Tree.cpp
Move_Last_Element_To_Front_Of_A_Linked_List.cpp		Move_Last_Element_To_Front_Of_A_Linked_List.cpp
Multiply_Two_Linked_List.cpp		Multiply_Two_Linked_List.cpp
Next_Permutation.cpp		Next_Permutation.cpp
Non_repeating_character.cpp		Non_repeating_character.cpp
Number_of_distinct_elements.cpp		Number_of_distinct_elements.cpp
Number_of_enclaves.cpp		Number_of_enclaves.cpp
Prerequisite_tasks.cpp		Prerequisite_tasks.cpp
Product_of_primes.cpp		Product_of_primes.cpp
README.md		README.md
Rearrange_an_array_with_O(1)_extra_space.cpp		Rearrange_an_array_with_O(1)_extra_space.cpp
Remove_duplicates_from_an_unsorted_linkedlist.cpp		Remove_duplicates_from_an_unsorted_linkedlist.cpp
Repeated_and_missing_number.cpp		Repeated_and_missing_number.cpp
Roman_Number_To_Integer.cpp		Roman_Number_To_Integer.cpp
Rotate_Doubly_Linked_List.cpp		Rotate_Doubly_Linked_List.cpp
Rotate_and_Delete.cpp		Rotate_and_Delete.cpp
Rotated_Sorted_Array_Using_Binary_Search_Recursion.cpp		Rotated_Sorted_Array_Using_Binary_Search_Recursion.cpp
Rotten_Oranges.cpp		Rotten_Oranges.cpp
Search_Pattern_KMP_Algorithm.cpp		Search_Pattern_KMP_Algorithm.cpp
Second_Largest.cpp		Second_Largest.cpp
Shortest_Path_in_Directed_Acyclic_Graph.cpp		Shortest_Path_in_Directed_Acyclic_Graph.cpp
Smallest_Positive_Missing_Number.cpp		Smallest_Positive_Missing_Number.cpp
Sort_0s_1s_2s_in_array.cpp		Sort_0s_1s_2s_in_array.cpp
Sort_An_Array_According_To_Other.cpp		Sort_An_Array_According_To_Other.cpp
Sorted_Subsequence_of_size_3.cpp		Sorted_Subsequence_of_size_3.cpp
Sorting_Elements_Of_Arrays_By_Fraquency.cpp		Sorting_Elements_Of_Arrays_By_Fraquency.cpp
Split_an_array_into_two_equal_sum_subarray.cpp		Split_an_array_into_two_equal_sum_subarray.cpp
Split_array_in_three_equal_sum_subarrays.cpp		Split_array_in_three_equal_sum_subarrays.cpp
Stack_arrays.cpp		Stack_arrays.cpp
Stack_push_pop.cpp		Stack_push_pop.cpp
Stock_Buy_and_Sell_Max_One_Transection_Allowed.cpp		Stock_Buy_and_Sell_Max_One_Transection_Allowed.cpp
Stock_Buy_and_Sell_Multiple_Transection_allowed.cpp		Stock_Buy_and_Sell_Multiple_Transection_allowed.cpp
StringPalindrome_Using_Recursion.cpp		StringPalindrome_Using_Recursion.cpp
String_rotated_by_2_places.cpp		String_rotated_by_2_places.cpp
SubArray_With_Zero_Sum.cpp		SubArray_With_Zero_Sum.cpp
SumTree.cpp		SumTree.cpp
Sum_Pair_Closest_to_k.cpp		Sum_Pair_Closest_to_k.cpp
Surrounded_regions_or_replace_O's_with_X's.cpp		Surrounded_regions_or_replace_O's_with_X's.cpp
Swap_and_maximize.cpp		Swap_and_maximize.cpp
Symmetric_Tree.cpp		Symmetric_Tree.cpp
ThreeSum.cpp		ThreeSum.cpp
Top_K_Frequent_In_Array.cpp		Top_K_Frequent_In_Array.cpp
Top_view_of_binary_tree.cpp		Top_view_of_binary_tree.cpp
Topological_Sort.cpp		Topological_Sort.cpp
Tree_Boundary_Traversal.cpp		Tree_Boundary_Traversal.cpp
Two_Repeated_Elements.cpp		Two_Repeated_Elements.cpp
Two_Sum_Pair_With_Given_Sum.cpp		Two_Sum_Pair_With_Given_Sum.cpp
Undirected_graph_cycle_using_bfs.cpp		Undirected_graph_cycle_using_bfs.cpp
Undirected_graph_cycle_using_dfs.cpp		Undirected_graph_cycle_using_dfs.cpp
Vertical_Tree_Traversal.cpp		Vertical_Tree_Traversal.cpp
Wave_Array.cpp		Wave_Array.cpp
Word_Ladder_I.cpp		Word_Ladder_I.cpp
Word_Ladder_II.cpp		Word_Ladder_II.cpp
Zero_Sum_Subarrays.cpp		Zero_Sum_Subarrays.cpp
Zig_Zag_Traversal_In_Binary_Tree.cpp		Zig_Zag_Traversal_In_Binary_Tree.cpp

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

DSA Interview Prep

Description

Table of Contents

Features

Getting Started

Usage

Contributing

License

Acknowledgments

Contact Information

About

Releases

Packages

Languages

Ankit2004tiwari/DSA-Problem-Set-II

Folders and files

Latest commit

History

Repository files navigation

DSA Interview Prep

Description

Table of Contents

Features

Getting Started

Usage

Contributing

License

Acknowledgments

Contact Information

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages