Data Structures

Resources

So I am making this like a roadmap, So in every section you will find necessary practice problems , documentations and also video lectures which will help you to learn.

As I said Reading Documentations Can be best way to clear your concept. So here I am giving you some links you can read this and note down important information;

1. Introduction to array data structures 

2. Applications, Advantages and Disadvantages of Array 

3. Print array after it is right rotated K times 

4. Search, Insert, and Delete in an Unsorted Array 

5. Search, Insert, and Delete in an Sorted Array 

6. Freecode Camp 

Documentations for Linked List

1. Introduction to Linked List Data structures 

2. Types of Linked List 

3. Applications, Advantages and Disadvantages of Linked List

4. Insertion of Linked List 

5.  Searching for elements in Linked List 

6. Delete from a Linked List 

7. Reverse a Linked List 

8. Freecode Camp 

Here is the problem list which can help you to clear your concept.

1. Remove Duplicates from Sorted List 

2. Merge Two Sorted Lists 

3. Inserting a node in Linked List 

4. Deleting a node in Linked List 

5. Find the length of the linked list 

6. Reverse Linked List 

7. Linked List Cycle 

8. Palindrome Linked List 

9. Search an element in a Linked List 

10. Sort List 

11. Intersection of Two Linked Lists 

Documentations for Stack

1. Introduction to Stack 

2. Applications, Advantages and Disadvantages of Stack 

3. Implement a stack using singly linked list 

4. Stack in Python 

5. programiz .com 

Documentations for Queue

1. Introduction to Queue 

2. Array Implementation of Queue 

3. Linked List Implementation 

4. Applications, Advantages and Disadvantages of Queue 

5. Different Types of Queues and its Applications

Here is the problem list which can help you to clear your concept.

1. Implement Stack using Arrays 

2. Implement Queue using Arrays 

3. Implement Stack using Queue 

4. Implement Queue using Stack 

5. Implement stack using Linkedlist 

6. Implement queue using Linkedlist 

7. Check for balanced paranthesis 

Documentations for Recursion

1. Introduction to Recursion 

2. Difference between Recursion and Iteration 

3. Types of Recursions 

4. Finite and Infinite Recursion with examples 

5. Recursive Functions 

Here is the problem list which can help you to clear your concept.

1. Write a recursive function to calculate the factorial of a number.

2. Implement a recursive function to calculate the nth Fibonacci number.

3. Write a recursive function to find the sum of the first N natural numbers.

4. Write a recursive function to find the length of a given string.

5. Implement a recursive function to reverse a string.

6. Write a recursive function to calculate the sum of all elements in an array.

7. Implement a recursive function to find the maximum element in an array( in a sequence).

8. Write a recursive function to find the minimum element in an array.

9. Implement a recursive function to check if a string is a palindrome.

10. Write a recursive function to compute the power of a number (a^b).

11. Write a recursive function to compute the harmonic sum of n numbers.

12. Implement a recursive function to find the GCD (greatest common divisor) of two numbers.

13. Write a recursive function to print the first N natural numbers in reverse order.

14. Implement a recursive function to print the elements of an array in reverse order.

15. Write a recursive function to check if an array is sorted.

16. Implement a recursive function to calculate the sum of even numbers from 1 to N.

17. Write a recursive function to count the number of digits in a positive integer.

18. Implement a recursive function to find the nth term sum of the geometric progression: a+ ar+ar^2 + ...

19. Write a recursive function to compute the product of two numbers without using the multiplication operator.

20. Write a recursive function to find the nth term of the arithmetic progression: a, a+d, a+2d, ...

21. Implement a recursive function to calculate the sum of the digits of a positive integer.

22. Write a recursive function to find the LCM (least common multiple) of two numbers.

23. Write a recursive function to check if a given number is a prime number.

24. Write a recursive function to find if a number is a perfect number or not.

25. Implement a recursive function to find the sum of digits in a string (consider digits as characters).

26. Implement a recursive function to find the number of ways to climb N steps if you can take 1 or 2 steps at a time. → (Same to fibonacci Series)

27. Implement a recursive function to find the number of subsets of a set with N elements.

28. Implement a recursive function to convert decimal numbers to binary numbers.

29. Implement a recursive function to convert binary numbers to decimal numbers.

30. Write a recursive function to find the nth term of the Lucas sequence (similar to Fibonacci).

31. Implement a recursive function to find the sum of the digits of a positive integer until a single-digit result is obtained.

32. Implement a recursive function to find the length of a linked list.

33. Implement a recursive function for Sequential search in a sequence for array and linked list.

34. Implement Binary Search using recursion.

35. Implement a recursive function to find the maximum element in an array(Binary Version).

36. Pattern Printing Using Recursion

37. Divide a number using recursion 

38. Print a linked list in reverse and normal.

39. SQRT of a number using binary search.

and you can try at Leetcode as well

Documentations for Hashing

1. Introduction to Hashing

2. What is Hashing?

3. Separate Chaining Collision Handling Technique in Hashing

4. Open Addressing Collision Handling technique in Hashing

5. Index Mapping (or Trivial Hashing) with negatives allowed

Here is the problem list which can help you to clear your concept.

