  # JIO Interview Experience Campus – 2022

It was an on-campus hiring event for the JIO Sparks Program’s Graduate Engineer Trainee (GET) Role. Pre-Placement discussions regarding the company and its requirements were followed by Round 1 of the Placement Drive. TIP: YOU CAN CONNECT WITH LINKDELIN : LINK Round 1:  Aptitude exam : In JIO Spark, applicants who do not pass the aptitude test advance to

# leet code : Two sum Problem solution – Java || CPP || JavaScript || Python

Problem Statement​This is another article in the series leetcode problem solutions and this article is a solution to leetcode 1 two sum problem. Once you have a good understanding of two sum problem, it should help you solve advanced level problems like three sum which in some ways a continuation of the two sum problem.

# 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 = [3,9,20,null,null,15,7] Output: [,[9,20],[15,7]] Example 2: Input: root =  Output: [] Example 3:

# 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 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 : 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 contains only nodes with keys less than the node’s key. The right subtree of a node contains only nodes with keys greater than the node’s key. Both the left and right subtrees must also

# 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…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,

# 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 Coding Question | TCS and Infosys placement prepration

To find GCD of two numbers To find the lcm of two numbers To find the Factorial of a non negative number To find the area of a circle (area=3.14rr), when diameter is given. To find the area of triangle when base and height is given. To print the Fibonacci series.Input=6 Output=1 1 2 3