Skip to content
BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

95 Commits
. devcontainer
. devcontainer
 
 
.vscode
.vscode
 
 
.gitattributes
.gitattributes
 
 
.gitignore
.gitignore
 
 
2_sum.cpp
2_sum.cpp
 
 
4_sum.cpp
4_sum.cpp
 
 
A_-_ASCII_code.cpp
A_-_ASCII_code.cpp
 
 
Array_Equality.cpp
Array_Equality.cpp
 
 
Candy_Distribution.cpp
Candy_Distribution.cpp
 
 
Car_Trip.cpp
Car_Trip.cpp
 
 
Creating_Strings_II.cpp
Creating_Strings_II.cpp
 
 
Equalizing_Numbers.cpp
Equalizing_Numbers.cpp
 
 
Greater_Average
Greater_Average
 
 
Greater_Average.cpp
Greater_Average.cpp
 
 
Height_of_Rationals.cpp
Height_of_Rationals.cpp
 
 
LICENSE
LICENSE
 
 
Odd_Pairs.py
Odd_Pairs.py
 
 
README.md
README.md
 
 
Road_Reparation.cpp
Road_Reparation.cpp
 
 
Static_Range_Sum.cpp
Static_Range_Sum.cpp
 
 
Subarray_Sums_II.cpp
Subarray_Sums_II.cpp
 
 
Test_Averages.cpp
Test_Averages.cpp
 
 
Weights.cpp
Weights.cpp
 
 
Young_Physicist_cf.cpp
Young_Physicist_cf.cpp
 
 
add_two_numbers_rep_ll.cpp
add_two_numbers_rep_ll.cpp
 
 
alien_dic.cpp
alien_dic.cpp
 
 
anagram.cpp
anagram.cpp
 
 
best_sightseeing.cpp
best_sightseeing.cpp
 
 
best_time_to_buy_and_sell.cpp
best_time_to_buy_and_sell.cpp
 
 
bike_racing.cpp
bike_racing.cpp
 
 
binary_lifting.cpp
binary_lifting.cpp
 
 
bitwise_and_of_array.cpp
bitwise_and_of_array.cpp
 
 
build_team.cpp
build_team.cpp
 
 
check_a_ll_a_palindrome.cpp
check_a_ll_a_palindrome.cpp
 
 
combination-sum-1.cpp
combination-sum-1.cpp
 
 
combination-sum2.cpp
combination-sum2.cpp
 
 
count_no_of_subarrays.cpp
count_no_of_subarrays.cpp
 
 
count_rooms.cpp
count_rooms.cpp
 
 
delete_given_node.cpp
delete_given_node.cpp
 
 
detect_a_cycle.cpp
detect_a_cycle.cpp
 
 
dynamic_range_minq.cpp
dynamic_range_minq.cpp
 
 
find_kth_permution.cpp
find_kth_permution.cpp
 
 
first_bit_set.cpp
first_bit_set.cpp
 
 
flattening_a_ll.cpp
flattening_a_ll.cpp
 
 
intersection_of_two_ll.cpp
intersection_of_two_ll.cpp
 
 
kanaes_alogrithn.cpp
kanaes_alogrithn.cpp
 
 
largest_subarray_with_0_sum.cpp
largest_subarray_with_0_sum.cpp
 
 
lca.cpp
lca.cpp
 
 
len_of_longest_substring_without_any.cpp
len_of_longest_substring_without_any.cpp
 
 
longest_cons_seq.cpp
longest_cons_seq.cpp
 
 
longest_substring_without_rep.cpp
longest_substring_without_rep.cpp
 
 
median_of_two_sort_array.cpp
median_of_two_sort_array.cpp
 
 
merging_of_ll.cpp
merging_of_ll.cpp
 
 
middle_ll.cpp
middle_ll.cpp
 
 
n-queen.cpp
n-queen.cpp
 
 
next_greater_element
next_greater_element
 
 
next_greater_element.cpp
next_greater_element.cpp
 
 
next_permutation.cpp
next_permutation.cpp
 
 
next_smallest_element
next_smallest_element
 
 
next_smallest_element.cpp
next_smallest_element.cpp
 
 
num_of_pages.cpp
num_of_pages.cpp
 
 
pair_with_given_sum_in_ddl.cpp
pair_with_given_sum_in_ddl.cpp
 
 
palindrome-partition.cpp
palindrome-partition.cpp
 
 
permutation_in_string.cpp
permutation_in_string.cpp
 
 
power_of_number.cpp
power_of_number.cpp
 
 
prime_number.cpp
prime_number.cpp
 
 
print_all_permutation_of_string.cpp
print_all_permutation_of_string.cpp
 
 
product_of_prime.cpp
product_of_prime.cpp
 
 
recursion.cpp
recursion.cpp
 
 
remove_nth_node_ll.cpp
remove_nth_node_ll.cpp
 
 
reverse_ll.cpp
reverse_ll.cpp
 
 
reverse_ll_in_group_of_k.cpp
reverse_ll_in_group_of_k.cpp
 
 
road_construction.cpp
road_construction.cpp
 
 
search_element_in_rsarray.cpp
search_element_in_rsarray.cpp
 
 
search_single_element_sarray.cpp
search_single_element_sarray.cpp
 
 
set_matrix_zero.cpp
set_matrix_zero.cpp
 
 
shortest_path_1.cpp
shortest_path_1.cpp
 
 
sort_array_0s_1s_2s.cpp
sort_array_0s_1s_2s.cpp
 
 
spanning_tree.cpp
spanning_tree.cpp
 
 
startin_point_of_loop_ll.cpp
startin_point_of_loop_ll.cpp
 
 
stock_buy_and_sell.cpp
stock_buy_and_sell.cpp
 
 
subordinates.cpp
subordinates.cpp
 
 
subordinates_undirected.cpp
subordinates_undirected.cpp
 
 
subset-2.cpp
subset-2.cpp
 
 
subset-2_1.cpp
subset-2_1.cpp
 
 
sudoku_solver.cpp
sudoku_solver.cpp
 
 
unionfind.cpp
unionfind.cpp
 
 

Repository files navigation

The code provided as part of this repository is ONLY for learning purposes!

Instructions

  1. Create a code space (reuse if already created):
    1. code -> codespaces -> + button!
  2. Add code in main.c in the main() function.
  3. Use gcc main.c to compile the code.
  4. Execute ./a.out to run the program

Copyright

Copyright © 2023 prabhatravi All Rights Reserved.

About

Competitive Programming Practices

Topics

competitive-codingcompetitive-programming

Resources

Readme
MIT license
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages