GitHub - ChandanaBadugu/DSA-CODE: This repository stores all DSA problems practised. 👨‍💻👨‍💻👨‍💻 HAPPY CODING

ChandanaBadugu / DSA-CODE Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

This repository stores all DSA problems practised. 👨‍💻👨‍💻👨‍💻 HAPPY CODING

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 54 Commits
Evaluation of Postfix Expression - GFG		Evaluation of Postfix Expression - GFG
Find Pair Given Difference - GFG		Find Pair Given Difference - GFG
118. Pascal's Triangle.java		118. Pascal's Triangle.java
1791. Find Center of Star Graph.java		1791. Find Center of Star Graph.java
200. Number of Islands.java		200. Number of Islands.java
232. Implement Queue using Stacks.java		232. Implement Queue using Stacks.java
235. Lowest Common Ancestor of a Binary Search Tree.java		235. Lowest Common Ancestor of a Binary Search Tree.java
45. Jump Game II.java		45. Jump Game II.java
53. Maximum Subarray.java		53. Maximum Subarray.java
542. 01 Matrix.java		542. 01 Matrix.java
547. Number of Provinces.java		547. Number of Provinces.java
73. Set Matrix Zeroes.java		73. Set Matrix Zeroes.java
733. Flood Fill.java		733. Flood Fill.java
841. Keys and Rooms.java		841. Keys and Rooms.java
Average of Levels in Binary Tree.java		Average of Levels in Binary Tree.java
BalancedBinaryTree.java		BalancedBinaryTree.java
Binary Tree Level Order Traversal.java		Binary Tree Level Order Traversal.java
Binary Tree Tilt.java		Binary Tree Tilt.java
BinaryTreePostorderTraversal.java		BinaryTreePostorderTraversal.java
BinaryTreePreorderTraversal.java		BinaryTreePreorderTraversal.java
ConcatenatedWords.java		ConcatenatedWords.java
Convert BST to Greater Tree.java		Convert BST to Greater Tree.java
Convert Sorted Array to Binary Search Tree.java		Convert Sorted Array to Binary Search Tree.java
Find Mode in Binary Search Tree.java		Find Mode in Binary Search Tree.java
Increasing Order Search Tree.java		Increasing Order Search Tree.java
Insert into a Binary Search Tree.java		Insert into a Binary Search Tree.java
InvertBinaryTree.java		InvertBinaryTree.java
Kth Smallest Element in a BST.java		Kth Smallest Element in a BST.java
LowestCommonAncestorofaBinary Tree.java		LowestCommonAncestorofaBinary Tree.java
MaximumDepthofBinaryTree.java		MaximumDepthofBinaryTree.java
MaximumWidthofBinaryTree.java		MaximumWidthofBinaryTree.java
MergeTwoBinaryTrees.java		MergeTwoBinaryTrees.java
Minimum Absolute Difference in BST.java		Minimum Absolute Difference in BST.java
Minimum Moves to Equal Array Elements.java		Minimum Moves to Equal Array Elements.java
MinimumDepthofBinaryTree.java		MinimumDepthofBinaryTree.java
N-th Tribonacci Number.java		N-th Tribonacci Number.java
PathSum.java		PathSum.java
Range Sum of BST.java		Range Sum of BST.java
Recover Binary Search Tree.java		Recover Binary Search Tree.java
SearchInsertPosition.java		SearchInsertPosition.java
SearchinaBinarySearchTree.java		SearchinaBinarySearchTree.java
Subtree of Another Tree.java		Subtree of Another Tree.java
Sum of Left Leaves.java		Sum of Left Leaves.java
SymmetricTree.java		SymmetricTree.java
TopView.java		TopView.java
Trim a Binary Search Tree.java		Trim a Binary Search Tree.java
Two Sum IV - Input is a BST.java		Two Sum IV - Input is a BST.java
Validate Binary Search Tree.java		Validate Binary Search Tree.java
Zigzag Conversion.java		Zigzag Conversion.java
binarytreeinordertraversal.java		binarytreeinordertraversal.java
first_unique_character_in_string.java		first_unique_character_in_string.java
sametree.java		sametree.java