Day 5/100 of #100DaysOfCode
POTD:
Leetcode: "1161. Maximum Level Sum of a Binary Tree"
GFG: "Max Xor Subarray of size K"
Problem solved: (DP Practice)
• 1143. Longest Common Subsequence
• 300. Longest Increasing Subsequence
• 72. Edit Distance
Day 2/100 of #100DaysOfCode
POTD:
• Leetcode: "961. N-Repeated Element in Size 2N Array"
• GFG: "Sort 0s,1s and 2s"
Topic learned:
• Topological sorting:
- using DFS
- using BFS (kahn's algorithm)
• Problem solved:
- Leetcode 210: Course Schedule II
@vk_a_coder Keep focusing on basics fundamentals like conditionals , loops , functions. Also keep doing dry run after each code that will provide you more clarity of code. And most important keep consistency!! All the best brother!!