In this course, you will learn a number of exercises. Some of these exercises include:

  • Single linked list – Add/ edit / delete / get
  • Double linked list – Add / edit / delete / get
  • Circular linked list – Add / edit / delete / get
  • Implement stack using an array
  • Implement circular Queue
  • Implement FIFO
  • Implement LIFO
  • Create and traverse binary tree
  • Implement insertion sort
  • Implement quick sort
  • Implement selection sort
  • Implement merge sort
  • Implement radix sort algorithm
  • Binary search tree
  • Implement depth first traversal of the graph
  • Count number of trees in a forest
  • Rotate matrix

And many more….

Subscribe
Exercises
  • Over 50+ practice programs
  • ┬áIn browser cloud based IDE