- Find whether an array is subset of another array
- Union and Intersection of two Linked Lists
- Find a pair with given sum
- Find Itinerary from a given list of tickets
- Find four elements a, b, c and d in an array such that a+b = c+d
- Find the largest subarray with 0 sum
- Count distinct elements in every window of size k
- Find smallest range containing elements from k lists
- Palindrome Substring Queries
- Largest subarray with equal number of 0s and 1s
- Advantages of BST over Hash Table
- Check if an array can be divided into pairs whose sum is divisible by k
- Count the number of subarrays having a given XOR
- Implementing our Own Hash Table with Separate Chaining in Java
- Internal Working of HashMap in Java
- Find missing elements of a range
- Longest Consecutive Subsequence
- Print all subarrays with 0 sum
- Open Addressing for Collision Handling
- Separate Chaining for Collision Handling
- Given an array of pairs, find all symmetric pairs in it
This article is contributed by Shiv Pratap Singh. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.