## LinkedIn Interview Experience | 6

Four questions were asked on hackerrank online platform, they were 1. Anna has an array, num, of n integers. She can reduce the array by… Read More »

Four questions were asked on hackerrank online platform, they were 1. Anna has an array, num, of n integers. She can reduce the array by… Read More »

Recently LinkedIn came to our college campus to hire FTE’s. The profile was SRE (Site Reliability Engineer). Here I am sharing my Interview Experience. The… Read More »

Given two sorted arrays, we need to merge them in O((n+m)*log(n+m)) time with O(1) extra space into a sorted array, when n is the size… Read More »

Given two sorted arrays, the task is to merge them in a sorted manner. Examples: Input : arr1[] = { 1, 3, 4, 5} arr2[]… Read More »

Given an array of n elements, the task is to find the greatest number such that it is product of two elements of given array.… Read More »

We are given two sorted array. We need to merge these two arrays such that the initial numbers (after complete sorting) are in the first… Read More »

Online round (1 hour on hackerrank): 1. There are ‘n’ ticket windows in the railway station, ith window has ai tickets available. Write your Interview… Read More »

ONLINE ROUND: 3 coding Questions in 1 hour : 1) Given a binary search tree and a key, if found return 1 else -1. Write… Read More »

LinkedIn Interview Experience (On Campus – Day 1) Online Round : 3 coding Questions in 1 hour : Write your Interview Experience or mail it… Read More »

Online coding 1 hr, 3 Questions. Write your Interview Experience or mail it to contribute@geeksforgeeks.org Practice Tags : Linkedin

Below is my interview experience with linkedin India for software development intern. Write your Interview Experience or mail it to contribute@geeksforgeeks.org Practice Tags : LinkedinStringsSorting

The following is definition of Binary Search Tree(BST) according to Wikipedia Binary Search Tree, is a node-based binary tree data structure which has the following… Read More »

Given a sequence, find the length of the longest palindromic subsequence in it. As another example, if the given sequence is “BBABCBCAB”, then the output… Read More »