Question

Amazon WoW | OA | SDE1 | Coding Questions and Solutions | 2022 | Set-39

Answer 1

// The Difference

#include <bits/stdc++.h>

using namespace std;

int LPS(string str, int n)

{

    int longest_p = 1;

    vector<vector<int>> dp(n, vector<int>(n, 0));

    for (int g = 0; g < n; g++)

    {

        for (int i = 0, j = g; j < n; i++, j++)

        {

            if (g == 0)

                dp[i][j] = 1;

            else if (g == 1)

            {

                if (str[i] == str[j])

                {

                    dp[i][j] = 1;

                    longest_p = max(longest_p, j - i + 1);

                }

            }

            else

            {

                if (str[i] == str[j] && dp[i + 1][j - 1])

                {

                    dp[i][j] = 1;

                    longest_p = max(longest_p, j - i + 1);

                }

            }

        }

    }

    return longest_p;

}

int main()

{

    string str;

    cin >> str;

    int n = str.size();

    if (n == 0 || n == 1)

        cout << 0 << endl;

    else

        cout << LPS(str, n) - 1 << endl;

    return 0;

}

Answer 2

// Passwords Problem

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int n;

    cin >> n;

    vector<string> passwords(n, "");

    unordered_map<string, int> pw_check;

 

    for (int i = 0; i < n; i++)

    {

        cin >> passwords[i];

    }

    for (int i = 0; i < n; i++)

    {

        string even_char = "", odd_char = "";

        for (int j = 0; j < passwords[i].size(); j++)

        {

            if (j % 2 == 0)

                even_char += passwords[i][j];

            else

                odd_char += passwords[i][j];

        }

        sort(even_char.begin(), even_char.end());

        sort(odd_char.begin(), odd_char.end());

        string hash_string = even_char + '#' + odd_char;

        pw_check[hash_string]++;

    }

    cout << pw_check.size() << endl;

    return 0;

}

Answer 3

Question asked : 

Answer 4

Question asked :