Two integer arrays, nums and multipliers, of sizes n and m, respectively, are provided to you, where n >= m. The arrays are all one-dimensional. You start with a score of zero. You need to carry out precisely m operations. On the ith (1-indexed) action, you will: Choose one integer x from the beginning or […]
LeetCode 15. Pattern: Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “three sum” or “LeetCode .15” Approaches Two-Pointer Approach: 1. Sorting the Array 2. Initialization 3. Handling Edge Case 4. Main Loop Over Array 5. Duplicate Check 6. Two-Pointer Approach 7. Finding
LeetCode 15 : Three (3) Sum Read More »
Given a string s, return the longest palindromic substring in s. A string is called a palindrome string if the reverse of that string is the same as the original string. Example 1: Input: s = “babad” Output: “bab” Explanation: “aba” is also a valid answer. Example 2: Input: s = “cbbd” Output: “bb” Solution : JavaScript : CPP
Leet Code : Longest Palindromic Substring Java | CPP | Java Script | Python Solution Read More »
Find the length of the longest substring without repeated characters given a string s. Example 1: Input: s = “abcabcbb” Output: 3 Explanation: The answer is “abc”, with the length of 3. Example 2: Input: s = “bbbbb” Output: 1 Explanation: The answer is “b”, with the length of 1. Example 3: Input: s =
You are given two non-empty linked lists that each represent a non-negative integer. The digits are kept in reverse order, with each node containing only one digit. Add the two numbers together and return the total as a linked list. Except for the number 0 itself, you may presume that the two numbers do not
Leet Code : Add Two List – Java | CPP | Javascript | Python Read More »
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 »
