| Arrays |
Arrays - DS |
10 |
Solution.java |
| Arrays |
2D Array - DS |
15 |
Solution.java |
| Arrays |
Dynamic Array |
15 |
Solution.java |
| Arrays |
Left Rotation |
20 |
Solution.java |
| Arrays |
Sparse Arrays |
25 |
Solution.java |
| Arrays |
Algorithmic Crush |
60 |
Solution.java |
| Stacks |
Maximum Element |
20 |
Solution.java |
| Stacks |
Balanced Brackets |
25 |
Solution.java |
| Trees |
Tree: Preorder Traversal |
10 |
Solution.java |
| Trees |
Tree: Inorder Traversal |
10 |
Solution.java |
| Trees |
Tree: Postorder Traversal |
10 |
Solution.java |
| Trees |
Tree: Height of a Binary Tree |
10 |
Solution.java |
| Trees |
Tree: Level Order Traversal |
20 |
Solution.java |
| Trees |
Tree: Huffman Decoding |
20 |
Solution.java |
| Trees |
Tree: Top View |
20 |
Solution.java |
| Trees |
Binary Search Tree: Insertion |
20 |
Solution.java |
| Trees |
Binary Search Tree: Lowest Common Ancestor |
30 |
Solution.java |
| Trees |
Is This a Binary Search Tree? |
30 |
Solution.java |
| Trees |
Swap Nodes [Algo] |
40 |
Solution.java |
| Trees |
Square-Ten Tree |
60 |
Solution.java |
| Linked List |
Print the Elements of a Linked List |
5 |
Solution.java |
| Linked List |
Insert a node at the head of a linked list |
5 |
Solution.java |
| Linked List |
Insert a Node at the Tail of a Linked List |
5 |
Solution.java |
| Linked List |
Insert a node at a specific position in a linked list |
5 |
Solution.java |
| Linked List |
Delete a Node |
5 |
Solution.java |
| Linked List |
Print in Reverse |
5 |
Solution.java |
| Linked List |
Reverse a linked list |
5 |
Solution.java |
| Linked List |
Compare two linked lists |
5 |
Solution.java |
| Linked List |
Merge two sorted linked lists |
5 |
Solution.java |
| Linked List |
Get Node Value |
5 |
Solution.java |
| Linked List |
Delete duplicate-value nodes from a sorted linked list |
5 |
Solution.java |
| Linked List |
Cycle Detection |
5 |
Solution.java |
| Linked List |
Find Merge Point of Two Lists |
5 |
Solution.java |
| Linked List |
Inserting a Node Into a Sorted Doubly Linked List |
5 |
Solution.java |
| Linked List |
Reverse a doubly linked list |
5 |
Solution.java |
| Tries |
Contacts |
40 |
Solution.java |
| Queues |
Queue using Two Stacks |
30 |
Solution.java |
| Heaps |
Find the Running Median |
50 |
Solution.java |
| Multiple Choice |
Data Structures MCQ 1 |
5 |
Solution |
| Multiple Choice |
Data Structures MCQ 2 |
5 |
Solution |
| Multiple Choice |
Data Structures MCQ 3 |
5 |
Solution |
