Quick Overview

This question evaluates data structure manipulation and string-processing competencies, specifically linked-list deduplication and finding the longest string that is both a subsequence of one string and a substring of another.

Remove duplicates and find constrained longest subsequence

Company: Salesforce

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: easy

Interview Round: Take-home Project

Quick Answer: This question evaluates data structure manipulation and string-processing competencies, specifically linked-list deduplication and finding the longest string that is both a subsequence of one string and a substring of another.

Loading…