Main Navigation Code Engineering Management UX

Appearance

Sidebar Navigation

Algorithms

Search

Beam search

Binary-search

Binary search

Breadth-first-search

Breadth-first search

Depth-first-search

Depth-first search

Tabu search

Two-pointers

Sort

Counting sort

Heapsort

Quicksort

Sorting

Algorithms

Complexity

Time complexity

Genetic

Genetic algorithms

Simulated annealing

Graph

A*

Bellman-Ford algorithm

Dijkstra

Dijkstra's algorithm

Floyd-Warshall algorithm

Ford-Fulkerson algorithm

Graph algorithms

Hungarian algorithm

Kruskal

Kruskal's algorithm

Nearest neighbour

Prim

Prim's algorithm

Linear-programming

Newton-method

Newton's method

Simplex

Problems

Boolean Satisfiability Problem

Constraint Satisfaction Problem

Flow cost problem

Graph-coloring

Graph coloring problem

Halting problem

Knapsack problem

P vs. NP problem

Problems

Quadratic Assignment Problem

Scheduling problems

Shortest path problem

Steiner tree problem

Traveling Salesman Problen

Architecture

Models

Representation model

Other

4+1

C4

DFD

Sysml

Requirement diagram

Uml

Behaviour-diagrams

Activity diagram

Communication diagram

Interaction overview diagram

Sequence diagram

State machine diagram

Timing diagram

Use Case diagram

Structural-diagrams

Class diagram

Component diagram

Composite structure diagram

Deployment diagram

Object diagram

Package diagram

UML

Paradigms

Declarative Imperative

Design by contract

Object-oriented

Paradigms

Patterns

Blackboard

Microservices

MVC

Observer

Pipe and filter

Principles

ACID

Conway's law

DRY

Gall's law

KISS

Lehman's laws

Separation of concerns

Solid

SOLID

Twelve-Factor App

Quality-attributes

Availability

Interoperability

Maintainability

Performance

Quality Attributes

Scalability

Security

Testability

Styles

Client-server

Component-based

Finite-state machine

Layered

Publish-subscribe

Service-oriented

Creative-coding

Creative coding

Music processing

Cyber-security

Attacks

Denial-of-Service attack

Fault injection

Cyber security

Defenses

Security through obscurity

Steganography

Principles

CIA

CWE

IAM

NIST

OWASP

STRIDE

Data

Binary

Gray code

Hamming distance

Data-structure

Data structure

Graph

Heap

Fibonacci Heap

Heap

Tree

Data

Database

Nosql

Column

Document

Graph

Key-Value

NoSQL

RDBMS

Sharding

Glossary

FAIR

Garbage In, Garbage Out

Race condition

Types

Date types

Numeric types

Data types

Devops

CI/CD

DevOps

Glossary

Pet vs. Cattle

Monorepo

Unit testing

Versioning

Virtualization

Infrastructure

Cloud

As a Service

Cloud

Edge Computing

Glossary

Pets vs Cattle

Serverless

Infrastructure as Code

IoT

Load balancing

Virtualization

Hardware

GPU

Screen

Infrastructure

Network

Glossary

Broad Network Access

Readme

Protocols

Os

Clock

Kernel

Operating System

Telecommunication

Turing machine

Machine-learning

Applications

Computer Vision

Generative AI

Natural Language Processing

Robotic Process Automation

Concepts

Dimensions

Feature

Metrics

Learning-paradigms

Learning paradigms

Reinforcement Learning

Self-supervised Learning

Supervised Learning

Unsupervised Learning

Machine Learning

Metrics

Fréchet Inception Distance

Inception Score

Neural-network

CLIP

Autoencoder

Cnn

Convolutional Neural Network

Diffusion

Diffusion model

Gan

Generative Adversarial Network

Large-Language Models

Neural Network

Recurrent Neural Network

Transformer

Vision Transformer

Tasks

Classification

Regression

Maths

Algebra

Linear algebra

Derivative

Function

Integral

Sets

Tensor

Matrix

Scalar

Tensor

Vector

Glossary

Stochastic

Mathematics

Physics

Energy

Motion

Physics

Statistics

Law-of-large-numbers

Law of large numbers

Markov-chain

Markov chain

Web

API

Glossary

Flash of unstyled content

HTTP

Hydration

Web

On this page

Two-pointers

Two-pointers is used to search pairs in an array.

Resources

Two Pointers Technique – GeeksForGeeks

Suggest a change

Last update:

Pager

Previous pageTabu search

Next pageCounting sort

Released under the MIT License.

Binary-search

Breadth-first-search

Depth-first-search

Heapsort

Quicksort

Dijkstra

Kruskal

Prim

Newton-method

Graph-coloring

Other

Sysml

Uml

Behaviour-diagrams

Structural-diagrams

Solid

Graph

Heap

Tree

Nosql

Glossary

Glossary

Kernel

Autoencoder

Cnn

Diffusion

Gan

Transformer

Function

Integral

Tensor

Law-of-large-numbers

Markov-chain

Two-pointers ​

Resources ​

Two-pointers

Resources