updated on 20 July, 2019

Author: laziestcoder

CoderByte/coderByte1.cpp

@@ -0,0 +1,40 @@
+#include <iostream>
+#include <string>
+using namespace std;
+
+
+#define M 100000000
+bool marked[M];
+void sieve2(int n)
+{
+    for (int i = 2; i < n; i++)
+    {
+        if (marked[i] == false)   // i is a prime
+          {
+            for (int j = i + i; j <= n; j += i)
+            {
+                marked[j] = true;
+            }
+         }
+    }
+}
+
+string PrimeTime(int num) {
+
+    if (marked[num]){
+        return "false";
+    }else{
+    return "true";
+    }
+}
+
+int main() {
+
+  // keep this function call here
+  sieve2(20000000);
+  cout << PrimeTime(gets(stdin));
+  return 0;
+
+}
+
+

CoderByte/coderbyte.cpp

@@ -0,0 +1,65 @@
+#include<bits/stdc++.h>
+#include <iostream>
+#include <string>
+#include <sstream>
+#include <cstdlib>
+using namespace std;
+
+string nTs(int i){
+    string s="";
+    char c,p;
+    int m;
+    p = 0;
+    //cout<<"i "<<i<<endl;
+    while(i !=0 ){
+        m = i%10;
+        c = m-p+'0';
+        //cout<<"what "<<c<<endl;
+        s += c;
+        //cout<<s<<endl;
+        i/=10;
+    }
+    //cout<<s<<endl;
+    string j ="";
+    int k;
+    k=s.size()-1;
+   // cout<<"k "<<k<<endl;
+    for(i=0;i<s.size();i++){
+        j += s[k];
+        k--;
+    }
+   // cout<<j<<endl;
+    return j;
+
+}
+
+string FizzBuzz(int num) {
+
+  // code goes here
+     string s="";
+  for(int i=1; i<=num; i++){
+
+    if(i%5==0 && i%3==0){
+        s+= "FizzBuzz";
+    }else if(i%3==0){
+        s+= "Fizz";
+    }else if(i%5== 0){
+        s+= "Buzz";
+    }else{
+
+        s+= nTs(i);
+       //cout<<"what"<<nTs(i);
+    }
+    s+= " ";
+  }
+  return s;
+
+}
+
+int main() {
+
+  // keep this function call here
+  cout << FizzBuzz(gets(stdin));
+  return 0;
+
+}

CoderByte/coderbyte3.cpp

@@ -0,0 +1,118 @@
+#include<bits/stdc++.h>
+#include <iostream>
+#include <string>
+#include <vector>
+#include <cstdio>
+#include <cstdlib>
+using namespace std;
+
+
+static int foo(const std::string *array)
+{
+    size_t i = 0;
+    while (!array[i].empty())
+        ++i;
+    return i;
+}
+
+
+vector<string> v;
+
+
+string LRUCache(string strArr[])
+{
+    //cout<<strArr[1][0];
+    int j=0,i=0,p=0;
+    int is = 9;
+    is = foo(strArr);
+
+    //cout<<is<<endl;
+    for(j=0; j<is; j++)
+    {
+        string s="";
+        s += strArr[j][0];
+        //cout<<s;
+        if(v.size() != 0){
+            bool flag = false;
+            for(i=0; i<v.size(); i++)
+            {
+                if(s == v.at(i))
+                {
+                   flag = true;
+                   break;
+                }
+
+            }
+            if(flag){
+                // cout<<v.at(i);
+                    v.erase(v.begin()+i);
+                    v.push_back(s);
+                    //cout<<"worked " <<s<<endl;
+                    /** for(p=0;p<v.size();p++){
+                         cout<<v.at(p)<<" ";
+                    }
+                    cout<<endl;
+                    ***/
+            }
+             else
+                {
+                    if(v.size()>=5)
+                    {
+                        v.erase(v.begin());
+                    }
+                    v.push_back(s);
+                    //cout<<"worked " <<s<<endl;
+                    /***
+                     for(p=0;p<v.size();p++){
+                         cout<<v.at(p)<<" ";
+                    }
+                    cout<<endl;
+                    ***/
+
+                }
+        }
+        else{
+            v.push_back(s);
+            //cout<<"worked " <<s<<endl;
+            /***
+             for(p=0;p<v.size();p++){
+                         cout<<v.at(p)<<" ";
+                    }
+                    cout<<endl;
+                    ***/
+        }
+    }
+
+   /** for(i=0;i<v.size();i++){
+       // cout<<v.at(i)<<" ";
+    }**/
+
+    string ans;
+    ans = "";
+    int l = v.size();
+    for(i=0;i<l;i++){
+        ans += v.at(i);
+        //v.erase(v.begin()+i);
+        if(i+1!=l)
+        ans += '-';
+    }
+
+        return ans;
+
+}
+
+
+int main()
+{
+
+    // keep this function call here
+    /* Note: In C++ you first have to initialize an array and set
+       it equal to the stdin to test your code with arrays. */
+    v.clear();
+    string A[] = gets(stdin);
+    cout << LRUCache(A);
+    return 0;
+
+}
+
+

CoderByte/coderbyte4.cpp

@@ -0,0 +1,73 @@
+#include <iostream>
+#include <string>
+using namespace std;
+const int noOfChar = 256;
+string mySubStr(string str, string pat)
+{
+    int len1 = str.length();
+    int len2 = pat.length();
+
+    int my_hash[noOfChar] = {0};
+    int my_str[noOfChar] = {0};
+
+    for (int i = 0; i < len2; i++)
+        my_hash[pat[i]]++;
+
+    int start = 0, start_index = -1, min_len = INT_MAX;
+
+
+    int cnt = 0;
+    for (int j = 0; j < len1 ; j++)
+    {
+        my_str[str[j]]++;
+
+        if (my_hash[str[j]] != 0 &&
+            my_str[str[j]] <= my_hash[str[j]] )
+            cnt++;
+
+
+        if (cnt == len2)
+        {
+            while ( my_str[str[start]] > my_hash[str[start]]
+                || my_hash[str[start]] == 0)
+            {
+
+                if (my_str[str[start]] > my_hash[str[start]])
+                    my_str[str[start]]--;
+                start++;
+            }
+
+            int len_window = j - start + 1;
+            if (min_len > len_window)
+            {
+                min_len = len_window;
+                start_index = start;
+            }
+        }
+    }
+
+    return str.substr(start_index, min_len);
+}
+
+
+string MinWindowSubstring(string strArr[]) {
+
+  // code goes here
+  strArr[0] = mySubStr(strArr[0], strArr[1]);
+  return strArr[0];
+
+}
+
+int main() {
+
+  // keep this function call here
+  /* Note: In C++ you first have to initialize an array and set
+     it equal to the stdin to test your code with arrays. */
+
+  string A[] = gets(stdin);
+  cout << MinWindowSubstring(A);
+  return 0;
+
+}
+
+