Skip to content

purushottamnawale/dsa-cpp-apna-college

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

98 Commits
.vscode
.vscode
 
 
array
array
 
 
linked_list
linked_list
 
 
oops
oops
 
 
pattern
pattern
 
 
recursion
recursion
 
 
searching
searching
 
 
sorting
sorting
 
 
tree
tree
 
 
.gitignore
.gitignore
 
 
10_check_palindrome.cpp
10_check_palindrome.cpp
 
 
10_introduction_to_character_array.cpp
10_introduction_to_character_array.cpp
 
 
10_largest_word_in_a_sentence.cpp
10_largest_word_in_a_sentence.cpp
 
 
11_array_pointer.cpp
11_array_pointer.cpp
 
 
11_char_pointer.cpp
11_char_pointer.cpp
 
 
11_int_pointer.cpp
11_int_pointer.cpp
 
 
11_passing_pointers_to_function.cpp
11_passing_pointers_to_function.cpp
 
 
11_pointer_to_pointer.cpp
11_pointer_to_pointer.cpp
 
 
13_2_form_the_biggest_number_from_the_numeric_string.cpp
13_2_form_the_biggest_number_from_the_numeric_string.cpp
 
 
13_2_maximum_occuring_character_in_a_string.cpp
13_2_maximum_occuring_character_in_a_string.cpp
 
 
13_2_string_upper_lower_case.cpp
13_2_string_upper_lower_case.cpp
 
 
13_string_1.cpp
13_string_1.cpp
 
 
13_string_2.cpp
13_string_2.cpp
 
 
13_string_input_output.cpp
13_string_input_output.cpp
 
 
14_1_bit_manipulation.cpp
14_1_bit_manipulation.cpp
 
 
14_2_check_number_is_power_of_2_binary.cpp
14_2_check_number_is_power_of_2_binary.cpp
 
 
14_2_generate_subset.cpp
14_2_generate_subset.cpp
 
 
14_2_number_of_ones_in_binary_number.cpp
14_2_number_of_ones_in_binary_number.cpp
 
 
14_3_find_2_unique_numbers_in_an_array.cpp
14_3_find_2_unique_numbers_in_an_array.cpp
 
 
14_3_find_a_unique_number_in_an_array_where_other_numbers_are_present_thrice.cpp
14_3_find_a_unique_number_in_an_array_where_other_numbers_are_present_thrice.cpp
 
 
14_3_find_a_unique_number_in_an_array_where_other_numbers_are_present_twice.cpp
14_3_find_a_unique_number_in_an_array_where_other_numbers_are_present_twice.cpp
 
 
15_1_prime_factorization_using_sieve.cpp
15_1_prime_factorization_using_sieve.cpp
 
 
15_1_sieve_of_eratosthenes.cpp
15_1_sieve_of_eratosthenes.cpp
 
 
15_2_find_the_number_of_numbers_which_are_divisible_by_a_or_b_in_the_given_interval.cpp
15_2_find_the_number_of_numbers_which_are_divisible_by_a_or_b_in_the_given_interval.cpp
 
 
15_2_the_euclidean_algorithm_for_gcd.cpp
15_2_the_euclidean_algorithm_for_gcd.cpp
 
 
16_5_time_complexity_using_masters_theorem.docx
16_5_time_complexity_using_masters_theorem.docx
 
 
17_recursion_return_all_possible_permutations_of_distinct_integers.cpp
17_recursion_return_all_possible_permutations_of_distinct_integers.cpp
 
 
17_recursion_return_all_possible_permutations_of_integers_that_might_contain_duplicates.cpp
17_recursion_return_all_possible_permutations_of_integers_that_might_contain_duplicates.cpp
 
 
17_return_all_possible_permutations_with_stl.cpp
17_return_all_possible_permutations_with_stl.cpp
 
 
18_1_recursion_backtracking_rat_in_a_maze.cpp
18_1_recursion_backtracking_rat_in_a_maze.cpp
 
 
18_2_recursion_backtracking_n_queen_problem.cpp
18_2_recursion_backtracking_n_queen_problem.cpp
 
 
19_pair.cpp
19_pair.cpp
 
 
19_pair_2.cpp
19_pair_2.cpp
 
 
19_vector.cpp
19_vector.cpp
 
 
1_hello_world.cpp
1_hello_world.cpp
 
 
23_1_stack_data_structure_introduction.cpp
23_1_stack_data_structure_introduction.cpp
 
 
23_2_reverse_a_sentence_using_stacks.cpp
23_2_reverse_a_sentence_using_stacks.cpp
 
 
23_3_reverse_a_stack.cpp
23_3_reverse_a_stack.cpp
 
 
23_5_prefix_expression_evaluation.cpp
23_5_prefix_expression_evaluation.cpp
 
 
23_6_postfix_expression_evaluation.cpp
23_6_postfix_expression_evaluation.cpp
 
 
23_7_infix_to_postfix.cpp
23_7_infix_to_postfix.cpp
 
 
23_8_infix_to_prefix.cpp
23_8_infix_to_prefix.cpp
 
 
23_9_balanced_parenthesis.cpp
23_9_balanced_parenthesis.cpp
 
 
24_1_introduction_to_queue_data_structure.cpp
24_1_introduction_to_queue_data_structure.cpp
 
 
24_2_linked_list_implementation_of_queues.cpp
24_2_linked_list_implementation_of_queues.cpp
 
 
24_3_queue_using_stack_1.cpp
24_3_queue_using_stack_1.cpp
 
 
24_3_queue_using_stack_2.cpp
24_3_queue_using_stack_2.cpp
 
 
24_4_2_stacking_using_queues_method_2.cpp
24_4_2_stacking_using_queues_method_2.cpp
 
 
24_4_stack_using_queue.cpp
24_4_stack_using_queue.cpp
 
 
25_1_introduction_to_deque.cpp
25_1_introduction_to_deque.cpp
 
 
25_1_sliding_window_maximum_using_deque.cpp
25_1_sliding_window_maximum_using_deque.cpp
 
 
25_1_sliding_window_maximum_using_multiset.cpp
25_1_sliding_window_maximum_using_multiset.cpp
 
 
25_2_largest_rectangle_code.cpp
25_2_largest_rectangle_code.cpp
 
 
25_2_largest_rectangle_code_brute_force.cpp
25_2_largest_rectangle_code_brute_force.cpp
 
 
25_3_trapping_rainwater.cpp
25_3_trapping_rainwater.cpp
 
 
25_4_redundant_parenthesis.cpp
25_4_redundant_parenthesis.cpp
 
 
25_5_the_stock_span_problem.cpp
25_5_the_stock_span_problem.cpp
 
 
25_5_the_stock_span_problem_brute_force.cpp
25_5_the_stock_span_problem_brute_force.cpp
 
 
26_1_two_pointers.cpp
26_1_two_pointers.cpp
 
 
26_2_max_consecutive_ones.cpp
26_2_max_consecutive_ones.cpp
 
 
26_3_longest_substring_without_repeating_characters.cpp
26_3_longest_substring_without_repeating_characters.cpp
 
 
2_1_data_types.cpp
2_1_data_types.cpp
 
 
2_2_io_addition.cpp
2_2_io_addition.cpp
 
 
2_3_if_else.cpp
2_3_if_else.cpp
 
 
2_3_if_else_max_of_three numbers.cpp
2_3_if_else_max_of_three numbers.cpp
 
 
2_3_if_else_odd_even.cpp
2_3_if_else_odd_even.cpp
 
 
2_4_do_while_loop_print_number_till_negative_number.cpp
2_4_do_while_loop_print_number_till_negative_number.cpp
 
 
2_4_for_loop_summation_of_n_numbers.cpp
2_4_for_loop_summation_of_n_numbers.cpp
 
 
2_4_while_loop_print_number_till_negative_number.cpp
2_4_while_loop_print_number_till_negative_number.cpp
 
 
3_1_break_statement_prime_number_in_given_range.cpp
3_1_break_statement_prime_number_in_given_range.cpp
 
 
3_1_continue_break_statement.cpp
3_1_continue_break_statement.cpp
 
 
3_1_continue_break_statement_prime_number.cpp
3_1_continue_break_statement_prime_number.cpp
 
 
3_1_continue_statement_print_numbers_except_which_are_divisible_by_3.cpp
3_1_continue_statement_print_numbers_except_which_are_divisible_by_3.cpp
 
 
3_2_switch_statement.cpp
3_2_switch_statement.cpp
 
 
3_2_switch_statement_calculator.cpp
3_2_switch_statement_calculator.cpp
 
 
3_3_operator.cpp
3_3_operator.cpp
 
 
5_1_binary_number_system.pdf
5_1_binary_number_system.pdf
 
 
5_2_armstrong_number.cpp
5_2_armstrong_number.cpp
 
 
5_2_prime_number.cpp
5_2_prime_number.cpp
 
 
5_2_reverse_a_number.cpp
5_2_reverse_a_number.cpp
 
 
6_1_functions_in_c++.pdf
6_1_functions_in_c++.pdf
 
 
6_2_factorial_function.cpp
6_2_factorial_function.cpp
 
 
6_2_fibonacchi_series_function.cpp
6_2_fibonacchi_series_function.cpp
 
 
6_2_ncr_calculator_function.cpp
6_2_ncr_calculator_function.cpp
 
 
6_2_pascal_triangle_function.cpp
6_2_pascal_triangle_function.cpp
 
 
6_2_prime_number_function.cpp
6_2_prime_number_function.cpp
 
 
6_3_addition_of_binary_numbers_function.cpp
6_3_addition_of_binary_numbers_function.cpp
 
 
6_3_advanced_placement_questions_on_functions.pdf
6_3_advanced_placement_questions_on_functions.pdf
 
 
6_3_binary_to_decimal_function.cpp
6_3_binary_to_decimal_function.cpp
 
 
6_3_decimal_to_binary_function.cpp
6_3_decimal_to_binary_function.cpp
 
 

