Skip to content
/ DSA-Problem-Set-1 Public

DSA Interview Prep: A comprehensive collection of Data Structures and Algorithms (DSA) interview problems and their solutions, designed to help candidates prepare effectively for technical interviews. This repository includes a variety of problems and solutions in multiple programming languages, making it a valuable resource for software engineers.

ankit2004tiwari.github.io/dsa-problem-set-1
0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

Ankit2004tiwari/DSA-Problem-Set-1

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
.github/workflows
.github/workflows
 
 
.gitattributes
.gitattributes
 
 
Add_1_to_a_SLL.cpp
Add_1_to_a_SLL.cpp
 
 
AggressiveCows.cpp
AggressiveCows.cpp
 
 
Alien_Dictionary.cpp
Alien_Dictionary.cpp
 
 
Allocate_minimum_pages.cpp
Allocate_minimum_pages.cpp
 
 
Alternate_positive_and_negetive_numbers.cpp
Alternate_positive_and_negetive_numbers.cpp
 
 
BFS_of_a_graph.cpp
BFS_of_a_graph.cpp
 
 
Balanced_Tree_Check.cpp
Balanced_Tree_Check.cpp
 
 
Base_Conversion.cpp
Base_Conversion.cpp
 
 
Burning_Tree.cpp
Burning_Tree.cpp
 
 
Capacity_To_Ship_Packages_Within_Days.cpp
Capacity_To_Ship_Packages_Within_Days.cpp
 
 
Ceil_In_Binary_Search_Tree.cpp
Ceil_In_Binary_Search_Tree.cpp
 
 
Check_For_BST.cpp
Check_For_BST.cpp
 
 
Children_Sum_In_Binary_Tree.cpp
Children_Sum_In_Binary_Tree.cpp
 
 
Construct_Binary_Search_Tree_From_PreOrder_Traversal.cpp
Construct_Binary_Search_Tree_From_PreOrder_Traversal.cpp
 
 
Construct_Tree_From_InOrder_And_PostOrder.cpp
Construct_Tree_From_InOrder_And_PostOrder.cpp
 
 
Construct_Tree_From_InOrder_And_PreOrder.cpp
Construct_Tree_From_InOrder_And_PreOrder.cpp
 
 
CountSubArraysWithXorK.cpp
CountSubArraysWithXorK.cpp
 
 
Count_Inversion.cpp
Count_Inversion.cpp
 
 
DFS_of_graph.cpp
DFS_of_graph.cpp
 
 
Decimal_To_Any_Base_Conversion.cpp
Decimal_To_Any_Base_Conversion.cpp
 
 
Delete_Mid_of_a_stack.cpp
Delete_Mid_of_a_stack.cpp
 
 
Delete_a_Node_From_BST.cpp
Delete_a_Node_From_BST.cpp
 
 
Detect_Loop_In_Linked_List.cpp
Detect_Loop_In_Linked_List.cpp
 
 
Diameter_Of_Binary_Tree.cpp
Diameter_Of_Binary_Tree.cpp
 
 
Find_All_Pairs_With_A_Given_Sum.cpp
Find_All_Pairs_With_A_Given_Sum.cpp
 
 
Find_Kth_rotation.cpp
Find_Kth_rotation.cpp
 
 
Find_Length_Of_Loop_in_Linked_List.cpp
Find_Length_Of_Loop_in_Linked_List.cpp
 
 
Find_Triplets_With_0_Sum.cpp
Find_Triplets_With_0_Sum.cpp
 
 
Find_a_peak_element.cpp
Find_a_peak_element.cpp
 
 
Find_min_rotated_sorted_array.cpp
Find_min_rotated_sorted_array.cpp
 
 
FirstAndLastPositionOfElementInSortedArray.cpp
FirstAndLastPositionOfElementInSortedArray.cpp
 
 
First_and_last_occurrences_using_upper_and_lower_bound.cpp
First_and_last_occurrences_using_upper_and_lower_bound.cpp
 
 
First_repeating_element.cpp
First_repeating_element.cpp
 
 
Floor_in_Binary_Search_Tree.cpp
Floor_in_Binary_Search_Tree.cpp
 
 
FourSum.cpp
FourSum.cpp
 
 
Frequency_of_String.cpp
Frequency_of_String.cpp
 
 
Height_of_Binary_Tree.cpp
Height_of_Binary_Tree.cpp
 
 
Identical_trees.cpp
Identical_trees.cpp
 
 
InOrder_Predecessor_Successor_In_BST.cpp
InOrder_Predecessor_Successor_In_BST.cpp
 
 
Insert_In_sorted_way_in_a_sorted_dll.cpp
Insert_In_sorted_way_in_a_sorted_dll.cpp
 
 
Insert_a_node_in_BST.cpp
Insert_a_node_in_BST.cpp
 
 
Iterative_Inorder_traversal.cpp
Iterative_Inorder_traversal.cpp
 
 
Iterative_post_order_traversal_using_2_stack.cpp
Iterative_post_order_traversal_using_2_stack.cpp
 
 
Iterative_preOrder_traversal.cpp
Iterative_preOrder_traversal.cpp
 
 
Job_Sequence_Problem.cpp
Job_Sequence_Problem.cpp
 
 
Kth_From_End_Of_Linked_List.cpp
Kth_From_End_Of_Linked_List.cpp
 
 
Kth_Missing_Positive_Number.cpp
Kth_Missing_Positive_Number.cpp
 
 
Kth_Smallest_or_Largest_Element_in_BST.cpp
Kth_Smallest_or_Largest_Element_in_BST.cpp
 
 
LCA_In_Binary_Search_Tree.cpp
LCA_In_Binary_Search_Tree.cpp
 
 
Level_order_traversal_bfs.cpp
Level_order_traversal_bfs.cpp
 
 
LongestSubArrayWithZeroSum.cpp
LongestSubArrayWithZeroSum.cpp
 
 
Longest_SubArray_Sum_K.cpp
Longest_SubArray_Sum_K.cpp
 
 
Lowest_Common_Ancestor.cpp
Lowest_Common_Ancestor.cpp
 
 
Max_Sum_Path_In_Two_Sub_Arrays.cpp
Max_Sum_Path_In_Two_Sub_Arrays.cpp
 
 
Maximize_Array_Value_After_ReArrangement.cpp
Maximize_Array_Value_After_ReArrangement.cpp
 
 
Maximum_Difference.cpp
Maximum_Difference.cpp
 
 
Maximum_Path_Sum_from_any_node_in_Binary_tree.cpp
Maximum_Path_Sum_from_any_node_in_Binary_tree.cpp
 
 
Maximum_Product_Of_SubArray.cpp
Maximum_Product_Of_SubArray.cpp
 
 
Maximum_Width_Of_Binary_Tree.cpp
Maximum_Width_Of_Binary_Tree.cpp
 
 
Maximum_sum_of_subarray_of_size_k.cpp
Maximum_sum_of_subarray_of_size_k.cpp
 
 
Median_Of_Two_Sorted_Arrays.cpp
Median_Of_Two_Sorted_Arrays.cpp
 
 
Median_in_a_row_wise_sorted_matrix.cpp
Median_in_a_row_wise_sorted_matrix.cpp
 
 
Minimum_Size_SubArray_Sum.cpp
Minimum_Size_SubArray_Sum.cpp
 
 
Minimum_jumps.cpp
Minimum_jumps.cpp
 
 
N-Queens.cpp
N-Queens.cpp
 
 
Nth_Fibonacci_Number.cpp
Nth_Fibonacci_Number.cpp
 
 
Nth_Natural_Number.cpp
Nth_Natural_Number.cpp
 
 
Number_Of_Occurence.cpp
Number_Of_Occurence.cpp
 
 
Number_Of_Pairs.cpp
Number_Of_Pairs.cpp
 
 
Number_Of_Provinces.cpp
Number_Of_Provinces.cpp
 
 
Number_of_good_components_in_undirected_graph.cpp
Number_of_good_components_in_undirected_graph.cpp
 
 
Painter's_Partition_Algorithm.cpp
Painter's_Partition_Algorithm.cpp
 
 
Pair_Sum_in_Binary_Search_Tree.cpp
Pair_Sum_in_Binary_Search_Tree.cpp
 
 
Palindrome_string.cpp
Palindrome_string.cpp
 
 
Peak_Element.cpp
Peak_Element.cpp
 
 
Pre_In_Post_Order_In_1_Travesal.cpp
Pre_In_Post_Order_In_1_Travesal.cpp
 
 
README.md
README.md
 
 
Rearrange_array_alternatively.cpp
Rearrange_array_alternatively.cpp
 
 
RemoveDuplicationOfArray.cpp
RemoveDuplicationOfArray.cpp
 
 
Reverse_Array_Using_Recursion.cpp
Reverse_Array_Using_Recursion.cpp
 
 
Reverse_Pairs.cpp
Reverse_Pairs.cpp
 
 
Right_Left_View_In_Binary_Tree.cpp
Right_Left_View_In_Binary_Tree.cpp
 
 
Root_To_Leaf_Paths.cpp
Root_To_Leaf_Paths.cpp
 
 
Rotate_LL.cpp
Rotate_LL.cpp
 
 
SIngle_Element_In_Sorted_Array.cpp
SIngle_Element_In_Sorted_Array.cpp
 
 
Search_In_Rotated_Sorted_Array-Ankit_Tiwari.cpp
Search_In_Rotated_Sorted_Array-Ankit_Tiwari.cpp
 
 
Search_In_Rotated_Sorted_Array.cpp
Search_In_Rotated_Sorted_Array.cpp
 
 
Search_in_a_2D_Matrix.cpp
Search_in_a_2D_Matrix.cpp
 
 
Search_in_a_row_col_sorted_matrix.cpp
Search_in_a_row_col_sorted_matrix.cpp
 
 
Search_in_rotated_sorted_array_II.cpp
Search_in_rotated_sorted_array_II.cpp
 
 
Serialize_And_DeSerialize_Of_Binary_Tree.cpp
Serialize_And_DeSerialize_Of_Binary_Tree.cpp
 
 
Shortest_Path_In_Undirected_Graph.cpp
Shortest_Path_In_Undirected_Graph.cpp
 
 
Smallest_Divisor_Given_A_Threshold.cpp
Smallest_Divisor_Given_A_Threshold.cpp
 
 
Sort_a_linked_list_of_0s_1s_and_2s.cpp
Sort_a_linked_list_of_0s_1s_and_2s.cpp
 
 
Spiral_Matrix_III.cpp
Spiral_Matrix_III.cpp
 
 
convert_array_into_a_zigzag_fashion.cpp
convert_array_into_a_zigzag_fashion.cpp
 
 
indexes_of_subarray_sum.cpp
indexes_of_subarray_sum.cpp
 
 
isAnagram.cpp
isAnagram.cpp
 
 

Repository files navigation

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.

Table of Contents

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:

  1. Clone the repository: git clone https://github.com/Ankit2004tiwari/DSA-Problem-Set-1.git
  2. 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

Contact Information

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

About

DSA Interview Prep: A comprehensive collection of Data Structures and Algorithms (DSA) interview problems and their solutions, designed to help candidates prepare effectively for technical interviews. This repository includes a variety of problems and solutions in multiple programming languages, making it a valuable resource for software engineers.

Ankit2004tiwari.github.io/DSA-Problem-Set-1

Topics

hashing linked-list base-conversion binary-search-tree binary-tree array-manipulations two-pointers sliding-window n-queens-problem spiral-matrix kadanes-algorithm lowest-common-ancestor rotate-matrix traversal-algorithms subarray-sum-equals-k painter-algorithm bfs-dfs binary-search-algorithm rotate-linked-list bfs-dfs-of-graph

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages