LeetCode Question · Aug 2019 · Los Angeles

Uber | OA 2019 | Perfect Substring & Hate Graphs

SWE OA

9 upvotes 4,723 views 8 replies

Question Details

There were two problem statements to be solved in 1 hour: 1. Perfect Substring Count the number of substring that contain all digits exactly k times or 0 times. Eg: If k=2: Valid...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays Graph Strings

More from Uber

Reddit Left industry for 5 years, how fucked am I? Reddit Uber | System Design Round | L5 Reddit Uber SWE-1 India Hiring – Cleared OA but Ended Up Waitlisted (Which Basically Means Rejected) Reddit Uber EM Interview Experience Reddit Uber Strategic Operations Interview

← All Uber questions Uber Software Engineer Questions → All Sliding Window Questions →