Skip to content

iam-ss/Competitive-Programming-Problems

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

85 Commits
Classic Algos
Classic Algos
 
 
Editorials
Editorials
 
 
2D KADANE.cpp
2D KADANE.cpp
 
 
BIT - EASY - VISA CODESPRINT.cpp
BIT - EASY - VISA CODESPRINT.cpp
 
 
BITMASKING - MEDIUM- HACKERRANK HIRING CONTEST- WINNING LOTTERY TICKET.cpp
BITMASKING - MEDIUM- HACKERRANK HIRING CONTEST- WINNING LOTTERY TICKET.cpp
 
 
BITSET(MEDIUM) - CODEFORCES ER37.cpp
BITSET(MEDIUM) - CODEFORCES ER37.cpp
 
 
BOX STACKING PROBLEM - DP(MEDIUM) - HACKERBLOCKS.cpp
BOX STACKING PROBLEM - DP(MEDIUM) - HACKERBLOCKS.cpp
 
 
BUYING FRUITS - DP(1) - CODING BLOCKS.cpp
BUYING FRUITS - DP(1) - CODING BLOCKS.cpp
 
 
Boredom.cpp
Boredom.cpp
 
 
CARDS GAME- MST - ADVANCED - GOOGLE KICKSTART.cpp
CARDS GAME- MST - ADVANCED - GOOGLE KICKSTART.cpp
 
 
CATCH THEM ALL - GRAPH+PROBABILITY (TO DO) - KICKSTART.cpp
CATCH THEM ALL - GRAPH+PROBABILITY (TO DO) - KICKSTART.cpp
 
 
COMBINATORIAL PALINDROME - MEDIUM - HACKERRANK HOURRANK.cpp
COMBINATORIAL PALINDROME - MEDIUM - HACKERRANK HOURRANK.cpp
 
 
CONSTRUCT UNIQUE NXN MATRIX WITH 1s PLACED AT ALL POSSIBLE DISTANCES FROM THE CENTRE.cpp
CONSTRUCT UNIQUE NXN MATRIX WITH 1s PLACED AT ALL POSSIBLE DISTANCES FROM THE CENTRE.cpp
 
 
Coupon Collector Problem- CODING BLOCKS - COMBINATORICS (2).cpp
Coupon Collector Problem- CODING BLOCKS - COMBINATORICS (2).cpp
 
 
Crossing Blocks Game - HACKERBLOCKS.cpp
Crossing Blocks Game - HACKERBLOCKS.cpp
 
 
DANCE BATTLE - ADHOC(MEDIUM) - KICKSTART.cpp
DANCE BATTLE - ADHOC(MEDIUM) - KICKSTART.cpp
 
 
DIJIKSTRA(ADVANCED) - CODEFIGHTS.cpp
DIJIKSTRA(ADVANCED) - CODEFIGHTS.cpp
 
 
DISCOUNT AT CODING BLOCKS.cpp
DISCOUNT AT CODING BLOCKS.cpp
 
 
DP - MEDIUM - ADOBE - COST OF MERGING STRING.cpp
DP - MEDIUM - ADOBE - COST OF MERGING STRING.cpp
 
 
DP - MEDIUM - VISA CHECKSUM PROBLEM.cpp
DP - MEDIUM - VISA CHECKSUM PROBLEM.cpp
 
 
DP Medium codemonk v2.cpp
DP Medium codemonk v2.cpp
 
 
DP(EASY) - MATRIX CHAINING - GEEKS.cpp
DP(EASY) - MATRIX CHAINING - GEEKS.cpp
 
 
DSUBasic.cpp
DSUBasic.cpp
 
 
DUPLICATE PERMUTATIONS - BACKTRACKING - CODING BLOCKS.cpp
DUPLICATE PERMUTATIONS - BACKTRACKING - CODING BLOCKS.cpp
 
 
EAT CAKE - DP(EASY) - KICKSTART.cpp
EAT CAKE - DP(EASY) - KICKSTART.cpp
 
 
Expand the pond.cpp
Expand the pond.cpp
 
 
Expectation - RANDOM QUERY - CODING BLOCKS .cpp
Expectation - RANDOM QUERY - CODING BLOCKS .cpp
 
 
FRIENDS AT CODING BLOCKS - BITMASKING - DP - HACKERBLOCKS.cpp
FRIENDS AT CODING BLOCKS - BITMASKING - DP - HACKERBLOCKS.cpp
 
 
GRAPHS(MEDIUM) - CODEAGON - COUNTING PRINCESS PRESENTS.cpp
GRAPHS(MEDIUM) - CODEAGON - COUNTING PRINCESS PRESENTS.cpp
 
 
GYM IN CODING BLOCKS - DP(MEDIUM-HARD) - HACKERBLOCKS.cpp
GYM IN CODING BLOCKS - DP(MEDIUM-HARD) - HACKERBLOCKS.cpp
 
 
HASHMAP - ADVANCED - HACKER EARTH HIRING - ARRAYS AND QUERIES.cpp
HASHMAP - ADVANCED - HACKER EARTH HIRING - ARRAYS AND QUERIES.cpp
 
 
HOLI - SPOJ-HACKERBLOCKS - GRAPHS - MEDIUM.cpp
HOLI - SPOJ-HACKERBLOCKS - GRAPHS - MEDIUM.cpp
 
 
HOODIES AT CODING BLOCKS - QUEUES - HACKERBLOCKS.cpp
HOODIES AT CODING BLOCKS - QUEUES - HACKERBLOCKS.cpp
 
 
KICKSORT - ADHO(MEDIUM) - KICKSTART.cpp
KICKSORT - ADHO(MEDIUM) - KICKSTART.cpp
 
 
KICKSTART - PRACTICE - 2018 - 1.CPP
KICKSTART - PRACTICE - 2018 - 1.CPP
 
 
KICKSTART - PRACTICE - 2018 - 2.CPP
KICKSTART - PRACTICE - 2018 - 2.CPP
 
 
KICKSTART - PRACTICE - 2018 - 3.CPP
KICKSTART - PRACTICE - 2018 - 3.CPP
 
 
KILL THE BIRDS - DP(2) - CODING BLOCKS.cpp
KILL THE BIRDS - DP(2) - CODING BLOCKS.cpp
 
 
KMP.cpp
KMP.cpp
 
 
LIMITED BUDGET PARTY - ARRAY - TWO POINTERS - HACKERBLOCKS.cpp
LIMITED BUDGET PARTY - ARRAY - TWO POINTERS - HACKERBLOCKS.cpp
 
 
LINKED LIST (ADVANCED) - ADD TWO HUGE NUMBERS. - CODEFIGHTS.cpp
LINKED LIST (ADVANCED) - ADD TWO HUGE NUMBERS. - CODEFIGHTS.cpp
 
 
LITTLE VIPUL AND HIS QUERIES.cpp
LITTLE VIPUL AND HIS QUERIES.cpp
 
 
MATH - MEDIUM - HACKERRANK HIRING - THE SIMPLEST SUM.cpp
MATH - MEDIUM - HACKERRANK HIRING - THE SIMPLEST SUM.cpp
 
 
MATH DAY - MODULAR EXPONENTIATION - HACKERBLOCKS.cpp
MATH DAY - MODULAR EXPONENTIATION - HACKERBLOCKS.cpp
 
 
MATRIX CUTTING - DP(EASY)- KICKSTART.cpp
MATRIX CUTTING - DP(EASY)- KICKSTART.cpp
 
 
MATRIX FLIP - ADHOC - HACKERBLOCKS.cpp
MATRIX FLIP - ADHOC - HACKERBLOCKS.cpp
 
 
MATRIX SEARCH - LINEAR SEARCH - CODING BLOCKS.cpp
MATRIX SEARCH - LINEAR SEARCH - CODING BLOCKS.cpp
 
 
MAXIMUM SUM SUBARRAY - 2D KADANE - HACKERBLOCKS.cpp
MAXIMUM SUM SUBARRAY - 2D KADANE - HACKERBLOCKS.cpp
 
 
MIN STRING - DP(HARD) - CODING BLOCKS.CPP
MIN STRING - DP(HARD) - CODING BLOCKS.CPP
 
 
MO's ALGORITHM - DQUERY - SPOJ.cpp
MO's ALGORITHM - DQUERY - SPOJ.cpp
 
 
MODULO SUM- CODING BLOCKS - DP(1).cpp
MODULO SUM- CODING BLOCKS - DP(1).cpp
 
 
MONEY CHANGE - DP (EASY) - CODING BLOCKS.cpp
MONEY CHANGE - DP (EASY) - CODING BLOCKS.cpp
 
 
MURTHAL PARANTHA - BINARY SEARCH - CODING BLOCKS.cpp
MURTHAL PARANTHA - BINARY SEARCH - CODING BLOCKS.cpp
 
 
Neighbouring Enemy -DP(Easy) -CODING BLOCKS.cpp
Neighbouring Enemy -DP(Easy) -CODING BLOCKS.cpp
 
 
PAINTER'S PARTITION PROBLEM - BINARY SEARCH - CODEBLOCKS.cpp
PAINTER'S PARTITION PROBLEM - BINARY SEARCH - CODEBLOCKS.cpp
 
 
PAIR OF ROSES - BINARY SEARCH - CODING BLOCKS.cpp
PAIR OF ROSES - BINARY SEARCH - CODING BLOCKS.cpp
 
 
PARTNERS - STACKS - EASY - HACKERBLOCKS.cpp
PARTNERS - STACKS - EASY - HACKERBLOCKS.cpp
 
 
PIRATES AND THEIR CHESTS.cpp
PIRATES AND THEIR CHESTS.cpp
 
 
PLACING THE TILES - DP - CODING BLOCKS.cpp
PLACING THE TILES - DP - CODING BLOCKS.cpp
 
 
QUEST FOR CODING BLOCK TSHIRTS.cpp
QUEST FOR CODING BLOCK TSHIRTS.cpp
 
 
README.md
README.md
 
 
REGEX MATCHING - DP(MEDIUM) - HACKERBLOCKS.cpp
REGEX MATCHING - DP(MEDIUM) - HACKERBLOCKS.cpp
 
 
ROTATE THE MATRIX - ADHOC - HACKERBLOCKS.cpp
ROTATE THE MATRIX - ADHOC - HACKERBLOCKS.cpp
 
 
SCRABBLING THE BITS - BIT MANIPULATION - HACKERBLOCKS - EASY.cpp
SCRABBLING THE BITS - BIT MANIPULATION - HACKERBLOCKS - EASY.cpp
 
 
SEGMENT TREE (MEDIUM) - CHEF AND SUBARRAY QUERIES.cpp
SEGMENT TREE (MEDIUM) - CHEF AND SUBARRAY QUERIES.cpp
 
 
SEGMENT TREE (MEDIUM) - HACEKREARTH - ADOBE CODIVA - MINI-MAXI QUERIES.cpp
SEGMENT TREE (MEDIUM) - HACEKREARTH - ADOBE CODIVA - MINI-MAXI QUERIES.cpp
 
 
SEGMENT TREE + MATHS (MEDIUM) - SUM AND REPLACE - CODEFORCES 920F.cpp
SEGMENT TREE + MATHS (MEDIUM) - SUM AND REPLACE - CODEFORCES 920F.cpp
 
 
SEGMENT TREE + MATHS (MEDIUM) - SUM AND REPLACE - CODEFORCES ER37F.cpp
SEGMENT TREE + MATHS (MEDIUM) - SUM AND REPLACE - CODEFORCES ER37F.cpp
 
 
SEQ - CODING BLOCKS - MATRIX EXPONENTIATION(1).cpp
SEQ - CODING BLOCKS - MATRIX EXPONENTIATION(1).cpp
 
 
SIMPLE ENOUGH - DnC-Adhoc - HACKERBLOCKS.cpp
SIMPLE ENOUGH - DnC-Adhoc - HACKERBLOCKS.cpp
 
 
SINGHAM AND HIS LOVE FOR LADDUS.cpp
SINGHAM AND HIS LOVE FOR LADDUS.cpp
 
 
SINGHAM AND HIS NEED FOR MONEY.cpp
SINGHAM AND HIS NEED FOR MONEY.cpp
 
 
SINGHAM AND MAZE - DP - HACKERBLOCKS.cpp
SINGHAM AND MAZE - DP - HACKERBLOCKS.cpp
 
 
SITTING ARRANGEMENT AT CODING BLOCKS.cpp
SITTING ARRANGEMENT AT CODING BLOCKS.cpp
 
 
STACK - EASY - VISA CODESPRINT.cpp
STACK - EASY - VISA CODESPRINT.cpp
 
 
SUM IT UP- RECURSION - HACKERBLOCKS.cpp
SUM IT UP- RECURSION - HACKERBLOCKS.cpp
 
 
SWAP SWAP - SEGMENT TREES - HACKERBLOCKS(HARD).cpp
SWAP SWAP - SEGMENT TREES - HACKERBLOCKS(HARD).cpp
 
 
String Subsequences - CODING BLOCKS - DP(3) - PROBLEM NOT SUBMITTED.cpp
String Subsequences - CODING BLOCKS - DP(3) - PROBLEM NOT SUBMITTED.cpp
 
 
String Subsequences - CODING BLOCKS - DP(3).cpp
String Subsequences - CODING BLOCKS - DP(3).cpp
 
 
String Subsequences.cpp
String Subsequences.cpp
 
 
THE ABSOLUTE SUM FUNCTION - DP(MEDIUM) - HACKERBLOCKS.cpp
THE ABSOLUTE SUM FUNCTION - DP(MEDIUM) - HACKERBLOCKS.cpp
 
 
THE BEST NUMBER - BIT MANIPULATION - EASY- CODING BLOCKS.cpp
THE BEST NUMBER - BIT MANIPULATION - EASY- CODING BLOCKS.cpp
 
 
THE CODING BLOCKS TRIO - BITMASKING - DP(MEDIUM).cpp
THE CODING BLOCKS TRIO - BITMASKING - DP(MEDIUM).cpp
 
 
THE PIRATES AND THEIR CHESTS.cpp
THE PIRATES AND THEIR CHESTS.cpp
 
 
TILLING PROBLEM - II.cpp
TILLING PROBLEM - II.cpp
 
 
TREE DECOMPOSITION - HLD(ADVANCED) - HACKERBLOCKS.cpp
TREE DECOMPOSITION - HLD(ADVANCED) - HACKERBLOCKS.cpp
 
 
TREE TRAVERSAL (ADVANCED) - RESTORE TREE USING INORDER AND PREORDER WITHOUT RECURSION - CODEFIGHTS.cpp
TREE TRAVERSAL (ADVANCED) - RESTORE TREE USING INORDER AND PREORDER WITHOUT RECURSION - CODEFIGHTS.cpp
 
 
TRIE (ADVANCED) - CODEFIGHTS(findSubstrings).cpp
TRIE (ADVANCED) - CODEFIGHTS(findSubstrings).cpp
 
 
Test Case Generator.cpp
Test Case Generator.cpp
 
 
VIPUL AND HIS LOVE FOR STRINGS - DP(HARD) - CODING BLOCKS.cpp
VIPUL AND HIS LOVE FOR STRINGS - DP(HARD) - CODING BLOCKS.cpp
 
 
VIPULS REDMI 4 - DP(ADVNACED) - HACKERBLOCKS.cpp
VIPULS REDMI 4 - DP(ADVNACED) - HACKERBLOCKS.cpp
 
 
WILDCARD PATTERN MATCHING - DP(MEDIUM) - HACKERBLOCKS.cpp
WILDCARD PATTERN MATCHING - DP(MEDIUM) - HACKERBLOCKS.cpp
 
 
WILDCARD PATTERN MATCHING - DP(MEDIUM).cpp
WILDCARD PATTERN MATCHING - DP(MEDIUM).cpp
 
 
WINTER VACATIONS - HACKERBLOCKS - DP
WINTER VACATIONS - HACKERBLOCKS - DP
 
 
WINTER VACATIONS - HACKERBLOCKS - DP(EASY).cpp
WINTER VACATIONS - HACKERBLOCKS - DP(EASY).cpp
 
 
XORED ARRANGEMENT.cpp
XORED ARRANGEMENT.cpp
 
 
count Permutations of BST.cpp
count Permutations of BST.cpp
 
 
graph medium codeagon 2.cpp
graph medium codeagon 2.cpp
 
 
graph medium codeagon.cpp
graph medium codeagon.cpp
 
 
input.txt
input.txt
 
 

Repository files navigation

Competitive Programming -Problems

Contains the solution for the Competitive Programming problems

About

Contains the solution for the competitive problems

Resources

Readme
Activity

Stars

12 stars

Watchers

4 watching

Forks

20 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages