GOOD QUESTIONS:

question18.c (arrays)

C concepts

dynamic memory allocation for 2d arrays
fgets,scanf, getc etc difference and when to use what

TODO:

question14.c (general),
question17.c (arrays), to be done after trees and linkedlist is done
question19.c (arrays): to be done after trees is done
question20.c (arrays): to be done after hashing (method 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 (both check and mirror a tree)
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
min heap implementation of PRIMS in greedy
solve KRUSKAL from greedy
solve DIJKSTRA alog from greedy
greedy question2 to be seen from geeks for geeks
greedy question12 implementation
divide and conquer question1, method3 to be done
divide and conquer quick sort way for question2 not able to understand
divide and conquer question5 to be done
make the iterative version for question8
last question of divide and conquer to be done (2d array)
matrix chain multiplication using 2d array to be done later
longest common subsequence method to be done
DP question3 to be done
DP question4 to be done
DP question5 to be done
DP question6 to be done
DP question7 to be done
DP question11 (method1 naive) to be done
DP question13 and 14(printing the subsequence to be done)
https://gsamaras.wordpress.com/code/caution-when-reading-char-with-scanf-c/
DP solution extension from geeks for geeks for question17 and course sol as well
program to find fibonacci number in logn time (geeks for geeks)
DP question 19 to be done
finding all palindromes in a given string
generalize the steps in question22 to m steps at a time
DP question23 to be done
DP solution to be constructed for LCS problem
DP question26 second case
Fibonacci series indepth analysis
DP question27 variation where size of board is nxm and tile is mx1
longest bitonic sequence
DP question30 to be done
watch DP second last video
trees question20 all methods (3) to be done GFG or R
geeks for geeks for DP
Graph topological sort method2 and matrix implementation of topo
Write a program to detect a cycle in a graph (question5) method2
breadth and depth first traversal in a tree
Graphs question6 union and find method to be done
Graphs question8 to be done along with backedges
Try Boyer-Moore and Rabin-karp in pattern matchin question3 and 4
Back tracking - program to print all permutations question1 (some problem)
DP question13 order of nlogn method to be done

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier! Saves Data!