Uber | Phone Screen | Symmetric Tree and Subarray with atmost k odd elements
Anonymous User
705
UberPhone ScreeningInterview

  1. Given a binary tree, check whether it is a mirror of itself.
    https://leetcode.com/problems/symmetric-tree/

  2. Given an array find the number of distinct subarrays with atmost k odd elements
    https://leetcode.com/discuss/interview-question/278341/Uber-or-Phone-Screen-or-Distinct-subarrays-with-at-most-k-odd-elements

Comments (1)