Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedTrie is a tree-based data structure used for efficient retrieval of a key in a huge set of strings. In this post, we will discuss Python implementation of Trie data structure which supports insertion and search operations.
This post covers memory-efficient implementation of Trie data structure in C++ using the map data structure. Trie is a tree-based data structure, which is used for efficient retrieval of a key in a large dataset of strings.
Find duplicate rows present in a given binary matrix by traversing the matrix only once.
Trie is a tree-based data structure used for efficient retrieval of a key in a huge word set. In this post, we will implement the Trie data structure in Java.
Given an M × N boggle board, find a list of all possible words that can be formed by a sequence of adjacent characters on the board.
Given an integer array, check if it contains a subarray having zero-sum.
Given an integer array with all its elements between 1 and n except two elements, which occur twice. Find two duplicate elements without using any extra memory in linear time.
Given an integer array, find a subarray having a given sum in it.
Given an integer array, find the largest subarray formed by consecutive integers. The subarray should contain all distinct values.
Given a limited range array of size n and containing elements between 1 and n-1 with one element repeating, find the duplicate number in it without using any extra space.
Given a binary array containing 0 and 1, find a maximum length subarray with equal numbers of 0’s and 1’s.
Given an integer array, find the maximum length subarray having a given sum.