SP Data Structures and Algorithms 2

Question 1

Which Salesforce collection type maintains insertion order and allows duplicate values?

Accepted Answer

List

Answer

List in Apex maintains insertion order and permits duplicate elements, unlike Set which is unordered and unique.

Question 2

What is the time complexity of searching for an element in an unsorted Apex List?

Accepted Answer

O(n)

Answer

Searching an unsorted list requires iterating through elements one by one, resulting in O(n) linear time.

Question 3

In Salesforce, which data structure is most appropriate for tracking unique Account IDs collected during a batch process?

Accepted Answer

Set<Id>

Answer

Set<Id> automatically enforces uniqueness, preventing duplicate IDs from being stored.

Question 4

A developer needs to count how many times each Status value appears across a list of Cases. Which approach is most efficient?

Accepted Answer

A Map<String,Integer> incremented per Status

Answer

A Map keyed by Status with an Integer count value allows O(1) lookup and increment per record.

Question 5

Which sorting algorithm is generally most efficient for large, nearly-sorted datasets?

Accepted Answer

Insertion Sort

Answer

Insertion Sort performs close to O(n) on nearly-sorted data because few elements need to be moved.

SP (Certified Service Provider) Practice Test