Skip to content

2019202009ankush/competetive_programmin_with_stl

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

72 Commits
AppDynamics
AppDynamics
 
 
Atcoder
Atcoder
 
 
Codeforces
Codeforces
 
 
Computaional Geometry
Computaional Geometry
 
 
Dynamic_Programming
Dynamic_Programming
 
 
Graph
Graph
 
 
Linklist_1
Linklist_1
 
 
Number_theory
Number_theory
 
 
array
array
 
 
bit_manipulation
bit_manipulation
 
 
bitmasking
bitmasking
 
 
gameTheory
gameTheory
 
 
google
google
 
 
greedy
greedy
 
 
math
math
 
 
priority_queue_and_map
priority_queue_and_map
 
 
segmentTree
segmentTree
 
 
stack
stack
 
 
string_algorithm
string_algorithm
 
 
super_easy
super_easy
 
 
super_hit_interview_question
super_hit_interview_question
 
 
tree
tree
 
 
trie
trie
 
 
two_pointer
two_pointer
 
 
BellmanFord.cpp
BellmanFord.cpp
 
 
Car Fueling
Car Fueling
 
 
Code_for_DP_Question_Jumping_Japang.cpp
Code_for_DP_Question_Jumping_Japang.cpp
 
 
Disktra_single_source_shortest_path.cpp
Disktra_single_source_shortest_path.cpp
 
 
Floyd_Warshal.cpp
Floyd_Warshal.cpp
 
 
JourneytotheMoon.cpp
JourneytotheMoon.cpp
 
 
Longest Subarray With High median.cpp
Longest Subarray With High median.cpp
 
 
Playing With Words.cpp
Playing With Words.cpp
 
 
Practice_question.txt
Practice_question.txt
 
 
README.md
README.md
 
 
Search word occurence in a sentence.cpp
Search word occurence in a sentence.cpp
 
 
Signature collecting (Covering segments)
Signature collecting (Covering segments)
 
 
Snake Lader code.cpp
Snake Lader code.cpp
 
 
a.out
a.out
 
 
anagram_checking_by_using_encoding.cpp
anagram_checking_by_using_encoding.cpp
 
 
code for least prime divisor.cpp
code for least prime divisor.cpp
 
 
code_for_dp_denomination_effect.cpp
code_for_dp_denomination_effect.cpp
 
 
code_for_dp_jumping_japang.cpp
code_for_dp_jumping_japang.cpp
 
 
difference of (rth_fibonacci)^some_power - (lth_fibonacci)^some_power.cpp
difference of (rth_fibonacci)^some_power - (lth_fibonacci)^some_power.cpp
 
 
find no of pair of node passes through a egde .cpp
find no of pair of node passes through a egde .cpp
 
 
find unknown ith digit in the seq of 1 to 10^12.cpp
find unknown ith digit in the seq of 1 to 10^12.cpp
 
 
invoker_connected_matrix_simple_approach.cpp
invoker_connected_matrix_simple_approach.cpp
 
 
ncr_mod_combinatorics.cpp
ncr_mod_combinatorics.cpp
 
 
possiblepairs.cpp
possiblepairs.cpp
 
 
roads_and_libraries.cpp
roads_and_libraries.cpp
 
 
template.cpp
template.cpp
 
 

Repository files navigation

competetive_programmin_with_stl

Competetive Programming

Welcome to the competitive_programming_with_stl wiki! If you want to contribute then do the following steps-

First fork



Then before uploading any file make sure you write the following thing on the top of your code 
/* Program Name 
Written by: Your Name 
Date: today_date Time: today_time*/



Make the pull request

About

Competetive Programming

Resources

Readme
Activity

Stars

4 stars

Watchers

2 watching

Forks

5 forks
Report repository

Releases

No releases published

Packages

No packages published

Contributors 3

  •  
  •  
  •  

Languages