Leetcode - Google Phone Mock 5

Author: Partho Biswas

leetcode.com/python/222_Count_Complete_Tree_Nodes.py

@@ -6,7 +6,6 @@
 #         self.right = None
 
 class Solution(object):
-
     def countDepth(self, node):
         depth = 0
         while node.left:
@@ -45,3 +44,17 @@ def countNodes(self, root):
                 right = pivot - 1
         return (2 ** depth - 1) + left
 
+
+# My solution during Leetcode Mock Interview
+class Solution(object):
+    def countNodes(self, root):
+        """
+        :type root: TreeNode
+        :rtype: int
+        """
+        if not root:
+            return 0
+        leftCount = self.countNodes(root.left)
+        rightCount = self.countNodes(root.right)
+        totalCount = leftCount + 1 + rightCount
+        return totalCount

leetcode.com/python/562_Longest_Line_of_Consecutive_One_in_Matrix.py

@@ -136,3 +136,30 @@ def longestLine(self, M):
                     maxOnes = max([maxOnes, dp[rowIdx][colIdx][0], dp[rowIdx][colIdx][1], dp[rowIdx][colIdx][2], dp[rowIdx][colIdx][3]])
 
         return maxOnes
+
+
+# My solutions during Leetcode Mock Interview
+class Solution(object):
+    def longestLine(self, M):
+        """
+        :type M: List[List[int]]
+        :rtype: int
+        """
+        if not M:
+            return 0
+
+        dp = [[[0, 0, 0, 0] for _ in range(len(M[0]) + 2)] for _ in range(len(M) + 1)]
+        maxLen = 0
+        for i in range(1, len(M) + 1):
+            for j in range(1, len(M[0]) + 1):
+                if M[i - 1][j - 1] == 1:
+                    ho = dp[i][j - 1][0] + 1
+                    vt = dp[i - 1][j][1] + 1
+                    di = dp[i - 1][j - 1][2] + 1
+                    ad = dp[i - 1][j + 1][3] + 1
+                    lineLengths = [ho, vt, di, ad]
+                    dp[i][j] = lineLengths
+                    currentMaxLen = max(lineLengths)
+                    maxLen = max(maxLen, currentMaxLen)
+        # print("DP: ", dp)
+        return maxLen

leetcode.com/python/844_Backspace_String_Compare.py

@@ -1,4 +1,3 @@
-
 # O(N + N)  time |  # O(N + N)  space
 class Solution(object):
     def backspaceCompare(self, S, T):
@@ -20,10 +19,6 @@ def getOriginalString(self, givenStr):
         return "".join(originalStr)
 
 
-
-
-
-
 # O(N + N)  time |  # O(1)  space -- Two Pointer solution
 class Solution(object):
     def backspaceCompare(self, S, T):
@@ -62,3 +57,28 @@ def getNextValidCharIndex(self, givenStr, givenIndex):
 
 
 
+# My solution during Leetcode Mock Interview
+class Solution(object):
+    def backspaceCompare(self, S, T):
+        """
+        :type S: str
+        :type T: str
+        :rtype: bool
+        """
+        sV = []
+        for sc in S:
+            if sc == "#":
+                if sV and len(sV) > 0:
+                    sV.pop()
+            else:
+                sV.append(sc)
+
+        tV = []
+        for tc in T:
+            if tc == "#":
+                if tV and len(tV) > 0:
+                    tV.pop()
+            else:
+                tV.append(tc)
+
+        return "".join(sV) == "".join(tV)