A long string of alternating White and Black Queens, and a single Regular Expression is you need to solve the N-Queens problem!
NOTE: This talk will not be recorded.
A staple for new Computer Science students and a favourite topic for interview questions is to write a program to solve the N-Queens problem: find a way to place N Queens on an NxN chess board such that no two Queens attack each other.
This is what we are going to do in this talk, but our language of choice is going to be the language of regular expressions.
Once we’re done with just placing Queens, we will expand the problem and use regular expressions to place multiple, different pieces on the board, in such a way no two pieces attack each other.
Master this technique, and leave a lasting expression during your next job interview.
Create a custom schedule.
Take it with you on mobile.
Get listed in the directory.
