Salesforce

2 DSA problems asked in Salesforce coding interviews

1 Easy
0 Medium
1 Hard

2 problems

Arrays & Hashing
1
First Missing Positive
Hard

Given an unsorted integer array nums, return the smallest missing positive integer. Must run in O(n) time and O(1) auxiliary space.

Binary Search
1
Kth Missing Positive Number
Easy

Given an array arr of positive integers sorted in a strictly increasing order, and an integer k, return the kth positive integer that is missing from this array.