LeetCode Experience

#1930 Unique Length-3 Palindromic Subsequences

Interview Experience

LeetCode #1930: Unique Length-3 Palindromic Subsequences. Difficulty: Medium. Topics: Hash Table, String, Bit Manipulation, Prefix Sum. Asked at Microsoft in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Prefix Sum Arrays Bit Manipulation Hash Table Strings