Add solution #5319

Author: JoshCrozier

5319-remove-palindromic-subsequences.js

@@ -0,0 +1,23 @@
+/**
+ * 5319. Remove Palindromic Subsequences
+ * https://leetcode.com/problems/remove-palindromic-subsequences/
+ * Difficulty: Easy
+ *
+ * Given a string s consisting only of letters 'a' and 'b'.
+ * In a single step you can remove one palindromic subsequence from s.
+ *
+ * Return the minimum number of steps to make the given string empty.
+ * A string is a subsequence of a given string, if it is generated by
+ * deleting some characters of a given string without changing its order.
+ *
+ * A string is called palindrome if is one that reads the same backward
+ * as well as forward.
+ */
+
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var removePalindromeSub = function(s) {
+  return s.length === 0 ? 0 : (s.split('').reverse().join('') === s ? 1 : 2);
+};

README.md

@@ -63,6 +63,7 @@
 1318|[Minimum Flips to Make a OR b Equal to c](./1318-minimum-flips-to-make-a-or-b-equal-to-c.js)|Medium|
 1323|[Maximum 69 Number](./1323-maximum-69-number.js)|Easy|
 1324|[Print Words Vertically](./1324-print-words-vertically.js)|Medium|
+5319|[Remove Palindromic Subsequences](./5319-remove-palindromic-subsequences.js)|Easy|
 5320|[Filter Restaurants by Vegan-Friendly, Price and Distance](./5320-filter-restaurants-by-vegan-friendly-price-and-distance.js)|Medium|
 
 ## License