Given an array and a target, find two indices that sum to the target — Palo Alto Networks interview
Reported in Palo Alto Networks USA engineering loops. Classic array + hash map problem testing optimal time–space trade-offs.
Interview atlas
Explore 11 curated Q&As across 1 employers — filter by career stage, round, or company.
Filtered Palo Alto Networks ×
Reported in Palo Alto Networks USA engineering loops. Classic array + hash map problem testing optimal time–space trade-offs.
Reported in Palo Alto Networks USA engineering loops. Foundational search algorithm with clear loop invariants and edge cases.
Reported in Palo Alto Networks USA engineering loops. Pointer manipulation staple for junior coding interviews.
Reported in Palo Alto Networks USA engineering loops. Graph traversal question covering shortest paths, connectivity, and complexity.
Reported in Palo Alto Networks USA engineering loops. Tree recursion warm-up that often leads to balanced-tree and diameter follow-ups.
Reported in Palo Alto Networks USA engineering loops. Sliding window pattern for substring problems with hash set or map tracking.
Reported in Palo Alto Networks USA engineering loops. Sort-and-sweep array problem common in calendar and scheduling interviews.
Reported in Palo Alto Networks USA engineering loops. HR negotiation question requiring research and flexible framing.
Reported in Palo Alto Networks USA engineering loops. SQL performance question covering B-trees, composite indexes, and trade-offs.
Reported in Palo Alto Networks USA engineering loops. Security and networking question covering encryption, certificates, and performance.
Reported in Palo Alto Networks USA engineering loops. Recruiter or HR question about logistics, time zones, and loop structure.