InterviewDB Question

Palantir SWE Phone - Word Distance Matching

Question Details

Problem Find the shortest distance between two given words in a text document, or match words within a distance threshold. Likely LeetCode equivalent Similar to Shortest Word Distance (LC 243). Tags strings, arrays, palantir

Full Details

🔒

Unlock all Palantir 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 palantir interview during the phone round.

It covers the following topics: Strings, Phone, Coding, Arrays, Onsite .