Skip to content
/ competitive-programming Public

Competitive programming solutions (UVa, LeetCode, codeforces, InterviewBit, etc.).

License

GPL-3.0 license
1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

guilhermedom/competitive-programming

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

48 Commits
.macro_template_for_competitive_programming.cpp
.macro_template_for_competitive_programming.cpp
 
 
LICENSE
LICENSE
 
 
README.md
README.md
 
 
a+b.cpp
a+b.cpp
 
 
ache_o_x.cpp
ache_o_x.cpp
 
 
adivinhe_o_padrao.cpp
adivinhe_o_padrao.cpp
 
 
back_to_the_8-queens.cpp
back_to_the_8-queens.cpp
 
 
bear_and_three_balls.c
bear_and_three_balls.c
 
 
best_time_to_buy_and_sell_stocks.cpp
best_time_to_buy_and_sell_stocks.cpp
 
 
box_stacking.cpp
box_stacking.cpp
 
 
brackets.cpp
brackets.cpp
 
 
cavernoso.cpp
cavernoso.cpp
 
 
collecting_coins.cpp
collecting_coins.cpp
 
 
como_esta_sua_logica.cpp
como_esta_sua_logica.cpp
 
 
da_pra_chegar.cpp
da_pra_chegar.cpp
 
 
da_pra_terminar.cpp
da_pra_terminar.cpp
 
 
da_pra_ver.cpp
da_pra_ver.cpp
 
 
ditongo.cpp
ditongo.cpp
 
 
divisores.cpp
divisores.cpp
 
 
doces.cpp
doces.cpp
 
 
esse_eu_passo.cpp
esse_eu_passo.cpp
 
 
find_two_non_overlapping_sub_arrays_each_with_target_sum.cpp
find_two_non_overlapping_sub_arrays_each_with_target_sum.cpp
 
 
finding_subsets.cpp
finding_subsets.cpp
 
 
football_aka_soccer.cpp
football_aka_soccer.cpp
 
 
generalized_matrioshkas.cpp
generalized_matrioshkas.cpp
 
 
i_can_guess_the_data_structure!.cpp
i_can_guess_the_data_structure!.cpp
 
 
intercaladas.cpp
intercaladas.cpp
 
 
letter_combinations.cpp
letter_combinations.cpp
 
 
longest_increasing_subsequence.cpp
longest_increasing_subsequence.cpp
 
 
maior_impar.cpp
maior_impar.cpp
 
 
mau_carater.cpp
mau_carater.cpp
 
 
maximum_product_subarray.cpp
maximum_product_subarray.cpp
 
 
mega-sena.cpp
mega-sena.cpp
 
 
megasena.cpp
megasena.cpp
 
 
mil_doces.cpp
mil_doces.cpp
 
 
minimum_jumps.cpp
minimum_jumps.cpp
 
 
n_queen.cpp
n_queen.cpp
 
 
nk_ladders.cpp
nk_ladders.cpp
 
 
o_melhor_lugar_de_todos.cpp
o_melhor_lugar_de_todos.cpp
 
 
o_melhor_lugar_de_todos2.cpp
o_melhor_lugar_de_todos2.cpp
 
 
o_melhor_lugar_de_todos3.cpp
o_melhor_lugar_de_todos3.cpp
 
 
o_menor_pulo_de_todos.cpp
o_menor_pulo_de_todos.cpp
 
 
o_numero_minimo_de_acais.cpp
o_numero_minimo_de_acais.cpp
 
 
o_urso_mais_pesado.cpp
o_urso_mais_pesado.cpp
 
 
perfect_squares.cpp
perfect_squares.cpp
 
 
permutations.cpp
permutations.cpp
 
 
power_sum.cpp
power_sum.cpp
 
 
problema_das_mesas.cpp
problema_das_mesas.cpp
 
 
programacao_arte.cpp
programacao_arte.cpp
 
 
recepcao_calorosa.cpp
recepcao_calorosa.cpp
 
 
resistance.c
resistance.c
 
 
sem_par.c
sem_par.c
 
 
simple_equations.cpp
simple_equations.cpp
 
 
such_maths.cpp
such_maths.cpp
 
 
such_money.cpp
such_money.cpp
 
 
sum_it_up.cpp
sum_it_up.cpp
 
 
target_sum.cpp
target_sum.cpp
 
 
tudo_em_ordem.cpp
tudo_em_ordem.cpp
 
 
wertyu.cpp
wertyu.cpp
 
 

Repository files navigation

Competitive Programming Solutions

This is a repository for solutions of popular competitive programming (CP) problems: UVa, LeetCode, Codeforces, InterviewBit and others.

  • For readability and simplicity sake, most solutions do not include competitive programming hacks and related defines.

  • This repository is supposed to be used only as a reference for competitive programming solutions. Avoid copying code from here.

  • Portability, compile time and executable size are not evaluated in competitive programming online judges. Because of this, libraries that serve specific purposes, with narrow scopes, are rarely used. On the other hand, generalistic libraries, such as "bits/stdc++.h", help to speed up the coding process. These libraries are often included in the files under this repository, however, their usage should be avoided out of competitive programming code: they lack portability, increase compile time and make executables larger.

  • Most solutions in here are implemented in C++ for efficiency and more control over memory (bit twiddling with bit operations: and, or, xor, shifiting, complement, masking, etc.). Solutions in other languages can also be found but may be replaced eventually.

  • Some solutions given in here may be encountered on coding interviews, however, this is not a guide. LeetCode, InterviewBit and Coding Interview University can be cited as guides with a complete planning for coding interviews.

About

Competitive programming solutions (UVa, LeetCode, codeforces, InterviewBit, etc.).

Topics

algorithms leetcode competitive-programming data-structures uva-solutions codeforces-solutions

Resources

Readme

License

GPL-3.0 license
Activity

Stars

1 star

Watchers

2 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages