Latest tutorials

Page 190 of 196

Quick Sort
Fundamental Problems · Feb 10, 2019 · 1 min read
Write a function that takes in an array of integers and returns a sorted version of that array. Use the Quick Sort algorithm to sort the array. I have a solution here.
Three Number Sum
Fundamental Problems · Feb 10, 2019 · 5 min read
Where the two-pointer technique stops being a curiosity and becomes the tool — sorting buys three separate things at once and no hash-based approach gets all three. Why both pointers move after a hit, why the result should be List<List<Integer>> rather than List<Integer[]>, and exactly what changes when duplicates are allowed.
Two Number Sum
Fundamental Problems · Feb 9, 2019 · 5 min read
Three reasonable answers with genuinely different trade-offs, and laying all three out before choosing is the actual skill being tested. Why the inner loop starts at x + 1 rather than 0, why you must check the set before inserting or an element pairs with itself, and why sorting quietly reorders the caller's array. Java and Python, plus the indices variant.
Fizzbuzz
Fundamental Problems · Feb 7, 2019 · 1 min read
Machine Learning Introduction
Machine Learning · Jan 25, 2019 · 1 min read
Mach