Skip to content

dnyaneshwar2023/Competitive-Programming

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

153 Commits
#( Problem B ) Pikachu vs Team Meowstic and Helping Hand - HackerEarth Bit Magic
#( Problem B ) Pikachu vs Team Meowstic and Helping Hand - HackerEarth Bit Magic
 
 
* Prefix Number <Liv.ai> - Z-Algorithm
* Prefix Number <Liv.ai> - Z-Algorithm
 
 
** Childfree Time !! - Dijkstras Algo + Multisource BFS
** Childfree Time !! - Dijkstras Algo + Multisource BFS
 
 
**Lazy Proagation - Graphs,trees,Policy Based Data Structure**
**Lazy Proagation - Graphs,trees,Policy Based Data Structure**
 
 
*Love for Palindromes - HackerEarth
*Love for Palindromes - HackerEarth
 
 
A Cryst With Chess - Recursion
A Cryst With Chess - Recursion
 
 
A Plane Journey - HackerEarth ( Binary Search )
A Plane Journey - HackerEarth ( Binary Search )
 
 
A or B - HackerRank
A or B - HackerRank
 
 
AND and XOR square Sum (CF global 8)
AND and XOR square Sum (CF global 8)
 
 
AND operation - Bit + DP
AND operation - Bit + DP
 
 
Aaryan, Subsequences And Great XOR - hackerearth
Aaryan, Subsequences And Great XOR - hackerearth
 
 
Amit And Prime Numbers - HackerEarth
Amit And Prime Numbers - HackerEarth
 
 
Apple Division - CSES - Subsequence Generation
Apple Division - CSES - Subsequence Generation
 
 
Balanced Buildings - HackerEarth DP
Balanced Buildings - HackerEarth DP
 
 
Balanced Team - CodeForces 1133C
Balanced Team - CodeForces 1133C
 
 
Binary Search On Float PASC SE-CP 1
Binary Search On Float PASC SE-CP 1
 
 
Binary XOR - Combinetrics - CodeChef
Binary XOR - Combinetrics - CodeChef
 
 
Binomial Coefficients
Binomial Coefficients
 
 
Bitsets C++ Shubham and Subarrays(HackerEarth)
Bitsets C++ Shubham and Subarrays(HackerEarth)
 
 
Book Reading(Easy Version)-CF 653(Div 3)
Book Reading(Easy Version)-CF 653(Div 3)
 
 
Breaking Bridges - HackerEarth DFS
Breaking Bridges - HackerEarth DFS
 
 
Can You Count ? - HackerEarth Strings
Can You Count ? - HackerEarth Strings
 
 
Candies - Binary Search ( HackerEarth)
Candies - Binary Search ( HackerEarth)
 
 
Chat in Circle - Atcoder BC 173 C
Chat in Circle - Atcoder BC 173 C
 
 
Chetan Vs Fauji - HackerEarth (Hash Tables)
Chetan Vs Fauji - HackerEarth (Hash Tables)
 
 
Chocolate Boy - HackerEarth DP
Chocolate Boy - HackerEarth DP
 
 
Chocolate Journey - HackerEarth - Dijkshtra
Chocolate Journey - HackerEarth - Dijkshtra
 
 
Coins(Binary Search - HackerEarth)
Coins(Binary Search - HackerEarth)
 
 
Common Smallest Prime Divisor - HackerEarth
Common Smallest Prime Divisor - HackerEarth
 
 
Convert Linked List to Binary Tree - GFG
Convert Linked List to Binary Tree - GFG
 
 
Cooking Sehdule - CCDSAP (Binary_Search)
Cooking Sehdule - CCDSAP (Binary_Search)
 
 
Count K-Primes - CodeChef
Count K-Primes - CodeChef
 
 
Count The Sum - Euler Totient Function
Count The Sum - Euler Totient Function
 
 
Cyclic Permutations - Z ALGO
Cyclic Permutations - Z ALGO
 
 
D1 - Prefix-Suffix Palindrome (Easy version) - CodeForces - Strings
D1 - Prefix-Suffix Palindrome (Easy version) - CodeForces - Strings
 
 
DP codeforces EDU round 95 C
DP codeforces EDU round 95 C
 
 
Decode String - Stacks GFG
Decode String - Stacks GFG
 
 
Devide the set - CodeChef (Binary Search)
Devide the set - CodeChef (Binary Search)
 
 
Disk Tower - HackerEarth (Priority Queue)
Disk Tower - HackerEarth (Priority Queue)
 
 
EasyPalindrome - Manchar's Algorithm
EasyPalindrome - Manchar's Algorithm
 
 
Eerie Planet - HackerEarth ( Queues)
Eerie Planet - HackerEarth ( Queues)
 
 
Equivalent Strings - CF 559B
Equivalent Strings - CF 559B
 
 
Forest Gathering - CCDSAP (Binary_Search)
Forest Gathering - CCDSAP (Binary_Search)
 
 
Forest Queries - DP CSES Problemset
Forest Queries - DP CSES Problemset
 
 
Forming A Ploygon - HackerEarth Maths
Forming A Ploygon - HackerEarth Maths
 
 
Four with sum 0 - SPOJ
Four with sum 0 - SPOJ
 
 
Fredo and Maths - Fermatts Theorem
Fredo and Maths - Fermatts Theorem
 
 
Funky Numbers - CF 192A Two Pointers
Funky Numbers - CF 192A Two Pointers
 
 
G Force - SPOJ ETF
G Force - SPOJ ETF
 
 
GCD Extreme - Euler Totient Funtion
GCD Extreme - Euler Totient Funtion
 
 
GCD on Directed Graph - Condensation Graphs
GCD on Directed Graph - Condensation Graphs
 
 
GCDEX - Euler Totient Function SPOJ
GCDEX - Euler Totient Function SPOJ
 
 
Game Of Deletion - Bit Magic (HackerEarth)
Game Of Deletion - Bit Magic (HackerEarth)
 
 
Game Of strings - KMP
Game Of strings - KMP
 
 
Golu And Sweetness - Euler Totient Function
Golu And Sweetness - Euler Totient Function
 
 
Highest Average
Highest Average
 
 
Huffman Encoding
Huffman Encoding
 
 
I demand a trial by combat (Xor In ranges) (Bit Magic + DP)
I demand a trial by combat (Xor In ranges) (Bit Magic + DP)
 
 
Infinite Arrays - HackerEarth
Infinite Arrays - HackerEarth
 
 
Infix to Postfix Using Stack
Infix to Postfix Using Stack
 
 
Jack's Crush - DFS, Coloring
Jack's Crush - DFS, Coloring
 
 
Jumpy Humpy - HackerEarth (Dynamic Programming , Stacks )
Jumpy Humpy - HackerEarth (Dynamic Programming , Stacks )
 
 
Just Shortest Distance Peoblem - BFS
Just Shortest Distance Peoblem - BFS
 
 
KMP_Algorithm Implementation C++
KMP_Algorithm Implementation C++
 
 
LCA Queries on Trees - HackerEarth Trees
LCA Queries on Trees - HackerEarth Trees
 
 
LCM SUM - Euler Totient Function
LCM SUM - Euler Totient Function
 
 
Largest Lexicographical Rotation - Hackerearth Strings - Booth's Algo
Largest Lexicographical Rotation - Hackerearth Strings - Booth's Algo
 
 
Largest Rectangle In Histogram - Hackerrank
Largest Rectangle In Histogram - Hackerrank
 
 
Longest Increasing Subsequence - Binary Search
Longest Increasing Subsequence - Binary Search
 
 
Longest Prefix present as Subsequence
Longest Prefix present as Subsequence
 
 
Longest Subarray with 2 distinct Elements - Hackerrank Test
Longest Subarray with 2 distinct Elements - Hackerrank Test
 
 
Longest Substring without repeating characters - Leetcode
Longest Substring without repeating characters - Leetcode
 
 
Longets Non-Palindromic Substring- HackerEarth
Longets Non-Palindromic Substring- HackerEarth
 
 
Lowest Sum - CCDSAP ( Binary Search)
Lowest Sum - CCDSAP ( Binary Search)
 
 
Manchar's Algorithm - CODE
Manchar's Algorithm - CODE
 
 
Maximum AND CC JUNELTIME - Bit Manipulation
Maximum AND CC JUNELTIME - Bit Manipulation
 
 
Maximum Of K-Sized Subarrays - HackerEarth(DEQUE)
Maximum Of K-Sized Subarrays - HackerEarth(DEQUE)
 
 
Maximum Sized Square formed in 01 Matrix
Maximum Sized Square formed in 01 Matrix
 
 
Monk and Master - HackerEarth - KMP+DP
Monk and Master - HackerEarth - KMP+DP
 
 
Monk and Prisoner of Azkaban- HackerEarth(Stacks)
Monk and Prisoner of Azkaban- HackerEarth(Stacks)
 
 
Monk and Special Integer - HackerEarth(Binary Search)
Monk and Special Integer - HackerEarth(Binary Search)
 
 
Monk's Encounter With Polynomial - Binary Search (HackerEarth)
Monk's Encounter With Polynomial - Binary Search (HackerEarth)
 
 
N Queens - BackTracking
N Queens - BackTracking
 
 
N th Fibonacci
N th Fibonacci
 
 
Nanachi And Euler Totient
Nanachi And Euler Totient
 
 
Nice Queries ( Hash Tables - HackerEarth)
Nice Queries ( Hash Tables - HackerEarth)
 
 
Non - Intersecting Subsequences - HackerEarth DP
Non - Intersecting Subsequences - HackerEarth DP
 
 
Non-Square Equation - CodeForces Binary Search
Non-Square Equation - CodeForces Binary Search
 
 
Number Of Turns - Binary Tree GFG Practice
Number Of Turns - Binary Tree GFG Practice
 
 
Number Of paths with K coins
Number Of paths with K coins
 
 
Numerical Armageddon Round 1 - HackerEarth DP
Numerical Armageddon Round 1 - HackerEarth DP
 
 
Odd-Even Subarrays - HackerEarth DP
Odd-Even Subarrays - HackerEarth DP
 
 
Odd-Even Subsequence (CF #651-D Binary Search)
Odd-Even Subsequence (CF #651-D Binary Search)
 
 
Optimal Stratergy for Game - DP
Optimal Stratergy for Game - DP
 
 
Partition into k Equal Sum Subsets - Leetcode
Partition into k Equal Sum Subsets - Leetcode
 
 
Permutation of String
Permutation of String
 
 
Phone Number Combinations
Phone Number Combinations
 
 
Pikachu And Champions - LCA
Pikachu And Champions - LCA
 
 
Playing With GCD - Spoj Euler TF
Playing With GCD - Spoj Euler TF
 
 
Polo the Penguin and Strings - CodeForces Greedy
Polo the Penguin and Strings - CodeForces Greedy
 
 

Repository files navigation

Competitive-Programming

Contains Some Important Submissions that have explored

People can revise CP concepts by reviewing some standard problems submissions on different Competitive Programming platforms.

// Updating New

About

Contains Some Important Submissions that have explored

Resources

Readme
Activity

Stars

0 stars

Watchers

0 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages