# Content

* [Algorithms](https://leetcode.realtemirov.uz/algorithms)
  * [Linear Search](https://leetcode.realtemirov.uz/algorithms/linear-search)
  * [Binary Search](https://leetcode.realtemirov.uz/algorithms/binary-search)
  * [Counting Sort](https://leetcode.realtemirov.uz/algorithms/counting-sort)
  * [Merge Sort](https://leetcode.realtemirov.uz/algorithms/merge-sort)
  * [Insertion Sort](https://leetcode.realtemirov.uz/algorithms/insertion-sort)
  * [Selection Sort](https://leetcode.realtemirov.uz/algorithms/selection-sort)
* [Array and String](https://leetcode.realtemirov.uz/array-and-string)
  * [Introduction to Array](https://leetcode.realtemirov.uz/array-and-string/introduction-to-array)
    * [Introduction to Array](https://leetcode.realtemirov.uz/array-and-string/introduction-to-array/introduction-to-array)
    * [Introduction to Dynamic Array](https://leetcode.realtemirov.uz/array-and-string/introduction-to-array/introduction-to-dynamic-array)
    * [Find Pivot Index](https://leetcode.realtemirov.uz/array-and-string/introduction-to-array/find-pivot-index)
    * [Largest Number At Least Twice of Others](https://leetcode.realtemirov.uz/array-and-string/introduction-to-array/largest-number-at-least-twice-of-others)
    * [Plus One](https://leetcode.realtemirov.uz/array-and-string/introduction-to-array/plus-one)
  * [Introduction to 2D Array](https://leetcode.realtemirov.uz/array-and-string/introduction-to-2d-array)
    * [Introduction to 2D Array](https://leetcode.realtemirov.uz/array-and-string/introduction-to-2d-array/introduction-to-2d-array)
    * [Diagonal Traverse](https://leetcode.realtemirov.uz/array-and-string/introduction-to-2d-array/diagonal-traverse)
    * [Spiral Matrix](https://leetcode.realtemirov.uz/array-and-string/introduction-to-2d-array/spiral-matrix)
    * [Pascal's Triangle](https://leetcode.realtemirov.uz/array-and-string/introduction-to-2d-array/pascals-triangle)
  * [Introduction to String](https://github.com/realtemirov/leetcode/blob/main/Array%20and%20String/Introduction%20ot%20String/README.md)
    * [Introduction to String](https://leetcode.realtemirov.uz/array-and-string/introduction-to-string/introduction-to-string)
    * [Immutable String - Problems & Solutions](https://leetcode.realtemirov.uz/array-and-string/introduction-to-string/immutable-string-problems-and-solutions)
    * [Add binary](https://leetcode.realtemirov.uz/array-and-string/introduction-to-string/add-binary)
    * [Implement strStr()](https://leetcode.realtemirov.uz/array-and-string/introduction-to-string/implement-strstr)
    * [Longest Common Prefix](https://leetcode.realtemirov.uz/array-and-string/introduction-to-string/longest-common-prefix)
  * [Two-Pointer Technique](https://leetcode.realtemirov.uz/array-and-string/two-pointer-technique)
    * [Two-pointer Technique - Scenario I](https://leetcode.realtemirov.uz/array-and-string/two-pointer-technique/two-pointer-technique-scenario-i)
    * [Reverse String](https://leetcode.realtemirov.uz/array-and-string/two-pointer-technique/reverse-string)
    * [Array Partition I](https://leetcode.realtemirov.uz/array-and-string/two-pointer-technique/array-partition-i)
    * [Two Sum II - Input array is sorted](https://leetcode.realtemirov.uz/array-and-string/two-pointer-technique/two-sum-ii-input-array-is-sorted)
    * [Two-pointer Technique - Scenario II](https://leetcode.realtemirov.uz/array-and-string/two-pointer-technique/two-pointer-technique-scenario-ii)
    * [Remove Element](https://leetcode.realtemirov.uz/array-and-string/two-pointer-technique/remove-element)
    * [Max Consecutive Ones](https://leetcode.realtemirov.uz/array-and-string/two-pointer-technique/max-consecutive-ones)
    * [Minimum Size Subarray Sum](https://leetcode.realtemirov.uz/array-and-string/two-pointer-technique/minimum-size-subarray-sum)
  * [Conclusion](https://leetcode.realtemirov.uz/array-and-string/conclusion)
    * [Array-related Techniques](https://leetcode.realtemirov.uz/array-and-string/conclusion/array-related-techniques)
    * [Rotate Array](https://leetcode.realtemirov.uz/array-and-string/conclusion/rotate-array)
    * [Pascal's Triangle II](https://leetcode.realtemirov.uz/array-and-string/conclusion/pascals-triangle-ii)
    * [Reverse Words in a String](https://leetcode.realtemirov.uz/array-and-string/conclusion/reverse-words-in-a-string)
    * [Reverse Words in a String III](https://leetcode.realtemirov.uz/array-and-string/conclusion/reverse-words-in-a-string-iii)
    * [Remove Duplicates from Sorted Array](https://leetcode.realtemirov.uz/array-and-string/conclusion/remove-duplicates-from-sorted-array)
    * [Move Zeroes](https://leetcode.realtemirov.uz/array-and-string/conclusion/move-zeroes)
* [Linked List](https://leetcode.realtemirov.uz/linked-list)
  * [Singly Linked List](https://leetcode.realtemirov.uz/linked-list/singly-linked-list)
    * [Introduction - Singly Linked List](https://leetcode.realtemirov.uz/linked-list/singly-linked-list/introduction-singly-linked-list)
    * [Add Operation - Singly Linked List](https://leetcode.realtemirov.uz/linked-list/singly-linked-list/add-operation-singly-linked-list)
    * [Delete Operation - Singly Linked List](https://leetcode.realtemirov.uz/linked-list/singly-linked-list/delete-operation-singly-linked-list)
    * [Design Linked List](https://leetcode.realtemirov.uz/linked-list/singly-linked-list/design-linked-list)
  * [Two Pointer Technique](https://leetcode.realtemirov.uz/linked-list/two-pointer-technique)
    * [Two-Pointer in Linked List](https://leetcode.realtemirov.uz/linked-list/two-pointer-technique/two-pointer-in-linked-list)
    * [Linked List Cycle](https://leetcode.realtemirov.uz/linked-list/two-pointer-technique/linked-list-cycle)
    * [Linked List Cycle II](https://leetcode.realtemirov.uz/linked-list/two-pointer-technique/linked-list-cycle-ii)
    * [Intersection of Two Linked Lists](https://leetcode.realtemirov.uz/linked-list/two-pointer-technique/intersection-of-two-linked-lists)
    * [Remove Nth Node From End of List](https://leetcode.realtemirov.uz/linked-list/two-pointer-technique/remove-nth-node-from-end-of-list)
    * [Summary - Two-Pointer in Linked List](https://leetcode.realtemirov.uz/linked-list/two-pointer-technique/summary-two-pointer-in-linked-list)
* [Problems](https://leetcode.realtemirov.uz/problems)


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://leetcode.realtemirov.uz/readme.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.