Bangalore FP May 2026 meetup

Are you tired of DSA? Has Leetcode sapped your joy?

Then let me introduce you to a new way of solving problems. You describe constraints for a valid solution and you let the solver do the hard part. Or is describing the constraints that is the hard part? 🤔. You’ll find out 😈 when we work through a toy problem.

We’ll be looking at a variant of constraint based programming called discrete optimization. We’ll use Minizinc language for implementation but the concepts are general and other popular languages have libraries for it. There’s also a coursera coursera course where you can learn more.

Through the example we’ll explore this paradigm of programming and build some intuition for the programming and maths behind it.

And finally we’ll apply our new found learning to beating the best times in Farm Frenzy Pizza Party!! 🍕