Can anyone tell me briefly what's the difference between ad-hock and greedy problems?
probably wrong : but i know that there are two types of greedy.
One that can give you most optimal answer.
Second one which can give you a correct answer but not necessary optimal.
Now is ad-hock considered to be the same as second type? i just don't know.
Thanks in advance.
Its ad-hoc
Ad-hoc is term that is supposed to mean not classifiable into a standard category that is thrown around on everything short impl now adays. Most of recent "ad-hoc" is rlly greedy or find formula. Ad-hoc can contain greedy or similar, but its overall idea is what matters when classifying, just as dp problem can contain a ds without the ds being the main idea, and vice versa.
can you please provide some good ad-hock questions to practice
I know that you didn't address me but if i were you i would solve problems with 800~1500R like 70% are just ad-hocks doesn't need certain algorithm or technique to solve them.
and i may be wrong.