Repository files navigation

Data Structures and Algorithms in C++ by Apna College

This is the code repository of C++ DSA course by Apna College on Youtube.

Data Structures included:

1.Arrays

  8.1 Introduction to Arrays in C++ | YouTube | PDF

  8.1 Input to Array | YouTube

  8.1 Maximum and Minimum in Array | YouTube

  8.4 Maximum till i | YouTube | PDF

  8.4 Subarray vs Subsequence PDF

  8.4 Sum of all Subarrays | YouTube | PDF

  8.4 Longest Arithmetic Subarray | YouTube | PDF

  8.4 Record Breaker | YouTube | PDF

2.Stacks
3.Queues
4.Linked lists
5.Recursion
6.Trees
7.Binary search trees
8.Binary heaps
9.Graphs

Algorithms included:

1.Searching
  8.2 Linear Search | YouTube
  8.2 Binary Search | YouTube
2.Sorting
  8.3.1 Selection Sort | YouTube | Correction
  8.3.1 Bubble Sort | YouTube
  8.3.1 Insertion Sort | YouTube
3.Hashing
4.Asymptotic worst-case time and space complexity
5.Algorithm design techniques:
  1.Greedy
  2.Dynamic programming
  3.Divide-and-conquer
6.Graph search
7.Minimum spanning trees
8.Shortest paths

About

This is the code repository for C++ DSA course by Apna College on Youtube.

www.youtube.com/playlist?list=PLfqMhTWNBTe0b2nM6JHVCnAkhQRGiZMSJ

Topics

algorithms cpp competitive-programming data-structures problem-solving cp dsa apna-college

Resources

Readme
Activity

Stars

5 stars

Watchers

1 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

No packages published

Languages