## Count distinct elements in every window of size k

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 »

- Find the longest string that can be made up of other strings from the array
- Rearrange characters in a string such that no two adjacent are same using hashing
- Flip minimum signs of array elements to get minimum sum of positive elements possible
- Count duplicates in a given linked list
- Find uncommon characters of the two strings | Set 2
- Design a stack which can give maximum frequency element
- Count equal pairs from given string arrays
- Remove all occurrences of any element for maximum array sum
- Print characters and their frequencies in order of occurrence using a LinkedHashMap in Java
- Minimum Bitwise XOR operations to make any two array elements equal
- Longest subsequence such that every element in the subsequence is formed by multiplying previous element with a prime
- Partiton the string in two parts such that both parts have at least k different characters
- Extendible Hashing (Dynamic approach to DBMS)
- Count of pairs between two arrays such that the sums are distinct
- Minimum number of given operations required to reduce the array to 0 element
- Print characters having odd frequencies in order of occurrence
- Count number of pairs in array having sum divisible by K | SET 2
- Find the lexicographically smallest sequence which can be formed by re-arranging elements of second array
- What are Hash Functions and How to choose a good Hash Function?
- Minimum deletions required to make frequency of each letter unique
- Sum of nodes in the left view of the given binary tree
- Check duplicates in a stream of strings
- Rearrange given string to maximize the occurrence of string t
- Find the difference of count of equal elements on the right and the left for each element
- Print characters having even frequencies in order of occurrence
- Count of quadruplets with given Sum | Set 2
- Program to parse the Molecules and get the Atoms count
- Find missing elements from an Array
- Longest subsequence with at least one character appearing in every string
- Find the color of given node in an infinite binary tree

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 the following operations in Θ(1) time. insert(x): Inserts an item x to the data structure if not already present.… 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 »

Recently Microsoft visited our campus for SDE intern. The process took over 4 months. Round 1 (Online MCQ’s) Time-30 mins This round consisted of 25… Read More »

Snapdeal conducted placement drive at my campus in January last week for Software Developer. Eligibility- All CSE (no pointer criteria) Online Test- 21 (MCQ) +2… Read More »