1. Create hashtable using array

2. Create forward chaining function using linked list

3. Create delete function to delete any given element if it exist

4. Create Linear Probing function for inserting element in hashtable

5. Design Hash function

6. Insert any element using double hashing

7. find duplicate number in hashtable using hashing

8. find targeted sum of 2 number using hashtable

9. sort an array using key-indexing

10. search for any value in hashtable using key-indexing

Documentations for Binary Tree

1. Introduction to Binary Tree 

2. Properties of Binary Tree 

3. Applications, Advantages and Disadvantages of Binary Tree 

4. Binary Tree (Array implementation) 

Documentations for Binary Search Tree

1. Introduction to Binary Search Tree 

2. Applications, Advantages and Disadvantages of Binary Search Tree 

3. Applications of BST 

4.  Traversals – Inorder, Preorder, Post Order 

Here is the problem list on Binary Tree which can help you to clear your concept.

1. Calculate the height of a binary tree.

2. Count the total number of nodes in a binary tree.

3. Check if a given binary tree is a full binary tree.

4. Perform a level order traversal of a binary tree.

5. Check if two binary trees are identical.

6. Find the maximum element in a binary tree.

7. Check if a binary tree is a binary search tree.

8. Find the lowest common ancestor (LCA) of two nodes in a binary tree.

9. Check if a binary tree is balanced.

10. Calculate the total number of leaf nodes in a binary tree.

11. Check if a binary tree is symmetric around its centre.

12. Calculate the width of each level of a binary tree.

13. Check if a binary tree is a perfect binary tree.

14. Find the depth of a given node in a binary tree.

15. Check if a binary tree is a subtree of another binary tree.

16. Print the ancestors of a given node in a binary tree.

17. Check if the sum of all nodes on each level of a binary tree is odd or even.

18. Check if a binary tree is a complete binary tree.

19. Calculate the number of nodes at the deepest level of a binary tree.

20. Find the maximum width of a binary tree at any level.

21. Check if a binary tree is a degenerate or skewed tree.

22. Swap the left and right children of all nodes in a binary tree.

23. Write a program to check if a binary tree is a sum tree (where each node is the sum of its left and right children).

24. Count the number of paths in a binary tree that sum up to a given value.

25. Print all nodes at distance k from the root in a binary tree.

26. Check if a binary tree is a mirror/isSymmetric image of itself.

27. Determine if there exists a path from the root to a leaf node with a given sum in a binary tree.

28. Implement an algorithm to check if a binary tree is a balanced binary tree.

29. Create a function to check if a binary tree is a foldable tree.

30. Implement a function to count the number of paths that sum up to zero in a binary tree.

31. Write a function to count the number of nodes in the longest path of a binary tree.

32. Write a function to find the max depth of a binary tree.

33. PreOrder Traversal

34. InOrder Traversal

35. PostOrder Traversal

36. Write a function to construct a binary tree from an array

37. Write a function to construct an array from a binary tree

38. Write a function to find the sum of leaf nodes

39. Construct Binary Tree from Inorder and Postorder Traversal

40. Construct Binary Tree from Inorder and PreOrder Traversal

41. Evaluate Boolean Binary Tree

Here is the problem list on Binary Search Tree which can help you to clear your concept.

1. Search for a key in a binary search tree.

2. Insert a new node into a binary search tree.

3. Delete a node with a given key in a binary search tree.

4. Find the minimum element in a binary search tree.

5. Find the kth smallest element in a binary search tree.

6. Find the inorder successor in a binary search tree.

7. Check if a binary tree is a valid binary search tree.

8. Find the floor and ceiling of a given key in a binary search tree.

9. Find the range sum of values in a binary search tree within a given range.

10. Find the maximum depth of a binary search tree.

11. Check if a given value is present within a specific range in a binary search tree.

12. Count the number of nodes in a binary search tree with a value less than a given value.

13. Find the maximum element that is less than a given value in a binary search tree.

14. Calculate the sum of all nodes in a binary search tree.

15. Find the minimum depth of a binary search tree.

16. Count the number of subtrees in a binary search tree.

17. Find the maximum difference between any two nodes in a binary search tree.

18. Find the maximum leaf to root path sum in a binary search tree.

19. Convert a given sorted array into a balanced binary search tree.

20. Find the predecessor of a given node in a binary search tree.

21. Delete all nodes with a value greater than a given value in a binary search tree.

22. Find the level of a given node in a binary search tree.

23. Find the number of elements between two given nodes in a binary search tree.

24. Merge two binary search trees into one, preserving the BST property.

25. Check if two BSTs have the same set of elements.

26. Find the second largest element in a binary search tree.

27. Find the LCA of two nodes in a BST.

28. Convert a given BST into a singly linked list in-place.

29. Determine if there exists a path from the root to a leaf node with a given sum in a BST.

30. Write a function to find the height of a given node in a binary search tree.

31. Implement a function to check if a binary search tree contains a given path or sequence.

32. Create a function to determine if a binary search tree contains a pair of elements that sum up to a given value.

33. Create a function to create a balanced search binary from an unbalanced binary search tree.

Working on the rest of the part....🌝