← Salesforce questions

Matrix search, BST pair sum, and two-pointer approach

Filed under Salesforce

1. Search for a target element in a row-wise and column-wise sorted 2D matrix. 2. Find two nodes in a Binary Search Tree (BST) that sum up to a given target value x.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Salesforce questions

Collected from public candidate posts and coding forums. Updated Nov 2026.