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: String-question / Level: Beginner






Most Visited

 Implement a function to find the k most frequent words in a string. Write a function to count the number of distinct palindromic subsequences in a string. Implement a function to count the number of substrings where each character occurs at least twice. Write a function to find the smallest number of adjacent swaps to make two strings anagrams of each other. Implement a function to find the longest palindrome that can be made from a string by swapping at most two characters. Implement a function to determine the lexicographical rank of a string among its permutations. Implement a function to check if two strings are one edit distance apart. Implement a function to determine if a string is a valid IP address. Write a function to find the longest substring that can be rearranged into a palindrome by deleting exactly one character. Write a function to check if two strings can be made identical by reversing any two non-overlapping substrings. Write a function to check if one string is a rotation of another string. Write a function to remove all adjacent pairs of duplicate characters from a string until no such pairs exist. Write a function to check if a string can be segmented into words from a dictionary. Write a function to check if two strings can be made identical by swapping any two characters. Write a function to find the smallest number of operations to transform a string into a valid anagram of another string using only cyclic shifts.