|
27 | 27 | <th>Solution</th>
|
28 | 28 | <th>Topics</th>
|
29 | 29 | </tr>
|
| 30 | + <tr> |
| 31 | + <td align="center">September 13th</td> |
| 32 | + <td>1814. <a href="https://leetcode.com/problems/count-nice-pairs-in-an-array/">Count Nice Pairs in an Array</a></td> |
| 33 | + <td align="center">$\text{\color{Dandelion}Medium}$</td> |
| 34 | + <td align="center"> |
| 35 | + <a href="https://github.com/cheehwatang/leetcode-java/blob/main/solutions/1814.%20Count%20Nice%20Pairs%20in%20an%20Array/CountNicePairsInAnArray.java">Counting & Hash Table</a> |
| 36 | + </td> |
| 37 | + <td align="center"> |
| 38 | + <a href="#array">Array</a>, |
| 39 | + <a href="#counting">Counting</a>, |
| 40 | + <a href="#hash-table">Hash Table</a>, |
| 41 | + <a href="#math">Math</a> |
| 42 | + </td> |
| 43 | + </tr> |
30 | 44 | <tr>
|
31 | 45 | <td align="center">September 12th</td>
|
32 | 46 | <td>2006. <a href="https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/">Count Number of Pairs With Absolute Difference K</a></td>
|
|
75 | 89 | <a href="#simulation">Simulation</a>
|
76 | 90 | </td>
|
77 | 91 | </tr>
|
78 |
| - <tr> |
79 |
| - <td align="center">September 8th</td> |
80 |
| - <td>1155. <a href="https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/">Number of Dice Rolls With Target Sum</a></td> |
81 |
| - <td align="center">$\text{\color{Dandelion}Medium}$</td> |
82 |
| - <td align="center"> |
83 |
| - <a href="https://github.com/cheehwatang/leetcode-java/blob/main/solutions/1155.%20Number%20of%20Dice%20Rolls%20With%20Target%20Sum/NumberOfDiceRollsWithTargetSum_Memoization.java">Dynamic Programming - Memoization</a> |
84 |
| - </td> |
85 |
| - <td align="center"> |
86 |
| - <a href="#dynamic-programming">Dynamic Programming</a> |
87 |
| - </td> |
88 |
| - </tr> |
89 | 92 | </table>
|
90 | 93 | </br>
|
91 | 94 | <hr>
|
|
1451 | 1454 | </td>
|
1452 | 1455 | <td></td>
|
1453 | 1456 | </tr>
|
| 1457 | + <tr> |
| 1458 | + <td align="center">1814</td> |
| 1459 | + <td><a href="https://leetcode.com/problems/count-nice-pairs-in-an-array/">Count Nice Pairs in an Array</a></td> |
| 1460 | + <td align="center"> |
| 1461 | + <a href="https://github.com/cheehwatang/leetcode-java/blob/main/solutions/1814.%20Count%20Nice%20Pairs%20in%20an%20Array/CountNicePairsInAnArray.java">Java</a> |
| 1462 | + </td> |
| 1463 | + <td align="center">$\text{\color{Dandelion}Medium}$</td> |
| 1464 | + <td align="center"> |
| 1465 | + <a href="#array">Array</a>, |
| 1466 | + <a href="#counting">Counting</a>, |
| 1467 | + <a href="#hash-table">Hash Table</a>, |
| 1468 | + <a href="#math">Math</a> |
| 1469 | + </td> |
| 1470 | + <td></td> |
| 1471 | + </tr> |
1454 | 1472 | <tr>
|
1455 | 1473 | <td align="center">1833</td>
|
1456 | 1474 | <td><a href="https://leetcode.com/problems/maximum-ice-cream-bars/">Maximum Ice Cream Bars</a></td>
|
|
3377 | 3395 | </td>
|
3378 | 3396 | <td></td>
|
3379 | 3397 | </tr>
|
| 3398 | + <tr> |
| 3399 | + <td align="center">1814</td> |
| 3400 | + <td><a href="https://leetcode.com/problems/count-nice-pairs-in-an-array/">Count Nice Pairs in an Array</a></td> |
| 3401 | + <td align="center"> |
| 3402 | + <a href="https://github.com/cheehwatang/leetcode-java/blob/main/solutions/1814.%20Count%20Nice%20Pairs%20in%20an%20Array/CountNicePairsInAnArray.java">Java</a> |
| 3403 | + </td> |
| 3404 | + <td align="center">$\text{\color{Dandelion}Medium}$</td> |
| 3405 | + <td align="center"> |
| 3406 | + <a href="#array">Array</a>, |
| 3407 | + <a href="#counting">Counting</a>, |
| 3408 | + <a href="#hash-table">Hash Table</a>, |
| 3409 | + <a href="#math">Math</a> |
| 3410 | + </td> |
| 3411 | + <td></td> |
| 3412 | + </tr> |
3380 | 3413 | <tr>
|
3381 | 3414 | <td align="center">2006</td>
|
3382 | 3415 | <td><a href="https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/">Count Number of Pairs With Absolute Difference K</a></td>
|
|
5515 | 5548 | </td>
|
5516 | 5549 | <td></td>
|
5517 | 5550 | </tr>
|
| 5551 | + <tr> |
| 5552 | + <td align="center">1814</td> |
| 5553 | + <td><a href="https://leetcode.com/problems/count-nice-pairs-in-an-array/">Count Nice Pairs in an Array</a></td> |
| 5554 | + <td align="center"> |
| 5555 | + <a href="https://github.com/cheehwatang/leetcode-java/blob/main/solutions/1814.%20Count%20Nice%20Pairs%20in%20an%20Array/CountNicePairsInAnArray.java">Java</a> |
| 5556 | + </td> |
| 5557 | + <td align="center">$\text{\color{Dandelion}Medium}$</td> |
| 5558 | + <td align="center"> |
| 5559 | + <a href="#array">Array</a>, |
| 5560 | + <a href="#counting">Counting</a>, |
| 5561 | + <a href="#hash-table">Hash Table</a>, |
| 5562 | + <a href="#math">Math</a> |
| 5563 | + </td> |
| 5564 | + <td></td> |
| 5565 | + </tr> |
5518 | 5566 | <tr>
|
5519 | 5567 | <td align="center">1832</td>
|
5520 | 5568 | <td><a href="https://leetcode.com/problems/check-if-the-sentence-is-pangram/">Check if the Sentence is Pangram</a></td>
|
|
6459 | 6507 | <a href="https://github.com/cheehwatang/leetcode-java/blob/main/solutions/1680.%20Concatenation%20of%20Consecutive%20Binary%20Numbers/ConcatenationOfConsecutiveBinaryNumbers_BitManipulation.java"><em>Bit Manipulation</em></a>
|
6460 | 6508 | </td>
|
6461 | 6509 | </tr>
|
| 6510 | + <tr> |
| 6511 | + <td align="center">1814</td> |
| 6512 | + <td><a href="https://leetcode.com/problems/count-nice-pairs-in-an-array/">Count Nice Pairs in an Array</a></td> |
| 6513 | + <td align="center"> |
| 6514 | + <a href="https://github.com/cheehwatang/leetcode-java/blob/main/solutions/1814.%20Count%20Nice%20Pairs%20in%20an%20Array/CountNicePairsInAnArray.java">Java</a> |
| 6515 | + </td> |
| 6516 | + <td align="center">$\text{\color{Dandelion}Medium}$</td> |
| 6517 | + <td align="center"> |
| 6518 | + <a href="#array">Array</a>, |
| 6519 | + <a href="#counting">Counting</a>, |
| 6520 | + <a href="#hash-table">Hash Table</a>, |
| 6521 | + <a href="#math">Math</a> |
| 6522 | + </td> |
| 6523 | + <td></td> |
| 6524 | + </tr> |
6462 | 6525 | <tr>
|
6463 | 6526 | <td align="center">1979</td>
|
6464 | 6527 | <td><a href="https://leetcode.com/problems/find-greatest-common-divisor-of-array/">Find Greatest Common Divisor of Array</a></td>
|
|
0 commit comments