N-Queens in Scala: Approaching an Interview Problem With Pure Functional Programming

Extract from the updated Scala & Functional Programming Interview Practice course: https://rockthejvm.com/p/scala-functi...

This episode is a bit different. This time, I'm going to show you one of the problems I solve with my students in the Scala & FP Interview Practice course.

N-Queens is a classical interview algorithm questions, which we approach here in Scala using pure functional programming and tail recursion. In this video, we discuss it step by step and in minute detail. But more than that, we structure it like an interview question, with a time break for you to try it yourself, then look at my solution.

The Scala & FP Interview Practice course is (currently, to my knowledge) the only "cracking the coding interview" course specifically for Scala programmers. It contains 50+ Google-style questions, 15 hours of premium content, 3300+ lines of Scala, all written as pure functional code.

This course has already many developers land their dream jobs, and hopefully it will help you too.

Follow Rock the JVM on:
LinkedIn:   / rockthejvm  
Twitter:   / rockthejvm  
Blog: https://rockthejvm.com/blog

-------------------------------------------------------------------------
Home: https://rockthejvm.com
-------------------------------------------------------------------------