Walmart | OA Coding Questions and Solutions | Set - 1| 2022

Question

All past online assesments of Walmart can be found using the tag "walmart_oa" in the search bar.

Here is the link :  https://www.desiqna.in/tag/walmart_oa

Answer 1

#include <bits/stdc++.h>

using namespace std;


bool prime(int n)

{

    int count = 0;

    for (int i = 2; i <= sqrt(n); i++)

    {

        if (n % i == 0)

        {

            return false;

        }

    }

    return true;

}


int main()

{

    int t;

    cin >> t;

    while (t--)

    {

        int x, y;

        cin >> x >> y;

        int ans1, ans2;

        for (int i = x; i >= 2; i--)

        {

            bool check = prime(i);

            if (check)

            {

                ans1 = i;

                break;

            }

        }

        for (int i = y; i >= 2; i--)

        {

            bool check = prime(i);

            if (check)

            {

                ans2 = i;

                break;

            }

        }

        cout << ans1 - ans2;

    }

}

Comments

Good!!!!!!!!!!!!!!!!!!

---

I think this soln will result in TLE

---

it wont return tle .. there is a reason he started iterating from backwards there is a prime at always 100-200 distance from any number .. so just in 200 iterations he will find a prime number .. do some research you will know.....

Answer 2

Walmart OA Coding Questions ...