Provide the median of the two sorted arrays given two sorted arrays of sizes m and n, respectively. The entire complexity of the run time should be O(log (m+n)). Eg 1: Numbers1 = [1,3], Numbers2 = [2] Result: 2.00000 Explanation: the merged array equals [1,2,3], and the median is 2. Eg 2: Numbers1 = [1,2], […]
Leet Code : Median of two sorted array -CPP || java || Python || Java Script Read More »
Organization: Ernst and Young (EY-GDS) Designation: Hey guys, I am Kavish Gidwani , placed in EY-GDS . sharing my interview experience. If you have any questions, please contact me on Linkedin: Link Round 1 (online test) The online test consists of the following sections for 65 minutes. It was organised through the AMCAT platform. Round 2 (Group Discussion) Duration
EY – GDS (On campus) Interview Experience – 2022 Read More »
jio interview experience:It was an on-campus hiring event for the JIO Sparks Program’s Graduate Engineer Trainee (GET) Role. jio spark hiring process ,reliance jio spark interview questions ,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 jio interview rounds and process
JIO Interview Experience Campus | reliance jio interview questions – 2022 Read More »
Leet Code 1. Two Sum : Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “two sum ” or “Leet Code .1‘ Time Complexity: C++: 1. Brute Force Approach: LeetCode 15 : Three (3) Sum Notice: This approach has a time complexity of
leet code 1. Two sum (easy) Read More »
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:
Binary Tree Level Order Traversal Read More »
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 »
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 »
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 »
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 »
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
TCS and Infosys Coding Question | TCS and Infosys placement prepration Read More »
1.The water from one outlet, flowing at a constant rate, can fill the swimming pool in 9 hours. The water from second outlet, flowing at a constant rate can fill up the same pool in approximately in 5 hours. If both the outlets are used at the same time, approximately what is the number of
Infosys and TCS Aptitude and logical reasoning question set 2 | Company wise Question Read More »
All Company Wise Question Will be Available on Nileshblog.tech and Technilesh.com DIRECTIONS: Read the following given below and answer the questions that follow.i) Eleven students Anwar, Baham, Chetan, Dayal, Eshwar, Farooq, Gajendra, Hariom, Inayat,Jatin and Kishore are sitting on a bench in a lecture room facing towards the teacher.ii) Dayal is towards the left of
Infosys Aptitude and logical reasoning question set 1 | Company wise Question Read More »
Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Example 1: Input: nums1 = [1,3], nums2 = [2] Output: 2.00000 Explanation: merged array = [1,2,3] and median is 2. Example 2: Input: nums1 = [1,2], nums2 = [3,4] Output: 2.50000 Explanation: merged array = [1,2,3,4]
leet code median of two sorted array Java ,C++ ,C, JS solution Read More »
Information Technology has taken the world by storm. No office or organization can function without the assistance of the IT department. This global phenomenon is certainly attracting a massive number of students every year. As the number of IT enthusiast students increases, the number of IT colleges is also increasing. In the context of Nepal,
Top Information Technology Courses in Nepal, Their Scope, and Where to Study Read More »
PUNE The semester examinations at Savitribai Phule Pune University (SPPU) will begin in offline mode on June 20. Uniformity in the administration of the tests has been a source of contention among different student unions and organizations. In the midst of this, the SPPU has submitted letters to the commissioners of police in each of
