Daily Coding Problem: Get exceptionally good at coding interviews by solving one problem every day

by Lawrence Wu, Alex Miller

Daily Coding Problem contains a wide variety of questions inspired by real programming interviews, with in-depth solutions that clearly take you through each core concept. You’ll learn about: • Linked Lists • Arrays • Heaps • Trees • Graphs • Randomized Algorithms • Backtracking • Dynamic Programming • Stacks and Queues • Bit Manipulation • System Design

Genres: Coding, Technology, Programming

299 pages, Paperback

Published January 31, 2019

Reviews

[Michael Chen · Rating 4 out of 5]

I'm only on the 27th page so far, reading the fourth problem, but I already see a significant error. For the problem "Find number of smaller elements to the right" (basically https://leetcode.com/problems/count-o...), they provide a supposed O(n log n), but in reality, I'm pretty sure it's O(n²), no better than the naive solution that they knock down.