rohith-bare-on - COMPLETED

December-01/cpp_rohithmsr_sherlocksquest.cpp

@@ -0,0 +1,51 @@
+#include <iostream>
+#include <string>
+#include <cmath>
+
+using namespace std;
+
+int statusCheck(int room_no)
+{
+    int sqr, len, k, ans, first_part, second_part;
+
+    if (room_no % 3 == 0)
+    {
+        sqr = room_no * room_no;
+        k = (int)(to_string(room_no).size()); // no of digits of room_no
+        len = (int)(to_string(sqr).size());   // no of digits of (room_no)^2
+
+        //before converting to int, add 0.5 for precision
+        //since it stores pow(5,2) as 24.99999,
+        //so add 0.5 and convert to int to get 25
+        second_part = (sqr % (int)(pow(10, k) + 0.5));
+        first_part = (sqr - second_part) / (int)(pow(10, k) + 0.5);
+
+        ans = first_part + second_part;
+
+        if (ans == room_no)
+        {
+            return 1;
+        }
+    }
+    return 0;
+}
+
+int main()
+{
+    int room_no;
+
+    cout << "Room: ";
+    cin >> room_no;
+    cout << "Status: ";
+
+    if (statusCheck(room_no))
+    {
+        cout << "Safe" << endl;
+    }
+    else
+    {
+        cout << "Not Safe" << endl;
+    }
+
+    return 0;
+}

December-02/cpp_rohithmsr_convo.cpp

