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 fe0c006f..585a3b9b 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
@@ -136,268 +136,270 @@ LeetCode Algorithm
| 16 | 3Sum Closest | C | Medium |
+| 17 | Letter Combinations of a Phone Number | C | Medium |
+
| 20 | Valid Parentheses | C | Easy |
-
+
| 21 | Merge Two Sorted Lists | C | Easy |
-
+
| 24 | Swap Nodes in Pairs | C | Medium |
-
+
| 26 | Remove Duplicates from Sorted Array | C | Easy |
-
+
| 27 | Remove Element | C | Easy |
-
+
| 28 | Find the Index of the First Occurrence in a String | C | Medium |
-
+
| 29 | Divide Two Integers | C | Medium |
-
+
| 32 | Longest Valid Parentheses | C | Hard |
-
+
| 35 | Search Insert Position | C | Easy |
-
+
| 37 | Sudoku Solver | C | Hard |
-
+
| 38 | Count and Say | C | Medium |
-
+
| 42 | Trapping Rain Water | C | Hard |
-
+
| 45 | Jump Game II | C | Medium |
-
+
| 50 | Pow(x, n) | C | Medium |
-
+
| 53 | Maximum Subarray | C | Medium |
-
+
| 62 | Unique Paths | C | Medium |
-
+
| 63 | Unique Paths II | C | Medium |
-
+
| 66 | Plus One | C | Easy |
-
+
| 75 | Sort Colors | C | Medium |
-
+
| 79 | Word Search | C | Medium |
-
+
| 82 | Remove Duplicates from Sorted List II | C | Medium |
-
+
| 83 | Remove Duplicates from Sorted List | C | Easy |
-
+
| 94 | Binary Tree Inorder Traversal | C | Easy |
-
+
| 98 | Validate Binary Search Tree | C | Medium |
-
+
| 101 | Symmetric Tree | C | Easy |
-
+
| 104 | Maximum Depth of Binary Tree | C | Easy |
-
+
| 108 | Convert Sorted Array to Binary Search Tree | C | Easy |
-
+
| 109 | Convert Sorted List to Binary Search Tree | C | Medium |
-
+
| 110 | Balanced Binary Tree | C | Easy |
-
+
| 112 | Path Sum | C | Easy |
-
+
| 118 | Pascal's Triangle | C | Easy |
-
+
| 119 | Pascal's Triangle II | C | Easy |
-
+
| 121 | Best Time to Buy and Sell Stock | C | Easy |
-
+
| 124 | Binary Tree Maximum Path Sum | C | Hard |
-
+
| 125 | Valid Palindrome | C | Easy |
-
+
| 136 | Single Number | C | Easy |
-
+
| 141 | Linked List Cycle | C | Easy |
-
+
| 142 | Linked List Cycle II | C | Medium |
-
+
| 153 | Find Minimum in Rotated Sorted Array | C | Medium |
-
+
| 160 | Intersection of Two Linked Lists | C | Easy |
-
+
| 169 | Majority Element | C | Easy |
-
+
| 173 | Binary Search Tree Iterator | C | Medium |
-
+
| 189 | Rotate Array | C | Medium |
-
+
| 190 | Reverse Bits | C | Easy |
-
+
| 191 | Number of 1 Bits | C | Easy |
-
+
| 201 | Bitwise AND of Numbers Range | C | Medium |
-
+
| 203 | Remove Linked List Elements | C | Easy |
-
+
| 206 | Reverse Linked List | C | Easy |
-
+
| 215 | Kth Largest Element in an Array | C | Medium |
-
+
| 217 | Contains Duplicate | C | Easy |
-
+
| 223 | Rectangle Area | C | Medium |
-
+
| 226 | Invert Binary Tree | C | Easy |
-
+
| 230 | Kth Smallest Element in a BST | C | Medium |
-
+
| 231 | Power of Two | C | Easy |
-
+
| 234 | Palindrome Linked List | C | Easy |
-
+
| 236 | Lowest Common Ancestor of a Binary Tree | C | Medium |
-
+
| 242 | Valid Anagram | C | Easy |
-
+
| 268 | Missing Number | C | Easy |
-
+
| 274 | H-Index | C | Medium |
-
+
| 278 | First Bad Version | C | Easy |
-
+
| 283 | Move Zeroes | C | Easy |
-
+
| 287 | Find the Duplicate Number | C | Medium |
-
+
| 344 | Reverse String | C | Easy |
-
+
| 367 | Valid Perfect Square | C | Easy |
-
+
| 387 | First Unique Character in a String | C | Easy |
-
+
| 389 | Find the Difference | C | Easy |
-
+
| 404 | Sum of Left Leaves | C | Easy |
-
+
| 442 | Find All Duplicates in an Array | C | Medium |
-
+
| 461 | Hamming Distance | C | Easy |
-
+
| 476 | Number Complement | C | Easy |
-
+
| 485 | Max Consecutive Ones | C | Easy |
-
+
| 509 | Fibonacci Number | C | Easy |
-
+
| 520 | Detect Capital | C | Easy |
-
+
| 540 | Single Element in a Sorted Array | C | Medium |
-
+
| 561 | Array Partition | C | Easy |
-
+
| 567 | Permutation in String | C | Medium |
-
+
| 617 | Merge Two Binary Trees | C | Easy |
-
+
| 647 | Palindromic Substrings | C | Medium |
-
+
| 669 | Trim a Binary Search Tree | C | Medium |
-
+
| 674 | Longest Continuous Increasing Subsequence | C | Easy |
-
+
| 684 | Redundant Connection | C | Medium |
-
+
| 700 | Search in a Binary Search Tree | C | Easy |
-
+
| 701 | Insert into a Binary Search Tree | C | Medium |
-
+
| 704 | Binary Search | C | Easy |
-
+
| 709 | To Lower Case | C | Easy |
-
+
| 771 | Jewels and Stones | C | Easy |
-
+
| 807 | Max Increase to Keep City Skyline | C | Medium |
-
+
| 841 | Keys and Rooms | C | Medium |
-
+
| 852 | Peak Index in a Mountain Array | C | Medium |
-
+
| 876 | Middle of the Linked List | C | Easy |
-
+
| 901 | Online Stock Span | C | Medium |
-
+
| 905 | Sort Array By Parity | C | Easy |
-
+
| 917 | Reverse Only Letters | C | Easy |
-
+
| 931 | Minimum Falling Path Sum | C | Medium |
-
+
| 938 | Range Sum of BST | C | Easy |
-
+
| 953 | Verifying an Alien Dictionary | C | Easy |
-
+
| 965 | Univalued Binary Tree | C | Easy |
-
+
| 977 | Squares of a Sorted Array | C | Easy |
-
+
| 979 | Distribute Coins in Binary Tree | C | Medium |
-
+
| 985 | Sum of Even Numbers After Queries | C | Medium |
-
+
| 997 | Find the Town Judge | C | Easy |
-
+
| 1008 | Construct Binary Search Tree from Preorder Traversal | C | Medium |
-
+
| 1009 | Complement of Base 10 Integer | C | Easy |
-
+
| 1019 | Next Greater Node In Linked List | C | Medium |
-
+
| 1026 | Maximum Difference Between Node and Ancestor | C | Medium |
-
+
| 1089 | Duplicate Zeros | C | Easy |
-
+
| 1137 | N-th Tribonacci Number | C | Easy |
-
+
| 1147 | Longest Chunked Palindrome Decomposition | C | Hard |
-
+
| 1184 | Distance Between Bus Stops | C | Easy |
-
+
| 1189 | Maximum Number of Balloons | C | Easy |
-
+
| 1207 | Unique Number of Occurrences | C | Easy |
-
+
| 1283 | Find the Smallest Divisor Given a Threshold | C | Medium |
-
+
| 1524 | Number of Sub-arrays With Odd Sum | C | Medium |
-
+
| 1653 | Minimum Deletions to Make String Balanced | C | Medium |
-
+
| 1657 | Determine if Two Strings Are Close | C | Medium |
-
+
| 1695 | Maximum Erasure Value | C | Medium |
-
+
| 1704 | Determine if String Halves Are Alike | C | Easy |
-
+
| 1752 | Check if Array Is Sorted and Rotated | C | Easy |
-
+
| 1769 | Minimum Number of Operations to Move All Balls to Each Box | C | Medium |
-
+
| 1833 | Maximum Ice Cream Bars | C | Medium |
-
+
| 1838 | Frequency of the Most Frequent Element | C | Medium |
-
+
| 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 |
-
+
| 2279 | Maximum Bags With Full Capacity of Rocks | 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 04b85fe3..289f61f1 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() : sol1.c
isPrime() : prime.c
+isprime() : sol1.c
isStrong() : strong_number.c
diff --git a/globals_i.html b/globals_i.html
index efeb88f9..3a9dd7a3 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() : sol1.c
isPrime() : prime.c
+isprime() : sol1.c
isStrong() : strong_number.c
diff --git a/search/all_b.js b/search/all_b.js
index c43fe7af..7e646be6 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',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
- ['isprime_28',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.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']]],
['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 f8cdfa79..99456305 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',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
- ['isprime_20',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.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']]],
['isstrong_21',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
];