Explore tweets tagged as #200daysofcodechallenge
Day 133: TUF+ Q. Combination Sum II (using recursion and a for loop to handle duplicates) #200daysofcodechallenge #connect
5
1
18
Day 144: TUF+ Q. Maximum Depth in BT (Recursive and Iterative) #200daysofcodechallenge #connect
2
0
8
Day 141: TUF+ Q. Postorder Traversal (recursive) Binary Trees shuru kardiya #200daysofcodechallenge #connect
3
0
5
Day 146: TUF+ Q. Maximum path sum (similar logic as yesterday's problem) #200daysofcodechallenge #connect
3
0
11
Day 135: TUF+ Q. Letter Combinations of a Phone Number (recursion) #200daysofcodechallenge #connect
0
0
3
Day 132: TUF+ Q. Power Set (recursion) Q. Count all subsequences with sum K (recursion) #200daysofcodechallenge #connect
0
0
6
Day 148: TUF+ Q. Bottom view of BT (using BFS) Q. Right/Left View of BT (using modified preorder traversal - root right left) #200daysofcodechallenge #connect
7
0
10
Day 134: TUF+ Q. Subsets II (using recursion. Can be solved with set but it's a long process so without set is preferred) #200daysofcodechallenge #connect
1
0
7
Day 149: TUF+ Q. Print root to node path in BT (using DFS - Preorder) Q. LCA in BT (using recursion and return logic) #200daysofcodechallenge #connect
1
0
7
Day 145: TUF+ Q. Check for balanced binary tree (calculate the heights of left and right subtrees and if the difference is greater than one then it's not a balanced tree) #200daysofcodechallenge #connect
0
0
10