{"id":1806,"date":"2016-09-29T05:50:57","date_gmt":"2016-09-29T05:50:57","guid":{"rendered":"http:\/\/codethataint.com\/blog\/?p=1806"},"modified":"2019-05-20T18:40:23","modified_gmt":"2019-05-20T18:40:23","slug":"string-problems","status":"publish","type":"post","link":"https:\/\/codethataint.com\/blog\/string-problems\/","title":{"rendered":"String Programs"},"content":{"rendered":"

String Questions<\/strong><\/p>\n

    \n
  1. How to find the Longest Substring in String<\/li>\n
  2. Swapping Letters in 2 Words<\/li>\n
  3. Print String in Reverse Order<\/li>\n
  4. Print Left Right Angle Triangle<\/li>\n
  5. Inverted Right Triangle<\/li>\n
  6. Print Right Angle Triangle<\/li>\n
  7. Print Pyramid<\/li>\n
  8. Sum of Pairs in Array of Numbers<\/li>\n
  9. Check 2nd List has all elements in 1st List<\/li>\n
  10. How to find String is anagram<\/li>\n
  11. Check Palindrome<\/li>\n
  12. Reverse of String without for loop and array<\/li>\n
  13. Check Palindrome with recursion<\/li>\n<\/ol>\n

    1.How to find the Longest Substring in String<\/strong>
    \nInput<\/strong><\/p>\n

    \r\nString strSample = \"ABCAAABCD\"\r\n<\/pre>\n
    Output<\/strong><\/p>\n
    ABCD\r\n<\/pre>\n
    \r\npublic static void main(String[] args) \r\n{\r\n   String Test = "ABCAAABCD";\r\n   String dummy = ""; \r\n\t\t\r\n   String[] arrTest = Test.split("");\r\n\t\t\r\n   List<String> seenChars = new ArrayList<String>();\r\n   List<String> subStrings = new ArrayList<String>();\r\n\t\t\r\n   int j = 0;\r\n\t\t\r\n   for (int i = 1; i < arrTest.length; i++) \r\n   {\r\n      if(seenChars.contains(arrTest[i]))\r\n      {\r\n\t subStrings.add(dummy);\r\n\t dummy = "";\r\n\t seenChars.clear();\r\n      }\r\n\t\t\t\r\n      seenChars.add(arrTest[i]);\r\n      dummy += arrTest[i];\r\n\t\t\t\r\n       j = i + 1;\r\n\t\t\t\r\n       if(j == arrTest.length)\r\n\t  subStrings.add(dummy);\r\n   }\r\n\t\t\r\n   int highestNo = 0;\r\n   int lastHighest = 0;\r\n   int currHighestNo = 0;\r\n   int highestPOS = 0;\r\n\t\r\n   for(int k = 0; k < subStrings.size() ; k++)\r\n   {\r\n\tcurrHighestNo = subStrings.get(k).length();\r\n\t\t\r\n\tif(currHighestNo  > lastHighest)\r\n\t{\r\n  \t  highestNo = currHighestNo;\r\n\t  highestPOS = k;\r\n\t}\t\t\r\n\t  lastHighest = currHighestNo;\r\n\t}\r\n\t\t\r\n\tSystem.out.println(subStrings.get(highestPOS));\t\t\r\n}\r\n<\/pre>\n
    Method 2<\/strong><\/p>\n
    \r\npublic static void main(String args[]) \r\n{\r\n\tString Test = "ABCDEAAABCDA";\r\n\tString dummy = "";\r\n\r\n\tString[] arrTest = Test.split("");\r\n\tString longestSubString = "";\r\n\r\n\tList<String> seenChars  = new ArrayList<String>();\r\n\tList<String> subStrings = new ArrayList<String>();\r\n\r\n\tfor (String strTest : arrTest) \r\n\t{\r\n\t\tif (seenChars.contains(strTest)) \r\n\t\t{\r\n\t\t\tif (dummy.length() > longestSubString.length())\r\n\t\t\t\tlongestSubString = dummy;\r\n\r\n\t\t\tsubStrings.add(dummy);\r\n\t\t\tdummy = "";\r\n\t\t\tseenChars.clear();\r\n\t\t}\r\n\t\t\r\n\t\tseenChars.add(strTest);\r\n\t\tdummy += strTest;\r\n\t}\r\n\t\r\n\tif (dummy.length() > longestSubString.length())\r\n\t{\r\n\t\tlongestSubString = dummy;\t\t\r\n\t\tsubStrings.add(dummy);\t\r\n\t}\r\n\t \r\n\tSystem.out.println("Longest subString is: " + "'" + longestSubString + "'" + " and length is: "\r\n\t\t\t+ longestSubString.length());\r\n}\r\n<\/pre>\n
    2.Swapping Letters in 2 Words<\/strong>
    \nInput<\/strong><\/p>\n
    MUGIL XXX\r\n<\/pre>\n
    Output<\/strong><\/p>\n
    MXUXGXIL\r\n<\/pre>\n
    \r\npublic class Array1 \r\n{\r\n static List arrNewList1 = new ArrayList();\r\n \r\n public static void main(String[] args) \r\n { \r\n   String text1 = "MUGIL";\r\n   String text2 = "XXX"; \r\n \r\n   String[] arrList1 = text1.split("");\r\n   String[] arrList2 = text2.split("");\r\n \r\n   if(arrList2.length > arrList1.length)\r\n    swapArrays(arrList2, arrList1);\r\n   else \r\n    swapArrays(arrList1, arrList2);\r\n\r\n \r\n \r\n   StringBuilder strBr = new StringBuilder();\r\n \r\n   for (int i = 0; i < arrNewList1.size(); i++) \r\n    strBr.append(arrNewList1.get(i));\r\n \r\n    System.out.println(strBr); \r\n }\r\n \r\n public static void swapArrays(String[] pBigList, String[] pSmallList)\r\n { \r\n   for (int i = 0; i < pBigList.length; i++) \r\n   { \r\n     arrNewList1.add(pBigList[i]);\r\n \r\n     if(i < pSmallList.length)\r\n      arrNewList1.add(pSmallList[i]);\r\n   }\r\n }\r\n}\r\n<\/pre>\n
    Note<\/strong><\/p>\n
    \r\n .\r\n .\r\n String Text1 = "M,U,G,I,L";\r\n String Text2 = "MUGIL";\r\n\t\t\r\n System.out.println(Text1.split(",").length);\r\n System.out.println(Text2.split("").length);\r\n .\r\n .\r\n<\/pre>\n
    Output<\/strong><\/p>\n
    \r\n5\r\n6\r\n<\/pre>\n
    you may be puzzled why first prints 5 and second prints 6.Thats because the empty space between “M<\/strong> is taken as 1 element in Text2<\/strong><\/p>\n
    3.Print String in Reverse Order<\/strong>
    \nInput<\/strong><\/p>\n
    \r\nasanam\r\n<\/pre>\n
    Output<\/strong><\/p>\n
    \r\nasanam\r\n<\/pre>\n
    \r\npackage com.mugil.test;\r\n\r\npublic class ReverseString {\r\n\r\n public static void main(String[] args) {\r\n  String strName = "manasa";\r\n\r\n  \/\/char[] arrNames = strName.toCharArray();\r\n\r\n  String[] arrNames = strName.split("");\r\n\r\n  for (int i = arrNames.length - 1; i >= 0; i--) {\r\n   System.out.print(arrNames[i]);\r\n  }\r\n }\r\n}\r\n<\/pre>\n
    4.Print Left Right Angle Triangle<\/strong>
    \nInput<\/strong><\/p>\n
    \r\nTotal number of Rows - 5\r\n<\/pre>\n
    Output<\/strong><\/p>\n
    \r\n* \r\n** \r\n*** \r\n**** \r\n***** \r\n<\/pre>\n
    \r\npackage com.mugil.test;\r\n\r\npublic class Patterns2 {\r\n public static void main(String[] args) {\r\n  int rows = 5;\r\n\r\n  for (int i = 1; i <= rows; i++) {\r\n   for (int j = 1; j <= i; j++) {\r\n    System.out.print("*");\r\n   }\r\n\r\n   System.out.println(" ");\r\n  }\r\n }\r\n}\r\n<\/pre>\n
    5.Inverted Right Triangle<\/strong>
    \nInput<\/strong><\/p>\n
    \r\nTotal number of Rows - 5\r\n<\/pre>\n
    Output<\/strong><\/p>\n
    \r\n***** \r\n**** \r\n*** \r\n** \r\n*  \r\n<\/pre>\n
    \r\n.\r\nint rows = 5;\r\n\r\nfor (int i = rows; i >= 0; i--) {\r\n for (int j = 1; j <= i; j++)\r\n  System.out.print("*");\r\n\r\n System.out.println(" ");\r\n}\r\n.\r\n<\/pre>\n
    6.Print Right Angle Triangle<\/strong>
    \nInput<\/strong><\/p>\n
    \r\nTotal number of Rows - 5\r\n<\/pre>\n
    Output<\/strong><\/p>\n
    \r\n     * \r\n    ** \r\n   *** \r\n  **** \r\n *****  \r\n<\/pre>\n
    \r\nint n = 5;\r\nint j = 0;\r\nint k = 0;\r\n\r\nfor (int i = 0; i < n; i++) {\r\n for (j = n - i; j > 1; j--)\r\n  System.out.print(" ");\r\n\r\n for (j = 0; j <= i; j++)\r\n  System.out.print("*");\r\n\r\n System.out.println();\r\n\r\n}\r\n<\/pre>\n
    7.Print Pyramid<\/strong>
    \nInput<\/strong><\/p>\n
    \r\nTotal number of Rows - 5\r\n<\/pre>\n
    Output<\/strong><\/p>\n
    \r\n    * \r\n   * * \r\n  * * * \r\n * * * * \r\n* * * * *  \r\n<\/pre>\n
    \r\nint n = 5;\r\nint j = 0;\r\nint k = 0;\r\n\r\nfor (int i = 0; i < n; i++) \r\n{\r\n for (j = n - i; j > 1; j--)\r\n  System.out.print(" ");\r\n\r\n for (j = 0; j <= i; j++)\r\n  System.out.print("* ");\r\n\r\n System.out.println();\r\n\r\n}\r\n<\/pre>\n
    The only Difference between Right Angle Triangle and Pyramid is Space in * <\/em><\/p>\n
    8.Sum of Number Pairs in Array<\/strong>
    \nInput<\/strong><\/p>\n
    \r\nArray of Numbers - {0,1,2,2,3,4}\r\nSum - 4\r\n<\/pre>\n
    Output<\/strong><\/p>\n
    \r\n(0,4)\r\n(1,3)\r\n(2,2)\r\n<\/pre>\n
    .\r\nInteger[] arrNumbers = { 0, 1, 2, 2, 3, 4, 5};\r\nint sum = 4;\r\n\r\nfor (int i = 0; i < arrNumbers.length; i++) {\r\n for (int j = i + 1; j < arrNumbers.length; j++) {\r\n  if (arrNumbers[i] + arrNumbers[j] == sum) {\r\n   System.out.println("(" + arrNumbers[i] + "," + arrNumbers[j] + ")");\r\n  }\r\n }\r\n}\r\n.\r\n<\/pre>\n
    9.Check 2nd List has all elements in 1st List<\/strong>
    \nInput<\/strong><\/p>\n
    \r\n2 List of Elements\r\n{1,2,3,4}{2,3}\r\n{1,2,3,4}{2,5}\r\n{2,3}{2,5,6}  \r\n{2,3}{2,3,9}  \r\n<\/pre>\n
    Output<\/strong><\/p>\n
    \r\n{1,2,3,4}{2,3}  -> true\r\n{1,2,3,4}{2,5}  -> false\r\n{2,3}{2,5,6}    -> false\r\n{2,3}{2,3,9}    -> false\r\n<\/pre>\n
    \r\npublic boolean checkEquals()\r\n{\r\n  Integer orig[] = {1,2,3,4};\r\n  Integer act[] = {2,3};\r\n           \r\n  List origList = new ArrayList(Arrays.asList(orig));\r\n  List actList = Arrays.asList(act);\r\n   \r\n  origList.retainAll(actList);\r\n  System.out.println(origList);\r\n      \r\n  if(actList.size()==origList.size())   \r\n    return true;\r\n  else\r\n    return false; \r\n}\r\n<\/pre>\n
    10.How to find String is anagram?<\/strong>
    \nOutput<\/strong><\/p>\n
    \r\nKeep and Peek are anagrams\r\nsilent and listen are anagrams\r\nMotherInLaw and HitlerWoman are anagrams\r\n<\/pre>\n
    \r\npublic class AnagramString \r\n{\r\n static void isAnagram(String str1, String str2) \r\n {\r\n  String s1 = str1.replaceAll("\\\\s", "");\r\n  String s2 = str2.replaceAll("\\\\s", "");\r\n  boolean status = true;\r\n\r\n  if (s1.length() != s2.length()) \r\n   status = false;\r\n  else \r\n  {\r\n   char[] ArrayS1 = s1.toLowerCase().toCharArray();\r\n   char[] ArrayS2 = s2.toLowerCase().toCharArray();\r\n   Arrays.sort(ArrayS1);\r\n   Arrays.sort(ArrayS2);\r\n   status = Arrays.equals(ArrayS1, ArrayS2);\r\n  }\r\n\r\n  if (status)\r\n   System.out.println(s1 + " and " + s2 + " are anagrams");\r\n  else\r\n   System.out.println(s1 + " and " + s2 + " are not anagrams");  \r\n }\r\n\r\n public static void main(String[] args) \r\n {\r\n  isAnagram("Keep", "Peek");\r\n  isAnagram("silent", "listen");\r\n  isAnagram("Mother In Law", "Hitler Woman");\r\n }\r\n}\r\n<\/pre>\n
    11.Check Palindrome<\/strong>
    \nInput<\/strong><\/p>\n
    \r\nmalayalam\r\n<\/pre>\n
    Output<\/strong><\/p>\n
    \r\nEntered string is a palindrome\r\n<\/pre>\n
    \r\n public static void main(String args[])\r\n {\r\n      String original, reverse = "";\r\n      original = "madam";\r\n \r\n      int length = original.length();\r\n \r\n      for ( int i = length - 1; i >= 0; i-- )\r\n         reverse = reverse + original.charAt(i);\r\n \r\n      if (original.equals(reverse))\r\n         System.out.println("Entered string is a palindrome.");\r\n      else\r\n         System.out.println("Entered string is not a palindrome."); \r\n  }\r\n<\/pre>\n
    12.Reverse of String without for loop and array<\/strong>
    \nInput<\/strong><\/p>\n
    \r\nmugil\r\n<\/pre>\n
    Output<\/strong><\/p>\n
    \r\nligum\r\n<\/pre>\n
    \r\nstatic String reverseMe(String s) \r\n{\r\n   if(s.length() <= 1)\r\n     return s;\r\n\r\n   return s.charAt(s.length() - 1) + reverseMe(s.substring(0,s.length()-1));\r\n }\r\n<\/pre>\n
    13.Check palindrome using recursion<\/strong>
    \nInput<\/strong><\/p>\n
    \r\nmalayalam\r\n<\/pre>\n
    Output<\/strong><\/p>\n
    \r\npalindrome\r\n<\/pre>\n
    Call the above reverse function and check with string equals method<\/strong><\/p>\n
    \r\npublic static boolean isPalindrome(String input) \r\n{\r\n if (input == null)\r\n  return false;\r\n\r\n String reversed = reverse(input);\r\n return input.equals(reversed);\r\n}\r\n\r\npublic static String reverse(String str) \r\n{ \r\n if (str == null) \r\n  return null;\r\n \r\n if (str.length() <= 1) \r\n  return str;\r\n \r\n return reverse(str.substring(1)) + str.charAt(0);\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"
    String Questions How to find the Longest Substring in String Swapping Letters in 2 Words Print String in Reverse Order Print Left Right Angle Triangle Inverted Right Triangle Print Right Angle Triangle Print Pyramid Sum of Pairs in Array of Numbers Check 2nd List has all elements in 1st List How to find String is… Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[278],"tags":[],"class_list":["post-1806","post","type-post","status-publish","format-standard","hentry","category-program-solving"],"_links":{"self":[{"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/posts\/1806","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/comments?post=1806"}],"version-history":[{"count":22,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/posts\/1806\/revisions"}],"predecessor-version":[{"id":3439,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/posts\/1806\/revisions\/3439"}],"wp:attachment":[{"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/media?parent=1806"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/categories?post=1806"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/tags?post=1806"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}