Coding Interview: Hard Question on Range Queries - with @Keerti Purswani



Published
Keerti joins us for a mock interview, around range queries, and the Josephus Problem.

Watch her use precomputation techniques, binary search, and other data structures to make the order complexities work!

00:00 Intro
00:20 Problem Statement
04:40 Clarifications
06:20 Prefix Sums Approach
11:56 Range Query Data Structure
17:50 Partition into Blocks
21:30 Complexity Analysis
26:45 Coding
44:00 Noting Feedback
44:15 Detailed Feedback

Let us know your thoughts and comments below!

Keerti's YouTube channel: https://www.youtube.com/c/KeertiPurswani

Mock Interview Website: https://mock.interviewready.io/
System Design Video Course: https://get.interviewready.io/

You can follow me on:
Instagram: https://www.instagram.com/applepie404/
LinkedIn: https://www.linkedin.com/in/gaurav-sen-56b6a941/
Twitter: https://twitter.com/gkcs_

#SystemDesign #InterviewReady #Coding
Category
Job
Be the first to comment