Update readme.

README.md

@@ -1,15 +1,11 @@
 # Welcome to the Coding Challenges Repository! 🚀
 
----
-
 This repository is a consolidated collection of solutions to popular coding challenges. 
 It serves as a resource for practicing problem-solving skills, learning various algorithms, 
 and understanding common patterns in coding interviews.
 
 ## Structure
 
----
-
 The repository is organized into multiple sections to streamline access to different types of content. 
 Each section focuses on a unique platform, making it easy to explore specific challenges and solutions.
 
@@ -40,7 +36,5 @@ making it ideal for preparing for technical interviews in software development.
 
 ## Build & Code Coverage
 
----
-
 [![.NET](https://github.com/eminencegrs/coding-challenges/actions/workflows/dotnet.yml/badge.svg)](https://github.com/eminencegrs/coding-challenges/actions/workflows/dotnet.yml)
 [![codecov](https://codecov.io/gh/eminencegrs/coding-challenges/graph/badge.svg?token=UE997CV8PZ)](https://codecov.io/gh/eminencegrs/coding-challenges)

Theory/CommonPatterns&Approaches.md

@@ -2,7 +2,9 @@
 
 ## Sliding Window
 
-It is a technique used to solve problems involving a subset of elements within an **array** or **sequence**.  
+**It is a technique used to solve problems involving a subset of elements within an array or sequence. 
+It helps to reduce the use of nested loops and replace it with a single loop, thereby reducing the time complexity.**  
+
 It is particularly useful when the goal is to find an optimal range or calculate a specific measurement 
 within a subset of contiguous elements. The main idea is to maintain a "window" that slides across 
 the array from the beginning to the end. This window can vary in size, depending on the problem:
@@ -11,6 +13,15 @@ the array from the beginning to the end. This window can vary in size, depending
 
  - **Variable-Size Sliding Window:** Useful for problems where the window can grow or shrink, often to meet a condition dynamically.
 
+### Use Cases
+
+ - Minimum value
+ - Maximum value
+ - Average Value
+ - Longest value
+ - Shortest value
+ - K-sized value
+
 ### Key Steps
 
  1. Initialize the window with the required starting elements (for fixed or variable sizes).