All Topics

 C Language C++ Language Greedy Algorithm Hashing Java Language Linked List Python Queue Stack String Sorting Searching Recursion Backtracking Dynamic Programming Graph Theory Bit Manipulation Mathematics Sliding Window Technique Divide And Conquer Matrix Manipulation Two Pointers Binary Tree

Topic: Two-pointers-question / Level: Advanced






Most Visited

 Implement a function to find the longest valid parentheses substring using the two-pointer technique. Given a list of integers, find two numbers such that they add up to a specific target. Implement a function to find the longest common substring. Given two strings, check if they can be made equal by rearranging characters. Calculate the longest substring of a string that contains no more than two vowels. Given an array, determine if it can be partitioned into two subsets with equal sum. Given two arrays, find the intersection of both. Implement a function to check if two strings can be made identical by rearranging. Find the minimum number of operations to convert one string into another. Given two strings, check if they are anagrams of each other ignoring whitespace. Check if a binary tree is a valid BST using the two-pointer technique. Implement a function to find the longest valid parentheses substring using a stack and two pointers. Remove duplicates from a sorted array and return the new length. Given a string, find all unique permutations of the characters. Calculate the minimum number of deletions needed to make two strings anagrams.