## LinkedIn Interview Experience | Set 1 (for SDE Internship)

Below is my interview experience with linkedin India for software development intern. First there was an online round on hackerrank where they asked 4 simple… Read More »

- Amazon Internship Interview Experience
- k-th missing element in an unsorted array
- Sort an array without changing position of negative numbers
- Find the longest string that can be made up of other strings from the array
- Count the triplets such that A[i] < B[j] < C[k]
- Comparison among Bubble Sort, Selection Sort and Insertion Sort
- Two nodes of a BST are swapped, correct the BST | Set-2
- Nagarro Interview Experience Off-campus
- Greatest contiguous sub-array of size K
- Bubble Sort for Linked List by Swapping nodes
- Merge two BSTs with constant extra space
- Maximum water that can be stored between two buildings
- Find a triplet in an array whose sum is closest to a given number
- Keep track of previous indexes after sorting a vector in C++ STL
- Pair with largest sum which is less than K in the array
- Find maximum meetings in one room
- Range Queries to Find number of sub-arrays with a given xor
- Split the array elements into strictly increasing and decreasing sequence
- Count pairs with given sum | Set 2
- Iterative selection sort for linked list
- Find the number of elements greater than k in a sorted array
- Program to print an array in Pendulum Arrangement with constant space
- Sort an array of strings based on the frequency of good words in them
- Maximum Length Chain of Pairs | Set-2
- IntroSort or Introspective sort
- Find minimum changes required in an array for it to contain k distinct elements
- Remove elements to make array sorted
- Divide array into two parts with equal sum according to the given constraints
- Unbounded Fractional Knapsack
- Check whether an array can be made strictly decreasing by modifying at most one element

Below is my interview experience with linkedin India for software development intern. First there was an online round on hackerrank where they asked 4 simple… Read More »

Approach: 1. Put all input integers to hashmap’s key 2. Print keySet outside the loop Java filter_none edit close play_arrow link brightness_4 code import java.util.HashMap;… Read More »

Given two arrays A1[] and A2[], sort A1 in such a way that the relative order among the elements will be same as those are… Read More »

We can use binary search to reduce the number of comparisons in normal insertion sort. Binary Insertion Sort uses binary search to find the proper… Read More »

We can use binary search to reduce the number of comparisons in normal insertion sort. Binary Insertion Sort find use binary search to find the… Read More »

Given a sorted dictionary (array of words) of an alien language, find order of characters in the language. Examples: Input: words[] = {“baa”, “abcd”, “abca”,… Read More »

What is in-place sorting? An in-place sorting algorithm uses constant extra space for producing the output (modifies the given array only). It sorts the list… Read More »

ShellSort is mainly a variation of Insertion Sort. In insertion sort, we move elements only one position ahead. When an element has to be moved… Read More »

In shellSort, we make the array h-sorted for a large value of h. We keep reducing the value of h until it becomes 1. An… Read More »

Given an array of strings in which all characters are of the same case, write a C function to sort them alphabetically. The idea is… Read More »

Bucket sort is mainly useful when input is uniformly distributed over a range. For example, consider the following problem. Sort a large set of floating… Read More »

Given an array of numbers of size n. It is also given that the array elements are in range from 0 to n2 – 1.… Read More »