AniketTheProgrammer
Home
(current)
Courses
Projects
YT Projects
Coding Questions
Notification
Contact Us
Log In
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: Advanced
401. Implement a function to find the lexicographically smallest string that can be formed by removing any number of characters.
402. Write a function to find the minimal number of operations to convert one string to another using only insertions, deletions, and cyclic shifts.
403. Implement a function to find the longest palindrome subsequence that can be constructed from two given strings.
404. Write a function to check if a string is a valid transformation of another string by reversing all vowels in a cyclic manner.
405. Implement a function to find the minimal number of operations to convert a string into a palindrome, allowing both insertions and deletions.
406. Write a function to check if a string can be partitioned into k palindromic substrings.
407. Implement a function to find the minimal number of swaps to make a string into an anagram of another string.
408. Write a function to find the lexicographically smallest cyclic rotation of a string using a suffix array.
409. Implement a function to find the longest subsequence common to both a string and its reverse.
410. Write a function to check if a string can be segmented into words using a given dictionary, where words can overlap.
411. Implement a function to find the minimal number of operations to transform one string into another, allowing both substring reversals and replacements.
412. Write a function to find the smallest set of characters that need to be removed from a string to make it a palindrome.
413. Implement a function to find all possible minimal length palindromes that can be formed by rearranging a string.
414. Write a function to find the longest substring that can be made a palindrome by rearranging its characters.
415. Implement a function to find the minimal number of adjacent swaps to arrange the characters of a string in lexicographical order.
416. Write a function to find the lexicographically largest palindrome that can be formed from two strings by alternating their characters.
417. Implement a function to check if a string is a valid subsequence of another string when rotated.
418. Write a function to find the lexicographically largest subsequence of a string that contains all vowels in order.
419. Implement a function to find the minimal number of operations to transform one string into another, allowing only substring deletions.
420. Write a function to find the longest palindromic substring where the characters are in increasing order.
421. Implement a function to find the smallest subsequence of a string that contains all the distinct characters of another string.
422. Write a function to find the lexicographically smallest substring of a string that can be rearranged into a palindrome.
423. Implement a function to find the minimal number of operations to convert one string into another by only reversing substrings.
424. Write a function to find the longest common substring between two strings using dynamic programming and bitwise operations.
425. Implement a function to find the smallest number of operations to split a string into substrings where each substring is a palindrome.
426. Write a function to find the lexicographically smallest string that can be formed by deleting at most k characters.
427. Implement a function to check if two strings can be made identical by rotating their substrings.
428. Write a function to find the smallest palindrome that can be formed by inserting at most one character into a string.
429. Implement a function to find the longest substring of a string that is an anagram of another given string.
430. Write a function to find the lexicographically smallest sequence of swaps needed to transform one string into another.
Previous
1
2
3
4
5
6
7
Next
More Levels
Beginner
Intermediate
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.