From a0fa0ae27d7e63a1e5276e3cdab4367ade7f4bb3 Mon Sep 17 00:00:00 2001
From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Date: Fri, 20 Jan 2023 23:42:16 +0000
Subject: [PATCH] Documentation for 73913ac4a8e5808eeae96d94fb4cc988f699aa99
---
d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html | 34 ++++++++++++----------
globals_func_i.html | 2 +-
globals_i.html | 2 +-
search/all_b.js | 4 +--
search/functions_9.js | 4 +--
5 files changed, 24 insertions(+), 22 deletions(-)
diff --git a/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html b/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
index 8be14b43..36cc10b9 100644
--- a/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
+++ b/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
@@ -324,38 +324,40 @@ LeetCode Algorithm
1207 | Unique Number of Occurrences | C | Easy |
+1283 | [Find the Smallest Divisor Given a Threshold]https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/description/) | C | Medium |
+
1695 | Maximum Erasure Value | C | Medium |
-
+
1769 | Minimum Number of Operations to Move All Balls to Each Box | C | Medium |
-
+
1524 | Number of Sub-arrays With Odd Sum | C | Medium |
-
+
1653 | Minimum Deletions to Make String Balanced | C | Medium |
-
+
1704 | [Determine if String Halves Are Alike](Determine if String Halves Are Alike) | C | Easy |
-
+
1838 | Frequency of the Most Frequent Element | C | Medium |
-
+
1752 | Check if Array Is Sorted and Rotated | C | Easy |
-
+
2024 | Maximize the Confusion of an Exam | C | Medium |
-
+
2095 | Delete the Middle Node of a Linked List | C | Medium |
-
+
2125 | Number of Laser Beams in a Bank | C | Medium |
-
+
2130 | Maximum Twin Sum of a Linked List | C | Medium |
-
+
2222 | Number of Ways to Select Buildings | C | Medium |
-
+
2256 | Minimum Average Difference | C | Medium |
-
+
2270 | Number of Ways to Split Array | C | Medium |
-
-2304 | Minimum Path Cost in a Grid | C | Medium |
-2482 | Difference Between Ones and Zeros in Row and Column | C | Medium |
+2304 | Minimum Path Cost in a Grid | C | Medium |
+2482 | Difference Between Ones and Zeros in Row and Column | C | Medium |
+
2501 | Longest Square Streak in an Array | C | Medium |
diff --git a/globals_func_i.html b/globals_func_i.html
index 289f61f1..04b85fe3 100644
--- a/globals_func_i.html
+++ b/globals_func_i.html
@@ -119,8 +119,8 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
isEmpty() : infix_to_postfix.c, infix_to_postfix2.c
isOprnd() : infix_to_postfix.c
isPalindrome() : palindrome.c
-isPrime() : prime.c
isprime() : sol1.c
+isPrime() : prime.c
isStrong() : strong_number.c
diff --git a/globals_i.html b/globals_i.html
index 3a9dd7a3..efeb88f9 100644
--- a/globals_i.html
+++ b/globals_i.html
@@ -120,8 +120,8 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
isEmpty() : infix_to_postfix.c, infix_to_postfix2.c
isOprnd() : infix_to_postfix.c
isPalindrome() : palindrome.c
-isPrime() : prime.c
isprime() : sol1.c
+isPrime() : prime.c
isStrong() : strong_number.c
diff --git a/search/all_b.js b/search/all_b.js
index 7e646be6..c43fe7af 100644
--- a/search/all_b.js
+++ b/search/all_b.js
@@ -27,7 +27,7 @@ var searchData=
['isempty_24',['isEmpty',['../db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021',1,'isEmpty(struct Stack s): infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e',1,'isEmpty(): infix_to_postfix2.c']]],
['isoprnd_25',['isOprnd',['../db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b',1,'infix_to_postfix.c']]],
['ispalindrome_26',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
- ['isprime_27',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
- ['isprime_28',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
+ ['isprime_27',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
+ ['isprime_28',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isstrong_29',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
];
diff --git a/search/functions_9.js b/search/functions_9.js
index 99456305..f8cdfa79 100644
--- a/search/functions_9.js
+++ b/search/functions_9.js
@@ -19,7 +19,7 @@ var searchData=
['isempty_16',['isEmpty',['../db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021',1,'isEmpty(struct Stack s): infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e',1,'isEmpty(): infix_to_postfix2.c']]],
['isoprnd_17',['isOprnd',['../db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b',1,'infix_to_postfix.c']]],
['ispalindrome_18',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
- ['isprime_19',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
- ['isprime_20',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
+ ['isprime_19',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
+ ['isprime_20',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isstrong_21',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
];