{"@attributes":{"version":"2.0"},"channel":{"title":"Algorithms on \u00d6zkan Pakdil Software Engineer","link":"https:\/\/ozkanpakdil.github.io\/categories\/algorithms\/","description":"Recent content in Algorithms on \u00d6zkan Pakdil Software Engineer","image":{"title":"\u00d6zkan Pakdil Software Engineer","url":"https:\/\/ozkanpakdil.github.io\/images\/papermod-cover.png","link":"https:\/\/ozkanpakdil.github.io\/images\/papermod-cover.png"},"generator":"Hugo -- 0.148.2","language":"en","copyright":"\u00d6zkan Pakdil","lastBuildDate":"Sat, 07 Oct 2023 00:00:30 +0000","item":[{"title":"Java find how many character repeating in a string","link":"https:\/\/ozkanpakdil.github.io\/posts\/my_collections\/2023\/2023-10-07-find-amount-of-characters\/","pubDate":"Sat, 07 Oct 2023 00:00:30 +0000","guid":"https:\/\/ozkanpakdil.github.io\/posts\/my_collections\/2023\/2023-10-07-find-amount-of-characters\/","description":"

How to find how many characters are repeating in a string.<\/h1>\n
@Test<\/span>\n<\/span><\/span>void<\/span> anotherQ<\/span>() {\n<\/span><\/span>    \/\/ Q1 -- given a String like aaabbbcccaa need to return output like a3b3c3a2.<\/span>\n<\/span><\/span>    String input =<\/span> "aaabbbcccazzdddxx"<\/span>;\n<\/span><\/span>    char<\/span>[]<\/span> arr =<\/span> input.toCharArray<\/span>();\n<\/span><\/span>\n<\/span><\/span>    for<\/span> (int<\/span> i =<\/span> 0; i <<\/span> arr.length<\/span>; i++<\/span>) {\n<\/span><\/span>        char<\/span> c =<\/span> arr[<\/span>i]<\/span>;\n<\/span><\/span>        int<\/span> charCounter =<\/span> 1;\n<\/span><\/span>        System.out<\/span>.print<\/span>(c);\n<\/span><\/span>        while<\/span> (i +<\/span> 1 <<\/span> arr.length<\/span> &&<\/span> c ==<\/span> arr[<\/span>i +<\/span> 1]<\/span>) {\n<\/span><\/span>            charCounter++<\/span>;\n<\/span><\/span>            i++<\/span>;\n<\/span><\/span>        }\n<\/span><\/span>        System.out<\/span>.print<\/span>(charCounter);\n<\/span><\/span>    }\n<\/span><\/span>\n<\/span><\/span>    System.out<\/span>.println<\/span>("\\n"<\/span> +<\/span> transformString(input));\n<\/span><\/span>}\n<\/span><\/span>\n<\/span><\/span>public<\/span> static<\/span> String transformString<\/span>(String input) {\n<\/span><\/span>    if<\/span> (input ==<\/span> null<\/span> ||<\/span> input.isEmpty<\/span>()) {\n<\/span><\/span>        return<\/span> input;\n<\/span><\/span>    }\n<\/span><\/span>\n<\/span><\/span>    StringBuilder result =<\/span> new<\/span> StringBuilder();\n<\/span><\/span>    int<\/span> count =<\/span> 1;\n<\/span><\/span>    char<\/span> currentChar =<\/span> input.charAt<\/span>(0);\n<\/span><\/span>\n<\/span><\/span>    for<\/span> (int<\/span> i =<\/span> 1; i <<\/span> input.length<\/span>(); i++<\/span>) {\n<\/span><\/span>        char<\/span> c =<\/span> input.charAt<\/span>(i);\n<\/span><\/span>        if<\/span> (c ==<\/span> currentChar) {\n<\/span><\/span>            count++<\/span>;\n<\/span><\/span>        } else<\/span> {\n<\/span><\/span>            result.append<\/span>(currentChar).append<\/span>(count);\n<\/span><\/span>            count =<\/span> 1;\n<\/span><\/span>            currentChar =<\/span> c;\n<\/span><\/span>        }\n<\/span><\/span>    }\n<\/span><\/span>\n<\/span><\/span>    result.append<\/span>(currentChar).append<\/span>(count);\n<\/span><\/span>    return<\/span> result.toString<\/span>();\n<\/span><\/span>}\n<\/span><\/span><\/code><\/pre><\/div>
The output is \u201ca3b3c3a1z2d3x2\u201d find the working code here<\/a> for full working example.<\/p>"},{"title":"Turning an array clockwise or counterclockwise","link":"https:\/\/ozkanpakdil.github.io\/posts\/my_collections\/2023\/2023-09-28-turn-array-clockwise-or-reverse-java\/","pubDate":"Thu, 28 Sep 2023 00:00:30 +0000","guid":"https:\/\/ozkanpakdil.github.io\/posts\/my_collections\/2023\/2023-09-28-turn-array-clockwise-or-reverse-java\/","description":"
Turn an array clockwise therefore the last element comes to first and all hops to right.\nAnd counterclockwise meaning last element comes to first and others hops to their left.<\/p>\n
\n<\/span><\/span>import<\/span> java.io.IOException;\n<\/span><\/span>import<\/span> java.util.ArrayList;\n<\/span><\/span>import<\/span> java.util.Arrays;\n<\/span><\/span>import<\/span> java.util.Collections;\n<\/span><\/span>import<\/span> java.util.List;\n<\/span><\/span>\n<\/span><\/span>public<\/span> class<\/span> Solution<\/span> {\n<\/span><\/span>    public<\/span> static<\/span> void<\/span> main<\/span>(String[]<\/span> args) throws<\/span> IOException {\n<\/span><\/span>        int<\/span>[]<\/span> arr =<\/span> new<\/span> int<\/span>[]<\/span>{1, 3, 5, 7, 9};\n<\/span><\/span>        int<\/span> K =<\/span> 3;\n<\/span><\/span>        turnTheArrayToRight(arr, K);\n<\/span><\/span>        System.out<\/span>.println<\/span>("-----------"<\/span>);\n<\/span><\/span>        turnTheArrayToLeft(arr, K);\n<\/span><\/span>\n<\/span><\/span>        System.out<\/span>.println<\/span>("-----------"<\/span>);\n<\/span><\/span>        \/\/ no need to reinvent the wheel.<\/span>\n<\/span><\/span>        List l =<\/span> new<\/span> ArrayList<><\/span>();\n<\/span><\/span>        Arrays.stream<\/span>(arr).forEach<\/span>(i-><\/span>l.add<\/span>(i));\n<\/span><\/span>        Collections.rotate<\/span>(l, K); \/\/ rotate right<\/span>\n<\/span><\/span>        System.out<\/span>.println<\/span>(Arrays.toString<\/span>(l.toArray<\/span>()));\n<\/span><\/span>        Collections.rotate<\/span>(l, -<\/span>1 *<\/span> K); \/\/ rotate left<\/span>\n<\/span><\/span>        System.out<\/span>.println<\/span>(Arrays.toString<\/span>(l.toArray<\/span>()));\n<\/span><\/span>    }\n<\/span><\/span>\n<\/span><\/span>    private<\/span> static<\/span> int<\/span>[]<\/span> turnTheArrayToRight<\/span>(int<\/span>[]<\/span> nums, int<\/span> k) {\n<\/span><\/span>        for<\/span> (int<\/span> j =<\/span> 0; j <<\/span> k; j++<\/span>) {\n<\/span><\/span>            for<\/span> (int<\/span> i =<\/span> nums.length<\/span> -<\/span> 1; 0 <<\/span> i; i--<\/span>) {\n<\/span><\/span>                int<\/span> temp =<\/span> nums[<\/span>i -<\/span> 1]<\/span>;\n<\/span><\/span>                nums[<\/span>i -<\/span> 1]<\/span> =<\/span> nums[<\/span>i]<\/span>;\n<\/span><\/span>                nums[<\/span>i]<\/span> =<\/span> temp;\n<\/span><\/span>            }\n<\/span><\/span>            System.out<\/span>.println<\/span>(Arrays.toString<\/span>(nums));\n<\/span><\/span>        }\n<\/span><\/span>        return<\/span> nums;\n<\/span><\/span>    }\n<\/span><\/span>\n<\/span><\/span>    private<\/span> static<\/span> int<\/span>[]<\/span> turnTheArrayToLeft<\/span>(int<\/span>[]<\/span> nums, int<\/span> k) {\n<\/span><\/span>        for<\/span> (int<\/span> j =<\/span> 0; j <<\/span> k; j++<\/span>) {\n<\/span><\/span>            for<\/span> (int<\/span> i =<\/span> 0; i <<\/span> nums.length<\/span> -<\/span> 1; i++<\/span>) {\n<\/span><\/span>                int<\/span> temp =<\/span> nums[<\/span>i]<\/span>;\n<\/span><\/span>                nums[<\/span>i]<\/span> =<\/span> nums[<\/span>i +<\/span> 1]<\/span>;\n<\/span><\/span>                nums[<\/span>i +<\/span> 1]<\/span> =<\/span> temp;\n<\/span><\/span>            }\n<\/span><\/span>            System.out<\/span>.println<\/span>(Arrays.toString<\/span>(nums));\n<\/span><\/span>        }\n<\/span><\/span>        return<\/span> nums;\n<\/span><\/span>    }\n<\/span><\/span>}\n<\/span><\/span><\/code><\/pre><\/div>
Output<\/p>"},{"title":"Table Rollback Problem","link":"https:\/\/ozkanpakdil.github.io\/posts\/my_collections\/2023\/2023-09-20-table-rollback-problem-with-java\/","pubDate":"Wed, 20 Sep 2023 00:00:30 +0000","guid":"https:\/\/ozkanpakdil.github.io\/posts\/my_collections\/2023\/2023-09-20-table-rollback-problem-with-java\/","description":"
Create a class that populates a table represented in the following way. You can think of this as a nested hash\/map\/dictionary structure.<\/p>\n
{\n<\/span><\/span>"row1"<\/span>: { "col1"<\/span>:"foo"<\/span>, "col2"<\/span>:"bar"<\/span> },\n<\/span><\/span>"row2"<\/span>: { "col1"<\/span>:"baz"<\/span> }\n<\/span><\/span>}\n<\/span><\/span><\/code><\/pre><\/div>
The class should support the following methods:<\/p>\n
    \n
  • createRow(rowName)<\/strong>: Creates a new empty row of the givenname. Do nothing if a row with that name already exists<\/li>\n
  • deleteRow(rowName)<\/strong>: Deletes a row with the given name. Donothing if a row with that name doesn’t exist<\/li>\n
  • updateCell(rowName, columnName, newVal)<\/strong>: Sets the value ofthe cell at the given row\/column coordinate to the new value. If the row doesnot exist, do nothing. These actions are grouped together in transactions. Theactions above can only be performed as part of a transaction.<\/li>\n<\/ul>\n
    The class should also support the following methods:<\/p>"},{"title":"Solving the Remote Keyboard Traversal Problem: Navigating the Grid Efficiently","link":"https:\/\/ozkanpakdil.github.io\/posts\/my_collections\/2023\/2023-09-01-remote-keybpard-traversal-problem\/","pubDate":"Fri, 01 Sep 2023 00:00:30 +0000","guid":"https:\/\/ozkanpakdil.github.io\/posts\/my_collections\/2023\/2023-09-01-remote-keybpard-traversal-problem\/","description":"
    The Problem<\/h1>\n
    \n  Write a program to search a movie title using screen keyboard with minimal traversal\n(e.g. Searching for a title Using ROKU\/Apple TV remote on Netflix).\nInput keyboard can have all the characters in any order.\n\nGiven : Movie title and initial position of remote selection\n\nWe have five buttons in remote: UP, DOWN, LEFT, RIGHT, OK\n\nKeyboard: Input remote could be like this (as it buttons could be in any order)\nA B C D E\nF G H I J\nK L M N O\nP Q R S T\nU V W X Y Z\n\nFor Example:\nInitial position of remote: A\nMovie title: BHE\n\nResult: RIGHT, OK, RIGHT, DOWN, OK, RIGHT, RIGTH, UP, OK (Right answer)\n\nResult: RIGHT, RIGHT, LEFT, OK, RIGHT, DOWN, OK, RIGHT, RIGTH, UP, OK (incorrect, not the shortest one)\n<\/pre>\n
    this problem can be categorized as a grid navigation or grid traversal problem<\/p>"}]}}