Binary Tree Level Order Traversal
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…
Home » leetcode playground »
leetcode playground
Leet Code :Linked List Cycle II Java || Python || C++ solution
Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. There is a cycle in a linked list…
leet Code : Validate Binary Search Tree Java || C++ || C || pYthon
Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: The left subtree of a node…
Leet Code :Running Sum of 1d Array Solution C++ || Python || Java
Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Example 1: Input: nums = [1,2,3,4]…
TCS and Infosys Database , SQL questions | TCS and Infosys Technical Round Question
What is the difference between inner and outer join? Explain with example. Inner Join Inner join is the most common type of Join which is…
- « Previous
- 1
- 2
- 3
