Count distinct absolute values in a sorted array
Given an array of sorted integers that may contain several duplicate elements, count the total number of distinct absolute values in it.
Tag: Hashing
Determine whether a string matches with a given pattern
Given a string and a pattern, determine if the pattern matches with the string or not. The solution should not use any regex.
Memory Efficient C++ Implementation of Trie – Insert, Search, and Delete
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.
Generate a list of possible words from a character matrix
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.
Find duplicate rows in a binary matrix
Find duplicate rows present in a given binary matrix by traversing the matrix only once.
Java Implementation of Trie Data Structure
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.
Trie Data Structure – Python Implementation
Trie 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.
Check if a subarray with 0 sum exists or not
Given an integer array, check if it contains a subarray having zero-sum.
Find two duplicate elements in a limited range array (using XOR)
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.
Find a subarray having the given sum in an integer array
Given an integer array, find a subarray having a given sum in it.
Find the largest subarray formed by consecutive integers
Given an integer array, find the largest subarray formed by consecutive integers. The subarray should contain all distinct values.
Find the duplicate element in a limited range array
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.