leetcode patterns

Leet Code :Linked List Cycle II Java || Python || C++ solution

leetcode question 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 if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail’s next pointer is connected […]

Leet Code :Linked List Cycle II Java || Python || C++ solution Read More »

leet Code : Validate Binary Search Tree Java || C++ || C || pYthon

leetcode question solution

Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: Example 1: Input: root = [2,1,3] Output: true Solution

leet Code : Validate Binary Search Tree Java || C++ || C || pYthon Read More »

Leet Code :Running Sum of 1d Array Solution C++ || Python || Java

leetcode question solution

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] Output: [1,3,6,10] Explanation: Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4]. Example 2: Input: nums = [1,1,1,1,1] Output: [1,2,3,4,5] Explanation: Running sum is obtained as follows: [1, 1+1,

Leet Code :Running Sum of 1d Array Solution C++ || Python || Java Read More »

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 used to combine the rows from two tables and create a result set containing only such records that are present in both the tables based on the joining condition (predicate).

TCS and Infosys Database , SQL questions | TCS and Infosys Technical Round Question Read More »