1p3a_oj
Question
Count Point Pairs with Manhattan Distance at Least K
Question Details
Given a set of points in a 2D plane, two points are considered a pair if their Manhattan distance is sufficiently close. Design an algorithm to find the total number of such qualifying point pairs. Yo
Full Details
🔒
Unlock all Capitalone questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a capitalone interview for a swe role during the coding round.
It covers the following topics: Arrays .
Difficulty rating: 0
Topics
More Capitalone Interview Questions
1p3a
Capital One Senior Software Development Engineer Online Test Overview
1p3a
CapitalOne Onsite Interview Experience for Applied Scientist Position
1p3a
Capitalone Software Engineer Tech Phone Screen Interview Experience
1p3a
Capital One Technology Intern PowerDay Interview Experience
LeetCode
#68 Text Justification