String | Palindrome

Recent articles on String !

  1. C Program to Check if a Given String is Palindrome
  2. Check if a given string is a rotation of a palindrome
  3. C++ Program to print all palindromes in a given range
  4. Check if characters of a given string can be rearranged to form a palindrome
  5. Dynamic Programming | Set 28 (Minimum insertions to form a palindrome)
  6. Longest Palindromic Substring | Set 2
  7. Find all palindromic sub-strings of a given string
  8. Online algorithm for checking palindrome in a stream
  9. Given a string, print all possible palindromic partitions
  10. Print all palindromic partitions of a string
  11. Dynamic Programming | Set 17 (Palindrome Partitioning)
  12. Count All Palindromic Subsequence in a given String
  13. Minimum characters to be added at front to make string palindrome
  14. Palindrome Substring Queries
  15. Suffix Tree Application 6 – Longest Palindromic Substring
  16. Palindrome pair in an array of words (or strings)
  17. Make largest palindrome by changing at most K-digits
  18. Lexicographically first palindromic string
  19. Recursive function to check if a string is palindrome
  20. Minimum number of Appends needed to make a string palindrome
  21. Longest Non-palindromic substring
  22. Minimum number of deletions to make a string palindrome
  23. Minimum steps to delete a string after repeated deletion of palindrome substrings
  24. Count of Palindromic substrings in an Index range
  25. Minimum insertions to form a palindrome with permutations allowed
  26. Nth Even length Palindrome
  27. Given a number, find the next smallest palindrome
  28. Smallest Palindrome after replacement
  29. Minimum insertions to form shortest palindrome
  30. Find longest palindrome formed by removing or shuffling chars from string
  31. Print all palindrome permutations of a string
  32. Palindrome Substring Queries
  33. Remove a character from a string to make it a palindrome
  34. Print all palindromic partitions of a string
  35. Check for Palindrome after every character replacement Query
  36. Queries on substring palindrome formation
  37. Palindrome pair in an array of words (or strings)
  38. Minimum number of Appends needed to make a string palindrome
  39. Minimum steps to delete a string after repeated deletion of palindrome substrings
  40. Longest Possible Chunked Palindrome
  41. Sentence Palindrome (Palindrome after removing spaces, dots, .. etc)
  42. Count All Palindrome Sub-Strings in a String
  43. Count palindromic characteristics of a String
  44. Print longest palindrome word in a sentence
  45. Lexicographically next greater string using same character set
  46. Largest palindromic number by permuting digits
  47. Count palindrome words in a sentence
  48. Count special palindromes in a String
  49. Remove all the palindromic words from the given sentence
  50. Rearrange characters to form palindrome if possible
  51. Print the arranged positions of characters to make palindrome
  52. Number of palindromic permutations
  53. Minimum removal to make palindrome permutation
  54. Closest Palindrome Number (absolute difference Is min)
  55. Convert the string into palindrome string by changing only one character.
  56. Check if actual binary representation of a number is palindrome
  57. Count maximum-length palindromes in a String
  58. Make a lexicographically smallest palindrome with minimal changes
  59. Next word that does not contain a palindrome and has characters from first k
  60. Number of strings of length N with no palindromic sub string
  61. Print Longest Palindromic Subsequence
  62. Minimum cost to convert string into palindrome
  63. Binary String of given length that without a palindrome of size 3
  64. Count All Palindrome Sub-Strings in a String
  65. Check if any anagram of a string is palindrome or not
  66. Minimum reduce operations to covert a given string into a palindrome
  67. Next higher palindromic number using the same set of digitsNext higher palindromic number using the same set of digits
  68. Number of positions where a letter can be inserted such that a string becomes palindrome
  69. Print all the palindromic permutations of given string in alphabetic order
  70. Minimum equal palindromic cuts with rearrangements allowed
  71. Sum of first K even-length Palindrome numbers
  72. Form the largest palindromic number using atmost two swaps
  73. Palindrome by swapping only one character

Quick Links :

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above



My Personal Notes arrow_drop_up


Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.