@@ -0,0 +1,60 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <cmath>
+
+using namespace std;
+
+void getCombo(string str, int number, vector<string> *ans, vector<string> *dial)
+{
+    int size = to_string(number).size();
+
+    if (number == 0) // this condition is achieved when size of the one of the element is equal to number of digits of number given as input by the user
+    {
+        ans->push_back(str);
+    }
+    else
+    {
+        int first_digit = (int)(number / ((int)(pow(10, size - 1) + 0.5)));
+        //find the first digit of the number
+
+        for (int i = 0; i < dial->at(first_digit).size(); i++)
+        {
+            int no = (int)(number % ((int)(pow(10, size - 1) + 0.5)));
+            //finds the remaining digits
+
+            string strr = str + dial->at(first_digit).substr(i, 1);
+            getCombo(strr, no, ans, dial);
+        }
+    }
+}
+
+// Returns the combinations using getCombo function
+vector<string> getList(int digits)
+{
+
+    vector<string> dial{"_", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
+    vector<string> ans; // contains the combinations
+
+    getCombo("", digits, &ans, &dial); // empty string should be given as the first argument
+
+    return ans;
+}
+
+void print(vector<string> v)
+{
+    cout << '[';
+    for (int i = 0; i < v.size(); i++)
+    {
+        cout << '"' << v.at(i) << '"' << ",";
+    }
+    cout << '\b' << ']';
+}
+
+// Driver Code
+int main()
+{
+    int digits;
+    cin >> digits;
+    print(getList(digits));
+}

December-03/cpp_rohithmsr_meetandgreet.cpp

@@ -0,0 +1,87 @@
+#include <iostream>
+#include <string>
+#include <vector>
+
+using namespace std;
+
+// Convert Input string to Vector
+vector<string> createList(string str)
+{
+    int quote = 0;
+    string timestr = "";
+    // add start time to vector
+    vector<string> v = {"0900"};
+
+    for (int i = 0; i < str.size(); i++)
+    {
+        if (str.at(i) == '\"')
+        {
+            if (quote % 2 == 1)
+            {
+                v.push_back(timestr);
+                timestr = "";
+            }
+            quote++;
+        }
+        else if (quote % 2 == 1)
+        {
+            timestr = timestr + str.at(i);
+        }
+        else
+        {
+            continue;
+        }
+    }
+    // add ending time to vector
+    v.push_back("1700");
+
+    // for (auto i = v.begin(); i != v.end(); ++i)
+    //     cout << '|' << *i << '|' << " ";
+    //fr debugging..lol
+
+    return v;
+}
+
+void getIntervals(string str)
+{
+    int start, end, flag = 0;
+
+    // ["0930","1100"],["1200","1330"],["1530","1630"]
+    vector<string> v = createList(str);
+
+    for (int i = 0; i < v.size(); i = i + 2)
+    {
+        start = stoi(v.at(i));
+        end = stoi(v.at(i + 1));
+
+        if (end - start >= 100)
+        {
+            if (flag == 1)
+            {
+                cout << ',';
+            }
+            cout << "[\"" << v[i] << "\",\"" << v[i + 1] << "\"]";
+            flag = 1;
+        }
+    }
+    if (flag == 0)
+    {
+        cout << "Can't have meeting today" << endl;
+    }
+    else
+    {
+        printf("\n");
+    }
+    return;
+}
+
+// Driver Code
+int main()
+{
+    string str; // ["0930", "1100"],["1200","1330"],["1530","1630"]
+    cin >> str;
+
+    getIntervals(str);
+
+    return 0;
+}

December-04/cpp_rohithmsr_spoiledornot.cpp

@@ -0,0 +1,47 @@
+#include <iostream>
+#include <string>
+#include <vector>
+
+using namespace std;
+
+void spoiled(vector<long long> &dates, long long today)
+{
+    int count = 0;
+    for (int i = 0; i < dates.size(); i++)
+    {
+        if (dates[i] < today)
+        {
+            count++;
+        }
+    }
+    printf("\n%d\n", count);
+}
+
+int main()
+{
+    int n;
+    cin >> n;
+
+    long long a, b, c, d;
+
+    vector<long long> dates;
+    for (int i = 0; i < n; i++)
+    {
+        cin >> a >> b >> c >> d;
+        a = a + (b * 30) + (c * 12 * 30) + d;
+        dates.push_back(a);
+    }
+
+    cin >> a >> b >> c;
+    long long today = a + (b * 12) + (c * 12 * 30);
+    spoiled(dates, today);
+    return 0;
+}
+
+/*
+3
+10 1 2020 20
+13 1 2020 13
+20 12 2019 20
+28 1 2020
+*/

December-05/cpp_rohithmsr_grandmaster.cpp

@@ -0,0 +1,118 @@
+#include <iostream>
+#include <list>
+
+using namespace std;
+
+// checks if the point is inside the borad
+bool isInside(int c, int d, int a, int b)
+{
+    if (c >= 1 & c <= a & d >= 1 & d <= b)
+    {
+        return true;
+    }
+    return false;
+}
+
+//calculates the minimum steps
+int minsteps(int c, int d, int e, int f, int a, int b)
+{
+    // next steps moved by knight
+    int steps_x[8] = {1, 1, 2, 2, -1, -1, -2, -2};
+    int steps_y[8] = {2, -2, 1, -1, 2, -2, 1, -1};
+
+    //respective grid number(each grid starts with 1 till a*b)
+    // grid number of (1,1) is 1,(1,2) is 2 for a = 1 and b = 2
+    int grid_number = (d - 1) * b + c;
+    int target = (f - 1) * b + e;
+
+    if (!isInside(c, d, a, b) | !isInside(e, f, a, b))
+    {
+        return -1;
+    }
+
+    int grid_c, grid_d, layer = 0, aa, bb, cc;
+
+    list<int> queue;
+
+    //boolean array storing whether the point has been visited or not
+    bool *visited;
+    visited = (bool *)malloc(((a * b) + 1) * sizeof(int));
+    for (int i = 0; i <= a * b; i++)
+    {
+        visited[i] = false;
+    }
+
+    //set visit of first position as true and add to the queue
+    visited[grid_number] = true;
+    queue.push_back(c);
+    queue.push_back(d);
+    queue.push_back(layer); // layer of the bfs
+
+    while (!queue.empty())
+    {
+        aa = queue.front();
+        queue.pop_front();
+        bb = queue.front();
+        queue.pop_front();
+        cc = queue.front();
+        queue.pop_front();
+
+        if (visited[target] == true)
+        {
+            return layer;
+        }
+        for (int i = 0; i < 8; i++)
+        {
+            grid_c = aa + steps_x[i];
+            grid_d = bb + steps_y[i];
+            layer = cc + 1;
+
+            if (visited[target] == true)
+            {
+                return layer;
+            }
+
+            if (isInside(grid_c, grid_d, a, b))
+            {
+                grid_number = (grid_d - 1) * b + grid_c;
+
+                if (!visited[grid_number])
+                {
+                    visited[grid_number] = true;
+                    queue.push_back(grid_c);
+                    queue.push_back(grid_d);
+                    queue.push_back(layer);
+                }
+            }
+        }
+    }
+    return -2;
+}
+
+// Driver Code
+int main()
+{
+    int a, b, c, d, e, f, steps;
+    cout << "Dimension of Board : ";
+    cin >> a >> b;
+    cout << "Position of Knight : ";
+    cin >> c >> d;
+    cout << "Target Position :  ";
+    cin >> e >> f;
+
+    steps = minsteps(c, d, e, f, a, b);
+
+    if (steps == -1)
+    {
+        cout << "Minimum Steps : Target or Position Out of the bounds" << endl;
+    }
+    else if (steps == -2)
+    {
+        cout << "Minimum Steps : Impossible" << endl;
+    }
+    else
+    {
+        cout << "Minimum Steps : " << steps << endl;
+    }
+    return 0;
+}