GitHub - Eshita0210/-CCC-HackerRank-Codes: Coding Practice Questions

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 55 Commits
An array of Non zero.py		An array of Non zero.py
Are the rooms enough ?		Are the rooms enough ?
CC 201 - Unicell Division.py		CC 201 - Unicell Division.py
CC 302 - Into the Forest.py		CC 302 - Into the Forest.py
CC 303 - Time = Speed x Distance.py		CC 303 - Time = Speed x Distance.py
CC 304 - Time = Distance x Speed.py		CC 304 - Time = Distance x Speed.py
CCT A6 - Toad Jumps.cpp		CCT A6 - Toad Jumps.cpp
CCT B2 - Maze and co-ordinates.cpp		CCT B2 - Maze and co-ordinates.cpp
Castles and Jealousy.cpp		Castles and Jealousy.cpp
Coins and Kefa.c		Coins and Kefa.c
Count the Lower elements.py		Count the Lower elements.py
DP A1 Similarities Between Sequences.py		DP A1 Similarities Between Sequences.py
DP A2 Converting a Sequence to Another.py		DP A2 Converting a Sequence to Another.py
DP B1 More Similarities Between Sequences..py		DP B1 More Similarities Between Sequences..py
DP B2 Converting a Sequence to Another - 2.py		DP B2 Converting a Sequence to Another - 2.py
E05 - The Lower Case Letters.py		E05 - The Lower Case Letters.py
Eat Less.c		Eat Less.c
Empty Tank.py		Empty Tank.py
Fractions of Gold.py		Fractions of Gold.py
G 302 - Maze and repeat.cpp		G 302 - Maze and repeat.cpp
G 303 Maze Entry - Maze Exit.cpp		G 303 Maze Entry - Maze Exit.cpp
G 304 Maximizing Special Nodes.cpp		G 304 Maximizing Special Nodes.cpp
G 305 Can you reach them?.py		G 305 Can you reach them?.py
Greedy Florist.py		Greedy Florist.py
Greedy Raynishi.cpp		Greedy Raynishi.cpp
Highest Possible Product.c		Highest Possible Product.c
How to win Submission.cpp		How to win Submission.cpp
I M07 - Discover the Substring.py		I M07 - Discover the Substring.py
Jaime and the Tailor.cpp		Jaime and the Tailor.cpp
K-Divisibility of an Array.py		K-Divisibility of an Array.py
Maximum Sum in an Array.java		Maximum Sum in an Array.java
Mice reach the home.c		Mice reach the home.c
N 502 - Dual match.py		N 502 - Dual match.py
Petya's Move.py		Petya's Move.py
Pucca and the card game.cpp		Pucca and the card game.cpp
Replace the Array.py		Replace the Array.py
Reversal of the ranks.py		Reversal of the ranks.py
S 501 : MAXIMUM SUBARRAY SUM.py		S 501 : MAXIMUM SUBARRAY SUM.py
S 502 : Ways to Decode.py		S 502 : Ways to Decode.py
Salary Details.py		Salary Details.py
Shall we Merge.py		Shall we Merge.py
Strength of 1s in unity.py		Strength of 1s in unity.py
T 101 : Gunpreet and Stairs.py		T 101 : Gunpreet and Stairs.py
T 102 : Interesting Series.py		T 102 : Interesting Series.py
T 109 High rated child.py		T 109 High rated child.py
Task Scheduling 1.py		Task Scheduling 1.py
Task Scheduling 2.py		Task Scheduling 2.py
Ted Mobsy and Candies.py		Ted Mobsy and Candies.py
The Bag of Gold Again.py		The Bag of Gold Again.py
Un ordered pairs		Un ordered pairs
Z 301 Factorials Modding.py		Z 301 Factorials Modding.py
Z 550 String Repetition.cpp		Z 550 String Repetition.cpp
Z 560 : N Queens!.cpp		Z 560 : N Queens!.cpp