Navigation

  • index
  • next |
  • previous |
  • PyHowTo: 1798 tasks and 2296 solutions »

Table of Contents

Python v3.7 HowTos:

  • ------ Algorithms ------
  • Recursion
  • Backtracking
  • Dynamic Programming
  • Greedy
  • Sort
  • Binary Search
  • Depth First Search [DFS]
  • Breadth First Search [BFS]
  • Binary Search Tree [BST]
  • ------ Structures ------
  • Array
  • String
  • Heap
  • Stack
  • Queue
  • Tree
  • Linked List
  • Hash Table
  • Bit Manipulation
  • Two Pointers
  • Math
  • Decorator
  • -------- Tutors --------
  • Basic
  • Intermediate
  • Advanced
  • Interview
  • ----- Applications -----
  • Spark
  • Tkinter
  • Turtle
  • Games
  • Web
  • -------- About ---------
  • About
  • History

Previous topic

Number of steps to reduce a number to zero

Next topic

Remove N-th node from end of list

Quick search

Two PointersΒΆ

How To: Two Pointers

  • Remove N-th node from end of list
  • Partition list
  • Linked list cycle
  • Linked list cycle II
  • Reorder list
  • Two sum II - input array is sorted
  • 3sum smaller
  • Move zeroes
  • Find the duplicate number [Binary Search, Two Pointers]
  • Reverse string
  • Reverse vowels of a string
  • Intersection of two array [Hash, Binary Search]
  • Intersection of two arrays I [Hash, Binary Search]
  • Sort transformed array
  • Circular array loop
  • Permutation in string
  • Valid triangle number
  • Swap adjacent in LR string
  • Most profit assigning work
  • Unique letter string
  • Backspace string compare
  • Middle of the linked list
  • Fruit into baskets
  • Binary subarrays with sum
  • Squares of a sorted array
  • Max consecutive ones III
  • Moving stones until consecutive
  • Moving stones until consecutive II
  • Intersection of three sorted arrays
  • Two sum BST [Stack]
  • Count number of nice subarray [Subarrays with K Different Integers]
  • All elements in two binary search tree [Stack]

Navigation

  • index
  • next |
  • previous |
  • PyHowTo: 1798 tasks and 2296 solutions »
© Copyright 2020, Sergiy Zaytsev, szaytsev@hotmail.com. Created using Sphinx 2.3.0.