LeetCode Question

#2435 Paths in Matrix Whose Sum Is Divisible by K

SWE coding Hard
Sign in to bookmark Original →

Question Details

LeetCode #2435: Paths in Matrix Whose Sum Is Divisible by K. Difficulty: Hard. Topics: Array, Dynamic Programming, Matrix. Asked at Apple in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Arrays Dynamic Programming Matrix

More from Apple

Reddit Decline an interview if I'm not ready? Reddit SRE intern apple Reddit Apple SWE Phone Screen | 60L CTC Reddit APPLE INTERVIEW Reddit Apple USA Phone screen with hiring manager
← All Apple questions Apple Software Engineer Questions → All Arrays,Dynamic Programming,Matrix Questions →