LeetCode
Experience
#2193 Minimum Number of Moves to Make Palindrome
Interview Experience
LeetCode #2193: Minimum Number of Moves to Make Palindrome. Difficulty: Hard. Topics: Two Pointers, String, Greedy, Binary Indexed Tree. Asked at IBM 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
Binary Indexed Tree
Greedy
Strings
Two Pointers