day 1:- code:- reverse a string using dsa theory:- time complexity(gen notations)
day 2:- theory:- array as adt code:- coded an array using classes as an adt
day 3:- theory:- studied time and space complexity and solved some questions from geeksforgeek
day 4:- theory:- revised binary search and linear search code:- coded linear and binary search
day 5:- theory:- revised selection sort and binary search using iterative func. code:- coded binary search and selection sort
day 6:- theory:- revised iterative and recursive bubble sort code:- coded iterative and recursive bubble sort
day 7:- theory:- revised iterative and recursive insertion sort and studied merge sort code:- coded iterative and recursive insertion sort
day 8:- theory:- studied merge sort code:- coded merge sort
day 9:- theory:- studied quick sort code:- coded quick sort
day 10:- theory:- studied divide and conquer
day 11:- theory:- finished divide and conquer theorem code:- coded a prog to max and min values of an array using div and conquer theorem
day 12:- theory:- started linked list code:- coded creation and traversal in linked list
day 13:- theory:- revised insertion, modification and deletion operation in linked list code:- coded insertion, modification and deletion operation in linked list
day 14:- theory:- revised circular and doubly linked list and practised few questions on leet code.
day 15:- theory:- practised few questions on leet code.
day 16:- theory:- revised stack using array and linked list
day 17:- code:- coded stack using linked list
day 18:- theory:- studied the implementation of stack code:- coded parenthesis matching using stack(linked list)