Added 2185 2186

Author: trung-hn

Readme.md

@@ -651,6 +651,8 @@
 | 2140 | [Solving Questions With Brainpower](src/2140.solving-questions-with-brainpower.py)                                                                                   | Medium | O(N)                  | O(N)           | Array, Dynamic Programming                                                                           |                                         |           |
 | 2176 | [Count Equal and Divisible Pairs in an Array](src/2176.count-equal-and-divisible-pairs-in-an-array.py)                                                               | Easy   | O(N^2)                | O(1)           | Array                                                                                                |                                         |           |
 | 2177 | [Count Equal and Divisible Pairs in an Array](src/2177.find-three-consecutive-integers-that-sum-to-a-given-number.py)                                                | Medium | O(1)                  | O(1)           | Math, Binary Search                                                                                  |                                         |           |
+| 2185 | [Counting Words With a Given Prefix](src/2185.counting-words-with-a-given-prefix.py)                                                                                 | Easy   | O(N)                  | O(1)           | Array, String                                                                                        |                                         |           |
+| 2186 | [Minimum Number of Steps to Make Two Strings Anagram II](src/2186.minimum-number-of-steps-to-make-two-strings-anagram-ii.py)                                         | Medium | O(N)                  | O(N)           | Hash Table, String, Counting                                                                         |                                         |           |
 | 2190 | [Most Frequent Number Following Key In an Array](src/2190.most-frequent-number-following-key-in-an-array.py)                                                         | Easy   | O(N)                  | O(N)           | Array, Hash Table, Counting                                                                          |                                         |           |
 | 2191 | [Sort the Jumbled Numbers](src/2191.sort-the-jumbled-numbers.py)                                                                                                     | Medium | O(NlogN)              | O(1)           | Array, Sorting                                                                                       |                                         |           |
 | 2192 | [All Ancestors of a Node in a Directed Acyclic Graph](src/2192.all-ancestors-of-a-node-in-a-directed-acyclic-graph.py)                                               | Medium | O(N+V)                | O(U+V)         | DFS, BFS, Topological Sort, Graph                                                                    |                                         |           |

src/2185.counting-words-with-a-given-prefix.py

@@ -0,0 +1,14 @@
+#
+# @lc app=leetcode id=2185 lang=python3
+#
+# [2185] Counting Words With a Given Prefix
+#
+
+# @lc code=start
+from typing import List
+
+
+class Solution:
+    def prefixCount(self, words: List[str], pref: str) -> int:
+        return sum(w.startswith(pref) for w in words)
+# @lc code=end

src/2186.minimum-number-of-steps-to-make-two-strings-anagram-ii.py

@@ -0,0 +1,18 @@
+#
+# @lc app=leetcode id=2186 lang=python3
+#
+# [2186] Minimum Number of Steps to Make Two Strings Anagram II
+#
+
+# @lc code=start
+# TAGS: Hash Table, String, Counting
+import collections
+
+
+class Solution:
+    def minSteps(self, s: str, t: str) -> int:
+        c1 = collections.Counter(s)
+        c2 = collections.Counter(t)
+        return sum((c1 - c2).values()) + sum((c2 - c1).values())
+
+# @lc code=end