Yahoo India Web Search

Sign In

Search results

  1. leetcode.com › problems › binary-tree-level-order-traversal102. Binary Tree Level Order Traversal - LeetCode

    Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). Example 1: Input: root = [3,9,20,null,null,15,7] Output: [[3],[9,20],[15,7]] Example 2: Input: root = [1] Output: [[1]] Example 3: Input: root = []

  2. leetcode.com › solutions › 1188383Binary Tree Level Order Traversal - LeetCode

    Binary Tree Level Order Traversal - LeetCode. Can you solve this real interview question? Binary Tree Level Order Traversal - Level up your coding skills and quickly land a job.

  3. leetcode.com › problems › binary-tree-zigzag-level-order-traversalBinary Tree Zigzag Level Order Traversal - LeetCode

    Binary Tree Zigzag Level Order Traversal - Given the root of a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right, then right to left for the next level and alternate between).

  4. leetcode.com › problems › binary-tree-level-order-traversal-iiBinary Tree Level Order Traversal II - LeetCode

    Binary Tree Level Order Traversal II - Given the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf to root).

  5. leetcode.com › contest › biweekly-contest-102Contest - LeetCode

    Contest - 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.

  6. leetcode.com › problems › symmetric-treeSymmetric Tree - LeetCode

    Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center). Example 1: Input: root = [1,2,2,3,4,4,3] Output: true. Example 2: Input: root = [1,2,2,null,3,null,3] Output: false. Constraints: The number of nodes in the tree is in the range [1, 1000].

  7. leetcode.com › problems › maximum-depth-of-binary-treeMaximum Depth of Binary Tree - LeetCode

    Maximum Depth of Binary Tree - Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Example 1: [https://assets.leetcode.com/uploads/2020/11/26/tmp-tree.jpg] Input: root = [3,9,20,null,null,15,7] Output: 3 Example ...

  8. leetcode.com › problems › complement-of-base-10-integerComplement of Base 10 Integer - LeetCode

    Given an integer n, return its complement. Example 1: Input: n = 5 Output: 2 Explanation: 5 is "101" in binary, with complement "010" in binary, which is 2 in base-10. Example 2: Input: n = 7 Output: 0 Explanation: 7 is "111" in binary, with complement "000" in binary, which is 0 in base-10.

  9. leetcode.com › studyplan › top-interview-150Top Interview 150 - Study Plan - LeetCode

    Summary. 150 Original & Classic Questions. Covers comprehensive interview topics. Best for 3+ months of prep time. Problems support high-quality editorials.

  10. leetcode.com › problemsetProblems - LeetCode

    Boost your coding interview skills and confidence by practicing real interview questions with LeetCode. Our platform offers a range of essential problems for practice, as well as the latest questions being asked by top-tier companies.