ds-exercises

Arrays

1. Find the second minimum element of an array
2. First non-repeating integers in an array
3. Merge two sorted arrays
4. Rearrange positive and negative values in an array

Stacks

1. Evaluate postfix expression using a stack
2. Sort values in a stack
3. Check balanced parentheses in an expression

Queues

1. Implement stack using a queue
2. Reverse first k elements of a queue
3. Generate binary numbers from 1 to n using a queue

Linked List

1. Reverse a linked list
2. Detect loop in a linked list
3. Return Nth node from the end in a linked list
4. Remove duplicates from a linked list

Graphs

1. Implement Breadth and Depth First Search
2. Check if a graph is a tree or not
3. Count number of edges in a graph
4. Find the shortest path between two vertices

Trees

1. Find the height of a binary tree
2. Find kth maximum value in a binary search tree
3. Find nodes at “k” distance from the root
4. Find ancestors of a given node in a binary tree

Tries

1. Count total number of words in Trie
2. Print all words stored in Trie
3. Sort elements of an array using Trie
4. Form words from a dictionary using Trie
5. Build a T9 dictionary

Hashing

1. Find symmetric pairs in an array
2. Trace complete path of a journey
3. Find if an array is a subset of another array
4. Check if given arrays are disjoint