Added task 2269.

Author: javadev

README.md

@@ -1369,6 +1369,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
 | 2286 |[Booking Concert Tickets in Groups](src/main/java/g2201_2300/s2286_booking_concert_tickets_in_groups/BookMyShow.java)| Hard | Binary_Search, Design, Binary_Indexed_Tree, Segment_Tree | 283 | 67.08
 | 2280 |[Minimum Lines to Represent a Line Chart](src/main/java/g2201_2300/s2280_minimum_lines_to_represent_a_line_chart/Solution.java)| Medium | Array, Math, Geometry, Sorting, Number_Theory | 40 | 96.09
 | 2274 |[Maximum Consecutive Floors Without Special Floors](src/main/java/g2201_2300/s2274_maximum_consecutive_floors_without_special_floors/Solution.java)| Medium | Array, Sorting | 33 | 99.36
+| 2269 |[Find the K-Beauty of a Number](src/main/java/g2201_2300/s2269_find_the_k_beauty_of_a_number/Solution.java)| Easy | Math, String, Sliding_Window | 2 | 38.88
 | 2260 |[Minimum Consecutive Cards to Pick Up](src/main/java/g2201_2300/s2260_minimum_consecutive_cards_to_pick_up/Solution.java)| Medium | Array, Hash_Table, Sliding_Window | 50 | 97.04
 | 2259 |[Remove Digit From Number to Maximize Result](src/main/java/g2201_2300/s2259_remove_digit_from_number_to_maximize_result/Solution.java)| Easy | String, Greedy, Enumeration | 1 | 97.73
 | 2257 |[Count Unguarded Cells in the Grid](src/main/java/g2201_2300/s2257_count_unguarded_cells_in_the_grid/Solution.java)| Medium | Array, Matrix, Simulation | 32 | 70.28

src/main/java/g2201_2300/s2269_find_the_k_beauty_of_a_number/Solution.java

@@ -0,0 +1,28 @@
+package g2201_2300.s2269_find_the_k_beauty_of_a_number;
+
+// #Easy #Math #String #Sliding_Window #2022_06_15_Time_2_ms_(38.88%)_Space_41.3_MB_(41.96%)
+
+public class Solution {
+ public int divisorSubstrings(int num, int k) {
+ int i = 0;
+ int j = 0;
+ int count = 0;
+ String s = String.valueOf(num);
+ StringBuilder sb = new StringBuilder();
+ while (i < s.length() && j < s.length()) {
+ sb.append(s.charAt(j) - '0');
+ int val = Integer.parseInt(sb.toString());
+ if (j - i + 1 == k) {
+ if (val != 0 && num % val == 0) {
+ count++;
+ }
+ sb.deleteCharAt(0);
+ i++;
+ j++;
+ } else {
+ j++;
+ }
+ }
+ return count;
+ }
+}

src/main/java/g2201_2300/s2269_find_the_k_beauty_of_a_number/readme.md

@@ -0,0 +1,56 @@
+2269\. Find the K-Beauty of a Number
+
+Easy
+
+The **k-beauty** of an integer `num` is defined as the number of **substrings** of `num` when it is read as a string that meet the following conditions:
+
+* It has a length of `k`.
+* It is a divisor of `num`.
+
+Given integers `num` and `k`, return _the k-beauty of_ `num`.
+
+Note:
+
+* **Leading zeros** are allowed.
+* `0` is not a divisor of any value.
+
+A **substring** is a contiguous sequence of characters in a string.
+
+**Example 1:**
+
+**Input:** num = 240, k = 2
+
+**Output:** 2
+
+**Explanation:** The following are the substrings of num of length k:
+
+- "24" from "**24**0": 24 is a divisor of 240.
+
+- "40" from "2**40**": 40 is a divisor of 240.
+
+Therefore, the k-beauty is 2. 
+
+**Example 2:**
+
+**Input:** num = 430043, k = 2
+
+**Output:** 2
+
+**Explanation:** The following are the substrings of num of length k:
+
+- "43" from "**43**0043": 43 is a divisor of 430043.
+
+- "30" from "4**30**043": 30 is not a divisor of 430043.
+
+- "00" from "43**00**43": 0 is not a divisor of 430043.
+
+- "04" from "430**04**3": 4 is not a divisor of 430043.
+
+- "43" from "4300**43**": 43 is a divisor of 430043.
+
+Therefore, the k-beauty is 2. 
+
+**Constraints:**
+
+* <code>1 <= num <= 10<sup>9</sup></code>
+* `1 <= k <= num.length` (taking `num` as a string)

src/test/java/g2201_2300/s2269_find_the_k_beauty_of_a_number/SolutionTest.java

@@ -0,0 +1,18 @@
+package g2201_2300.s2269_find_the_k_beauty_of_a_number;
+
+import static org.hamcrest.CoreMatchers.equalTo;
+import static org.hamcrest.MatcherAssert.assertThat;
+
+import org.junit.jupiter.api.Test;
+
+class SolutionTest {
+ @Test
+ void divisorSubstrings() {
+ assertThat(new Solution().divisorSubstrings(240, 2), equalTo(2));
+ }
+
+ @Test
+ void divisorSubstrings2() {
+ assertThat(new Solution().divisorSubstrings(430043, 2), equalTo(2));
+ }
+}