## Hashing | Set 3 (Open Addressing)

We strongly recommend to refer below post as a prerequisite of this. Hashing | Set 1 (Introduction) Hashing | Set 2 (Separate Chaining) Open Addressing… Read More »

- k-th missing element in an unsorted array
- Check if it is possible to reach a number by making jumps of two given length
- Number of unique pairs in an array
- Choose atleast two elements from array such that their GCD is 1 and cost is minimum
- Count of words that are present in all the given sentences
- Minimum length substring with exactly K distinct characters
- Count occurrences of a string that can be constructed from another given string
- Find the longest string that can be made up of other strings from the array
- Sum of nodes in bottom view of Binary Tree
- Split the array elements into strictly increasing and decreasing sequence
- Rearrange characters in a string such that no two adjacent are same using hashing
- Sum of nodes in top view of binary tree
- Maximum length of the sub-array whose first and last elements are same
- Count duplicates in a given linked list
- Remove all occurrences of any element for maximum array sum
- Count of unique pairs (arr[i], arr[j]) such that i < j
- Find uncommon characters of the two strings | Set 2
- Minimum number of given operations required to convert a permutation into an identity permutation
- Number of subarrays such that XOR of one half is equal to the other
- Print the first shortest root to leaf path in a Binary Tree
- Count of pairs of strings which differ in exactly one position
- Two equal sum segment range queries
- Design a stack which can give maximum frequency element
- Count all elements in the array which appears at least K times after their first occurrence
- Flip minimum signs of array elements to get minimum sum of positive elements possible
- Minimum changes required to make a Catalan Sequence
- Maximum product from array such that frequency sum of all repeating elements in product is less than or equal to 2 * k
- Find d to maximize the number of zeros in array c[] created as c[i] = d*a[i] + b[i]
- Longest sub-sequence of array containing Lucas numbers
- Find the lexicographically smallest sequence which can be formed by re-arranging elements of second array

We strongly recommend to refer below post as a prerequisite of this. Hashing | Set 1 (Introduction) Hashing | Set 2 (Separate Chaining) Open Addressing… Read More »

Hello I have applied for Amazon after completing my 1 yr at job and got a call for a full day interview. Interview happens as… Read More »

Given an array of size n and an integer k, return the of count of distinct numbers in all windows of size k. Example: Input:… Read More »

We strongly recommend to refer below post as a prerequisite of this. Hashing | Set 1 (Introduction) What is Collision? Since a hash function gets… Read More »

1st round (Written Test) It was an online test of 90 minutes and was conducted on Hackerearth. It consisted of 10 MCQ’s and 3 coding… Read More »

Given two unsorted arrays of same size, write a function that returns true if two arrays are permutations of each other, otherwise false. Examples: Input:… Read More »

Given a list of tickets, find itinerary in order using the given list. Example: Input: “Chennai” -> “Banglore” “Bombay” -> “Delhi” “Goa” -> “Chennai” “Delhi”… Read More »

Recently I am interviewed for Amazon SDE-1 position for Bangalore. There are 3 F2F rounds followed by a telephonic round. As it was a drive,… Read More »

Given a dictionary that contains mapping of employee and his manager as a number of (employee, manager) pairs like below. { “A”, “C” }, {… Read More »

I had attended taxi4sure drive. Their process is written test followed by n f2f interviews. Written test 1) Given an array of students whose ranks… Read More »

I was interviewed at Flipkart. Following was my interview experience. Initially there was one telephonic screening round. then I was called at their bangalore office.… Read More »

Design a data structure that supports following operations in Θ(1) time. insert(x): Inserts an item x to the data structure if not already present. remove(x):… Read More »

Hash Table supports following operations in Θ(1) time. 1) Search 2) Insert 3) Delete The time complexity of above operations in a self-balancing Binary Search… Read More »

Given an unsorted array with repetitions, the task is to group multiple occurrence of individual elements. The grouping should happen in a way that the… Read More »

Given a string you need to print longest possible substring that has exactly M unique characters. If there are more than one substring of longest… Read More »