Leetcode 572. Subtree of Another Tree. Python (Recursive)

572. Subtree of Another Tree

Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot and false otherwise.

A subtree of a binary tree tree is a tree that consists of a node in tree and all of this node's descendants. The tree tree could also be considered as a subtree of itself.

Example :

Input: root = [3,4,5,1,2], subRoot = [4,1,2]
Output: true

SOLUTION:

class Solution:
    def isSubtree(self, r: Optional[TreeNode], sr: Optional[TreeNode]) -> bool:
        if not sr: return True
        if not r: return False
        
        if self.sameTree(r,sr):
            return True
        
        return (self.isSubtree(r.left, sr) or
        self.isSubtree(r.right, sr))
    
    def sameTree(self, r, sr):
        if not r and not sr:
            return True
        if r and sr and r.val == sr.val:
            return (self.sameTree(r.left, sr.left) and
            self.sameTree(r.right, sr.right))
        return False

Explaination :

Comments

May-6 2020 Challenge

6. Majority Element Given an array of size n , find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element always exist in the array. Example 1: Input: [3,2,3] Output: 3 Example 2: Input: [2,2,1,1,1,2,2] Output: 2 Solution in Java class Solution { public int majorityElement(int[] num) { int m = num[0], cnt= 1; for (int i = 1; i < num.length; i++) { if (cnt == 0) { m= num[i]; cnt = 1; } else if (num[i] == m) { cnt++; } else cnt--; } return m;...

Leetcode 190. Reverse Bits. Python. Bit Manipulation

190 . Reverse Bits Reverse bits of a given 32 bits unsigned integer. Note: Note that in some languages, such as Java, there is no unsigned integer type. In this case, both input and output will be given as a signed integer type. They should not affect your implementation, as the integer's internal binary representation is the same, whether it is signed or unsigned. In Java, the compiler represents the signed integers using 2's complement notation . Therefore, in Example 2 above, the input represents the signed integer -3 and the output represents the signed integer -1073741825 . Example 1: Input: n = 00000010100101000001111010011100 Output: 964176192 (00111001011110000010100101000000) Explanation: The input binary string 00000010100101000001111010011100 represents the unsigned integer 43261596, so return 964176192 which its binary representation is 00111001011110000010100101000000 . Example 2: Input: n = 11111111111111111111...

Longest Substring Without Repeating Characters - Leetcode 3 - Python

Given a string s, find the length of the longest substring without repeating characters. class Solution: def lengthOfLongestSubstring(self, s: str) -> int: charSet = set() left = 0 ans = 0 for right in range(len(s)): while s[right] in charSet: charSet.remove(s[left]) left+=1 charSet.add(s[right]) ans = max(ans, right-left+1) return ans Explained :

LEETCODE SOLUTIONS

Search This Blog