add 2490

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -45,6 +45,7 @@
 | 2506 | [Count Pairs Of Similar Strings](https://leetcode.com/problems/count-pairs-of-similar-strings/)                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2506.java)                                       || Easy                                 ||
 | 2496 | [Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/)                                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2496.java)                                       || Easy                                 ||
 | 2492 | [Minimum Score of a Path Between Two Cities](https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2492.java)                                       || Medium                               | Union Find
+| 2490 | [Circular Sentence](https://leetcode.com/problems/circular-sentence/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2490.java)                                       || Easy                                 | 
 | 2481 | [Minimum Cuts to Divide a Circle](https://leetcode.com/problems/minimum-cuts-to-divide-a-circle/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2481.java)                                       || Easy                                 | 
 | 2487 | [Remove Nodes From Linked List](https://leetcode.com/problems/remove-nodes-from-linked-list/)                                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2487.java)                                       || Medium                               | LinkedList, Stack              
 | 2485 | [Find the Pivot Integer](https://leetcode.com/problems/find-the-pivot-integer/)                                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2485.java)                                       || Easy                                 ||

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2490.java

@@ -0,0 +1,15 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2490 {
+    public static class Solution1 {
+        public boolean isCircularSentence(String sentence) {
+            String[] words = sentence.split("\\ ");
+            for (int i = 0; i < words.length - 1; i++) {
+                if (words[i].charAt(words[i].length() - 1) != words[i + 1].charAt(0)) {
+                    return false;
+                }
+            }
+            return words[0].charAt(0) == words[words.length - 1].charAt(words[words.length - 1].length() - 1);
+        }
+    }
+}