Skip to content

Latest commit

 

History

History
 
 

coderrohan14

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
AlternatingSubsequenceCodeForces.java
AlternatingSubsequenceCodeForces.java
 
 
AndPlusOrLunchtime.java
AndPlusOrLunchtime.java
 
 
AvoidingZeroCodeForces.java
AvoidingZeroCodeForces.java
 
 
BInaryTreeToDLL.java
BInaryTreeToDLL.java
 
 
BalancedTree.java
BalancedTree.java
 
 
BinaryTreeToCDLL.java
BinaryTreeToCDLL.java
 
 
CheckSubtree.java
CheckSubtree.java
 
 
ChildrenSumTree.java
ChildrenSumTree.java
 
 
CodeForcesRaifRound1C.java
CodeForcesRaifRound1C.java
 
 
ConnectNodes.java
ConnectNodes.java
 
 
DevuAndHisBrotherCodeforces.java
DevuAndHisBrotherCodeforces.java
 
 
DiamterOfBinaryTree.java
DiamterOfBinaryTree.java
 
 
DistrictsConnectionCodeForces.java
DistrictsConnectionCodeForces.java
 
 
FoldableTree.java
FoldableTree.java
 
 
IdenticalTrees.java
IdenticalTrees.java
 
 
LCABinaryTree.java
LCABinaryTree.java
 
 
LeftViewBinaryTree.java
LeftViewBinaryTree.java
 
 
LineByLineLevelOrder.java
LineByLineLevelOrder.java
 
 
LinkedListToBinaryTree.java
LinkedListToBinaryTree.java
 
 
MarkettingSchemeCodeforces.java
MarkettingSchemeCodeforces.java
 
 
MatrixWaysProblem.java
MatrixWaysProblem.java
 
 
MaxSumSubSeq.java
MaxSumSubSeq.java
 
 
MaximumWIdthOfTree.java
MaximumWIdthOfTree.java
 
 
MirrorTree.java
MirrorTree.java
 
 
MyLinkedList.java
MyLinkedList.java
 
 
NextHappyNo_GFG.java
NextHappyNo_GFG.java
 
 
PrimeSquareCodeforces.java
PrimeSquareCodeforces.java
 
 
README.md
README.md
 
 
ReverseBinaryStringsCodeForces.java
ReverseBinaryStringsCodeForces.java
 
 
RightViewBinaryTree.java
RightViewBinaryTree.java
 
 
SRMNights.java
SRMNights.java
 
 
SpiralTreeTraversal.java
SpiralTreeTraversal.java
 
 
ThrowingRandomNumbersLunchtime.java
ThrowingRandomNumbersLunchtime.java
 
 
TwoRoundDancesCodeforces.java
TwoRoundDancesCodeforces.java
 
 
VerticalWidthBinaryTree.java
VerticalWidthBinaryTree.java
 
 

README.md

Goals :

  1. 5 star at CodeChef rating(2000+).....
  2. Learning DP
  3. Learning about N-ary trees