Leetcode - Tag - Pratyakshahttps://pratyakshajha.me/tags/leetcode/Leetcode - Tag - PratyakshaHugo -- gohugo.ioen-ushello@pratyakshajha.me (Pratyaksha Jha)hello@pratyakshajha.me (Pratyaksha Jha)Sat, 11 Apr 2026 13:09:39 +0530Leetcode Patterns Cheatsheethttps://pratyakshajha.me/leetcode-patterns-cheatsheet/Sat, 11 Apr 2026 13:09:39 +0530hello@pratyakshajha.me (Pratyaksha Jha)https://pratyakshajha.me/leetcode-patterns-cheatsheet/Leetcode Patterns Cheat Sheet Two Pointers Use one pointer at the start and other at the end Keep moving them towards each other until they meet Example: Container With Most Water You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the x-axis form a container, such that the container contains the most water.