Skip to content

Latest commit

 

History

History
63 lines (60 loc) · 2.96 KB

nextquestions.md

File metadata and controls

63 lines (60 loc) · 2.96 KB

TODO:

  • question14.c (general),
  • question17.c (arrays), to be done after trees and linkedlist is done
  • question18.c (arrays), to be done after linkedlist is done
  • question19.c (arrays): to be done after trees is done
  • question20.c (arrays): to be done after hashing (approach 2 and 3)

COMING SOON

  • merge sort using dynamic programming and hashmaps
  • duplicate elimination from an array
  • union, intersection and difference of two arrays
  • bucket sort
  • radix sort for d digit numbers
  • find maximum sum subarray from an array
  • find triplet that sums to given value using binary search technique
  • make a circular linked list with a sentinel
  • double linked list insertion all points and deletion
  • hash table implementation used in linked list after hashing is done
  • program to add, mult, subtract two numbers stored in two different linked list and store the result in another linked list
  • storing addresses of a linked list in hash table
  • storing addresses of a linked list in stack and doing operations
  • hash table implementation of question12 to be done
  • use a stack for question13
  • heap to solve question15 (merge k sorted linked lists into one)
  • question 15 linked list
  • merge sort on linked list
  • XOR operation double linked list
  • question1 on hashing
  • binary search method to be done on hashing for question2
  • BBST for question2 hashing
  • BBST for question3 hashing and first method to be done
  • how to accurately find the size of the hashTable
  • BST question5 hashing to be done
  • hashing question7 method3 to be done using BST
  • question4 hashing to be done
  • implement stack using two queues try both methods
  • stacks and queues INFIX to POSTFIX & evaluating POSTFIX
  • double linked list implementation for question7 stacks and queues to be done
  • question 8, 9 implementation for stacks and queues to be done
  • Program to find then the stock should be sold in order to gain max profit
  • insert key in heap question2 to be done
  • building min/max heap for duplicate elements
  • Do BST method in question 6 for heaps
  • Do BST method for question 7 in heaps (question7 complete to be done)
  • question8 in heaps to be done still
  • question9 and question 10 to be done still
  • delete part of trees question1 to be done
  • trees mirror tree implementation to be done
  • level order traversal to be done using queue as linked list in trees
  • difference between scanf fgets and one more to be done
  • method 1 of trees question6 to be done
  • question7 of trees to be done
  • question11 on trees to be done (very imp.)
  • question12 method3, question15 method1 to be done (very imp.) -> in case of doubt refer to PDF for top view method question 15 and question 16
  • question19 method2 to be done later after strings (revisit the code for it given as pdf)
  • method1 of question21 and question22 complete
  • do binary search method for strings question1
  • question 8 strings to be done (see from the sol pdf)
  • strings question10 to be done
  • strings question11 to be done
  • strings question12 to be done