Name		Name	Last commit message	Last commit date
Latest commit History 35 Commits
lecture-002=Header_files		lecture-002=Header_files
lecture-003=IDE_setup		lecture-003=IDE_setup
lecture-004=C++_basics_part-I		lecture-004=C++_basics_part-I
lecture-005=C++_basics_part-II		lecture-005=C++_basics_part-II
lecture-006=C++_basics_part-III		lecture-006=C++_basics_part-III
lecture-007=C++_basics_part-IV		lecture-007=C++_basics_part-IV
lecture-008=Strings_trick		lecture-008=Strings_trick
lecture-009=C++_basics_part-V		lecture-009=C++_basics_part-V
lecture-010=C++_basics_part-VI		lecture-010=C++_basics_part-VI
lecture-010=Why_global_arrays_can_have_larger_size		lecture-010=Why_global_arrays_can_have_larger_size
lecture-011=Functions		lecture-011=Functions
lecture-012=Pointers		lecture-012=Pointers
lecture-013=Contest_discussion		lecture-013=Contest_discussion
lecture-014=Verdicts_and_errors_on_online_coding_websites		lecture-014=Verdicts_and_errors_on_online_coding_websites
lecture-015=Time_complexity_analysis_and_constraints		lecture-015=Time_complexity_analysis_and_constraints
lecture-016=Space_complexity		lecture-016=Space_complexity
lecture-017=Why_print_ans_modulo_1e9+7		lecture-017=Why_print_ans_modulo_1e9+7
lecture-018=Pre-computation_techniques_and_hashing		lecture-018=Pre-computation_techniques_and_hashing
lecture-019=How_to_hash_negative_numbers		lecture-019=How_to_hash_negative_numbers
lecture-020=Pre-computation_using_prefix_sum		lecture-020=Pre-computation_using_prefix_sum
lecture-021=Codechef-GCDQ		lecture-021=Codechef-GCDQ
lecture-022=Must_know_concept_in_pre-computation		lecture-022=Must_know_concept_in_pre-computation
lecture-023=Prefix_sum+hashing_question		lecture-023=Prefix_sum+hashing_question
lecture-024=Contest-2		lecture-024=Contest-2
lecture-025=Recursion		lecture-025=Recursion
lecture-026=Digit_sum_and_array_sum		lecture-026=Digit_sum_and_array_sum
lecture-027=Merge_and_selection_sort		lecture-027=Merge_and_selection_sort
lecture-028=C++_STL		lecture-028=C++_STL
lecture-029=Pairs_and_vectors		lecture-029=Pairs_and_vectors
lecture-030=Nesting_in_vectors		lecture-030=Nesting_in_vectors
lecture-031=Iterators		lecture-031=Iterators
lecture-032=Iterators_part-2		lecture-032=Iterators_part-2
lecture-033=C++_STL_maps		lecture-033=C++_STL_maps
lecture-034=Maps_part-2		lecture-034=Maps_part-2
lecture-035=Set_unordered-set_multi-set		lecture-035=Set_unordered-set_multi-set
lecture-036=STL_question		lecture-036=STL_question
lecture-037=Nesting_in_STL_maps_and_sets		lecture-037=Nesting_in_STL_maps_and_sets
lecture-038=Stack_and_queue		lecture-038=Stack_and_queue
lecture-039=Balanced_brackets_matching		lecture-039=Balanced_brackets_matching
lecture-040=Next_greater_element_using_stacks		lecture-040=Next_greater_element_using_stacks
lecture-041=Inbuilt_sort_in_STL		lecture-041=Inbuilt_sort_in_STL
lecture-042=Comparator_function_in_depth		lecture-042=Comparator_function_in_depth
lecture-043=Upper_bound_and_lower_bound		lecture-043=Upper_bound_and_lower_bound
lecture-044=C++_STL_inbuilt_algo		lecture-044=C++_STL_inbuilt_algo
lecture-045=Inbuilt_STL_algo_and_lambda_function		lecture-045=Inbuilt_STL_algo_and_lambda_function
lecture-046=Offline_and_online_queries_diff		lecture-046=Offline_and_online_queries_diff
lecture-047=Generate_parenthesis		lecture-047=Generate_parenthesis
lecture-048=Subset_generation		lecture-048=Subset_generation
lecture-049=STL_contest		lecture-049=STL_contest
lecture-050=Binary_search		lecture-050=Binary_search
lecture-051=Implement_upper_bound_and_lower_bound		lecture-051=Implement_upper_bound_and_lower_bound
lecture-052=Nth_root_of_number		lecture-052=Nth_root_of_number
lecture-053=Advanced_binary_search_question-1		lecture-053=Advanced_binary_search_question-1
lecture-053=Advanced_binary_search_question-2		lecture-053=Advanced_binary_search_question-2
lecture-054=3rd_contest_discussion		lecture-054=3rd_contest_discussion
lecture-055=Time_complexity_in_recursion		lecture-055=Time_complexity_in_recursion
lecture-056=Maths_and_number_theory		lecture-056=Maths_and_number_theory
lecture-057=Binary_numbers_and_bits		lecture-057=Binary_numbers_and_bits
lecture-058=More_on_bits		lecture-058=More_on_bits
lecture-059=Bit_manipulation_tricks		lecture-059=Bit_manipulation_tricks
lecture-060=Power_of_XOR_operator		lecture-060=Power_of_XOR_operator
lecture-061=Bit_masking		lecture-061=Bit_masking
lecture-062=Generate_subsets_using_bit-masking		lecture-062=Generate_subsets_using_bit-masking
lecture-063=GCD_and_LCM		lecture-063=GCD_and_LCM
lecture-064=Binary_exponentiation(recursive-method)		lecture-064=Binary_exponentiation(recursive-method)
lecture-065=Binary_exponentiation(iterative-method)		lecture-065=Binary_exponentiation(iterative-method)
lecture-066=Large_exponentiation		lecture-066=Large_exponentiation
lecture-067=SuperPow_question		lecture-067=SuperPow_question
lecture-068=Basics_of_factors_and_divisors		lecture-068=Basics_of_factors_and_divisors
lecture-069=Prime_check_and_prime_factorisation		lecture-069=Prime_check_and_prime_factorisation
lecture-070=Sieve_algo		lecture-070=Sieve_algo
lecture-071=Sieve_variations		lecture-071=Sieve_variations
lecture-072=Modular_multiplicative_inverse		lecture-072=Modular_multiplicative_inverse
lecture-073=Number_theory_practice_questions		lecture-073=Number_theory_practice_questions
lecture-074=Must_do_sieve_questions		lecture-074=Must_do_sieve_questions
lecture-075=All_sieve_concepts_in_one_question		lecture-075=All_sieve_concepts_in_one_question
lecture-076=All_sieve_concepts_in_one_question		lecture-076=All_sieve_concepts_in_one_question
lecture-077=Bit-manipulation_questions		lecture-077=Bit-manipulation_questions
lecture-078=Inclusion_exclusion		lecture-078=Inclusion_exclusion
lecture-080=Graph_and_trees		lecture-080=Graph_and_trees
lecture-081=Trees_and_graphs_in_code		lecture-081=Trees_and_graphs_in_code
lecture-082=DFS		lecture-082=DFS
lecture-083=Find_connected_components_and_cycle_in_graph		lecture-083=Find_connected_components_and_cycle_in_graph
lecture-084=Solve_graph_matrix_problems_using_DFS		lecture-084=Solve_graph_matrix_problems_using_DFS
lecture-085=DFS_in_tree		lecture-085=DFS_in_tree
lecture-086=Pre_computation_using_DFS		lecture-086=Pre_computation_using_DFS
lecture-087=Find_diameter_of_tree		lecture-087=Find_diameter_of_tree
lecture-088=Find_LCA_in_tree		lecture-088=Find_LCA_in_tree
lecture-089=Edge_deletion_questions_using_DFS		lecture-089=Edge_deletion_questions_using_DFS
lecture-090=BFS		lecture-090=BFS
lecture-091=Find_shortest_path_using_BFS		lecture-091=Find_shortest_path_using_BFS
lecture-092=More_about_BFS		lecture-092=More_about_BFS
lecture-093=Multi_source_BFS		lecture-093=Multi_source_BFS
lecture-094=Dijkstra_algo		lecture-094=Dijkstra_algo
lecture-095=Floyd_warshall_algo		lecture-095=Floyd_warshall_algo
lecture-096=Floyd_warshall_algo_questions		lecture-096=Floyd_warshall_algo_questions
lecture-097=Disjoint_set_union		lecture-097=Disjoint_set_union
lecture-098=DSU_practice_questions		lecture-098=DSU_practice_questions
lecture-099=Kruskal's_algo		lecture-099=Kruskal's_algo
lecture-100=Minimum_spanning_tree_question		lecture-100=Minimum_spanning_tree_question

License

next-step-for-interview-prep/Full-CP-Course_code_and_notes-cpp

Folders and files

Latest commit

History

Repository files navigation

Luv-Competitive_programming_playlist-Code_and_notes-cpp

About

Resources

License

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages