sji

https://leetcode.com/problems/implement-magic-dictionary/ Implement Magic Dictionary - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com check whether the word made by flipping one charater of given word exists in the dictionary 500ms (Terrible solution) class TreeNode: def __init__(..

https://leetcode.com/problems/maximum-width-of-binary-tree/ Maximum Width of Binary Tree - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com root -> left (x2) root -> right (x2 +1) 44ms # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, righ..

https://leetcode.com/problems/maximum-binary-tree/ Maximum Binary Tree - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 1. find max & make it as a root 2. split array 3. repeat on splited array (left child / right child) 350ms # Definition for a binary tree node. # class TreeNode:..