@@ -16,6 +16,7 @@ This repository contains solutions to various LeetCode problems implemented in C
 | 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | Easy | [Code](https://github.com/gabaoalb/LeetCodeCSharp/blob/main/Solutions/Problems/ContainsDuplicate.cs) |
 | 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | Easy | [Code](https://github.com/gabaoalb/LeetCodeCSharp/blob/main/Solutions/Problems/InvertBinaryTree.cs) |
 | 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | Easy | [Code](https://github.com/gabaoalb/LeetCodeCSharp/blob/main/Solutions/Problems/ValidAnagram.cs) |
+| 271 | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/) | Medium | [Code](https://github.com/gabaoalb/LeetCodeCSharp/blob/main/Solutions/Problems/EncodeAndDecodeStrings.cs) |
 | 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | Medium | [Code](https://github.com/gabaoalb/LeetCodeCSharp/blob/main/Solutions/Problems/TopKFrequentElements.cs) |
 | 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | Easy | [Code](https://github.com/gabaoalb/LeetCodeCSharp/blob/main/Solutions/Problems/DiameterOfBinaryTree.cs) |
 | 853 | [Car Fleet](https://leetcode.com/problems/car-fleet/) | Medium | [Code](https://github.com/gabaoalb/LeetCodeCSharp/blob/main/Solutions/Problems/CarFleet.cs) |
@@ -0,0 +1,50 @@
+using Solutions.Problems;
+
+namespace Solutions.Tests.Problems;
+
+public class EncodeAndDecodeStringsTest
+{
+    public EncodeAndDecodeStringsSolution Solution { get; set; } = new();
+
+    [Fact]
+    public void Case1()
+    {
+        // Arrange
+        IList<string> strs = ["Hello", "World"];
+
+        // Act
+        string encoded = Solution.Encode(strs);
+        IList<string> decoded = Solution.Decode(encoded);
+
+        // Assert
+        Assert.Equal(strs, decoded);
+    }
+
+    [Fact]
+    public void Case2()
+    {
+        // Arrange
+        IList<string> strs = ["Foo", "Bar", "Baz"];
+
+        // Act
+        string encoded = Solution.Encode(strs);
+        IList<string> decoded = Solution.Decode(encoded);
+
+        // Assert
+        Assert.Equal(strs, decoded);
+    }
+
+    [Fact]
+    public void Case3()
+    {
+        // Arrange
+        IList<string> strs = ["", " ", "   "];
+
+        // Act
+        string encoded = Solution.Encode(strs);
+        IList<string> decoded = Solution.Decode(encoded);
+
+        // Assert
+        Assert.Equal(strs, decoded);
+    }
+}
@@ -4,7 +4,7 @@ namespace Solutions.Tests.Problems;
 
 public class TopKFrequentElementsTest
 {
-    public TopKFrequentElementsSolution Solution = new();
+    public TopKFrequentElementsSolution Solution { get; set; } = new();
 
     [Fact]
     public void Case1()
 
@@ -0,0 +1,12 @@
+namespace Solutions.Problems;
+
+public class EncodeAndDecodeStringsSolution
+{
+    public string Encode(IList<string> strs) =>
+        string.Join('/', strs.Select(s => $"{s.Length}/{s}"));
+
+    public IList<string> Decode(string s) =>
+        [.. s.Split('/')
+             .Chunk(2)
+             .Select(c => c[1])];
+}
Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@ namespace Solutions.Tests.Problems;`
`4`	`4`
`5`	`5`	`public class TopKFrequentElementsTest`
`6`	`6`	`{`
`7`		`- public TopKFrequentElementsSolution Solution = new();`
	`7`	`+ public TopKFrequentElementsSolution Solution { get; set; } = new();`
`8`	`8`
`9`	`9`	`[Fact]`
`10`	`10`	`public void Case1()`