diff --git a/Codeforces/1345B.cpp b/Codeforces/1345B.cpp
new file mode 100644
index 0000000..79dded6
--- /dev/null
+++ b/Codeforces/1345B.cpp
@@ -0,0 +1,45 @@
+#include<bits/stdc++.h>
+#include<math.h>
+using namespace std;
+const long long MAX = 1e9;
+vector<long long> pyr; //cards in pyramid
+
+int binarySearch(int n)
+{
+    int l = 0,r = pyr.size() - 1;
+    int ind = 0;
+    while(l <= r){
+        int mid = l + (r - l)/2;
+        if(pyr[mid] == n) return mid;
+        if(pyr[mid] < n){
+            l = mid + 1;
+            ind = mid;
+        }
+        else{
+            r = mid - 1;
+        }
+    }
+    return ind;
+}
+
+int main(){
+    long long sum =0;
+    for(int i =1;sum<=MAX;i++){
+        pyr.push_back(sum);
+        sum += 3*i-1;
+    }
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        int ans =0;
+        int i = binarySearch(n);
+        while(i>0&&n>0){
+            n -= pyr[i];
+            ans ++;
+            i = binarySearch(n);
+        }
+        cout<<ans<<endl;
+    }
+}
diff --git a/Codeforces/1346E.cpp b/Codeforces/1346E.cpp
new file mode 100644
index 0000000..9da5989
--- /dev/null
+++ b/Codeforces/1346E.cpp
@@ -0,0 +1,27 @@
+#include<bits/stdc++.h>
+#include<math.h>
+using namespace std;
+
+int main(){
+    int n,m,k;
+    cin>>n>>m>>k;
+    int ans[n];
+    for (int i = 0; i < n; ++i)
+    {
+        ans[i] = 2*10e6;
+    }
+    ans[k-1]=0;
+    while(m--){
+        int x;
+        int y;
+        cin>>x>>y;
+        int ix = ans[x];
+        int iy = ans[y];
+        ans[x] = min(ix+1, iy);
+        ans[y] = min(iy+1, ix);
+    }
+    for(auto x:ans){
+        cout<<((x==2*10e6)?-1:x)<<" ";
+    }
+    cout<<endl;
+}
diff --git a/Codeforces/1372B.cpp b/Codeforces/1372B.cpp
new file mode 100644
index 0000000..dc70864
--- /dev/null
+++ b/Codeforces/1372B.cpp
@@ -0,0 +1,29 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        if(n%2==0){
+            cout<<n/2<<" "<<n/2<<endl;
+        }
+        else{
+            int a=0;
+            for(int i=2;i<=sqrt(n);i++){
+                if(n%i==0){
+                    a = n/i;
+                    break;
+                }
+            }
+            if(a==0){
+                cout<<1<<" "<<n-1<<endl;
+            }
+            else{
+                cout<<a<<" "<<n-a<<endl;
+            }
+        }
+    }
+}
diff --git a/Codeforces/1380C.cpp b/Codeforces/1380C.cpp
new file mode 100644
index 0000000..71b0145
--- /dev/null
+++ b/Codeforces/1380C.cpp
@@ -0,0 +1,33 @@
+#include<bits/stdc++.h>
+#include<math.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n,x;
+        cin>>n>>x;
+        std::vector<int> a(n);
+        for (int i = 0; i < n; ++i)
+        {
+            cin>>a[i];
+        }
+        sort(a.begin(),a.end(),greater<int>());
+        int c =1;
+        int ans =0;
+        for (int i = 0; i < n; ++i)
+        {
+            if(a[i]*c>=x){
+                ans += 1;
+                c =0;
+            }
+            c++;
+
+        }
+        cout<<ans<<endl;
+
+
+    }
+    return 0;
+}
diff --git a/Codeforces/1399A.cpp b/Codeforces/1399A.cpp
new file mode 100644
index 0000000..4d1b89b
--- /dev/null
+++ b/Codeforces/1399A.cpp
@@ -0,0 +1,26 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        int a[n];
+        for(int i =0;i<n;i++){
+            cin>>a[i];
+        }
+        sort(a,a+n);
+        bool ans = true;
+        for(int i=1;i<n-1;i++){
+            if(abs(a[i] - a[i+1])>1){
+                ans = false;
+                break;
+            }
+        }
+        if(ans) cout<<"YES"<<endl;
+        else cout<<"NO"<<endl;
+    }
+    return 0;
+}
diff --git a/Codeforces/1418B.cpp b/Codeforces/1418B.cpp
new file mode 100644
index 0000000..66ef75e
--- /dev/null
+++ b/Codeforces/1418B.cpp
@@ -0,0 +1,37 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        int a[n], l[n];
+        vector<int> d;
+        for(auto &x:a){
+            cin>>x;
+        }
+        for(int i=0;i<n;i++){
+            cin>>l[i];
+            if(l[i]==0){
+                d.push_back(a[i]);
+            }
+        }
+        vector<int>::iterator j;
+        sort(d.begin(),d.end());
+        reverse(d.begin(), d.end());
+        j = d.begin();
+        for(int i =0;i<n;i++){
+            if(l[i]==0){
+                a[i]= *j;
+                j++;
+            }
+        }
+        for(int &x:a){
+            cout<<x<<" ";
+        }
+        cout<<endl;
+    }
+    return 0;
+}
diff --git a/Codeforces/1418C_DP.cpp b/Codeforces/1418C_DP.cpp
new file mode 100644
index 0000000..644cd44
--- /dev/null
+++ b/Codeforces/1418C_DP.cpp
@@ -0,0 +1,19 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int solve(int n, int a[])
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin<<n;
+        int a[n];
+        for(auto &x:a){
+            cin>>x;
+        }
+        c = solve(n,a);
+        cout<<c<<endl;
+    }
+}
diff --git a/Codeforces/1419D1.cpp b/Codeforces/1419D1.cpp
new file mode 100644
index 0000000..bf07170
--- /dev/null
+++ b/Codeforces/1419D1.cpp
@@ -0,0 +1,36 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    int a[n];
+    for(auto &x:a){
+        cin>>x;
+    }
+    sort(a, a+n);
+    int ans =0;
+    if(n>2){
+        if(n%2==0){
+            for(int i =0;i+2<n;i+=2){
+                int temp = a[i];
+                a[i] = a[i+1];
+                a[i+1] = temp;
+                ans++;
+            }
+        }
+        else{
+            for(int i =0;i+1<n;i+=2){
+                int temp = a[i];
+                a[i] = a[i+1];
+                a[i+1] = temp;
+                ans++;
+            }
+        }
+    }
+    cout<<ans<<endl;
+    for(auto x: a){
+        cout<<x<<" ";
+    }
+    return 0;
+}
diff --git a/Codeforces/1419D2.cpp b/Codeforces/1419D2.cpp
new file mode 100644
index 0000000..2d83c14
--- /dev/null
+++ b/Codeforces/1419D2.cpp
@@ -0,0 +1,48 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    int a[n];
+    for(auto &x:a){
+        cin>>x;
+    }
+    sort(a, a+n);
+    int ans =0;
+    if(n>2){
+        if(n%2==0){
+            for(int i =0;i+2<n;i+=2){
+                int j;
+                for(j =i+1;j<n-1;j++){
+                    if(a[j]!=a[i]){
+                        break;
+                    }
+                }
+                int temp = a[i];
+                a[i] = a[j];
+                a[j] = temp;
+                ans++;
+            }
+        }
+        else{
+            for(int i =0;i+1<n;i+=2){
+                int j;
+                for(j =i+1;j<n-1;j++){
+                    if(a[j]!=a[i]){
+                        break;
+                    }
+                }
+                int temp = a[i];
+                a[i] = a[j];
+                a[j] = temp;
+                ans++;
+            }
+        }
+    }
+    cout<<ans<<endl;
+    for(auto x: a){
+        cout<<x<<" ";
+    }
+    return 0;
+}
diff --git a/Codeforces/189A(dp).cpp b/Codeforces/189A(dp).cpp
new file mode 100644
index 0000000..14868e9
--- /dev/null
+++ b/Codeforces/189A(dp).cpp
@@ -0,0 +1,21 @@
+#include<bits/stdc++.h>
+using namespace std;
+ int dp[4001] ={INT_MIN};
+ int a,b,c;
+
+ int main(){
+     int n, a[3];
+     cin>>n>>a[0]>>a[1]>>a[2];
+     sort(a,a+3);
+     dp[0] =0;
+     for(int i=0;i<n+1;i++){
+         for(int j=0;j<3;j++){
+             if(i - a[j]>=0){
+                 dp[i] = max(dp[i],dp[i-a[j]]);
+             }
+         }
+         dp[i] += 1;
+     }
+     cout<<dp[n]<<endl;
+     return 0;
+ }
diff --git a/Codeforces/1932C(IMP).cpp b/Codeforces/1932C(IMP).cpp
new file mode 100644
index 0000000..e69de29
diff --git a/Codeforces/455A(dp).cpp b/Codeforces/455A(dp).cpp
new file mode 100644
index 0000000..159b622
--- /dev/null
+++ b/Codeforces/455A(dp).cpp
@@ -0,0 +1,19 @@
+#include<bits/stdc++.h>
+using namespace std;
+#define MAXN 100005
+long long occurance[MAXN] ={0};
+long long ans[MAXN] ={0};
+int main(){
+    int n,x;
+    cin>>n;
+    while(n--){
+        cin>>x;
+        occurance[x]++;
+    }
+    ans[1]=occurance[1];
+    for(int i=2;i<MAXN;i++){
+        ans[i] = max(ans[i-1],i*occurance[i]+ans[i-2]);
+    }
+    cout<<ans[MAXN-1]<<endl;
+    return 0;
+}
diff --git a/Codeforces/489B.cpp b/Codeforces/489B.cpp
new file mode 100644
index 0000000..c4ed86f
--- /dev/null
+++ b/Codeforces/489B.cpp
@@ -0,0 +1,30 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int n,m;
+    cin>>n;
+    int b[n];
+    for(auto &x : b){
+        cin>>x;
+    }
+    cin>>m;
+    int g[m];
+    for(auto &x : g){
+        cin>>x;
+    }
+    int i=0,j=0,p=0;
+    sort(b, b+n);
+    sort(g,g+m);
+    while(j<m){
+        for(i=0;i<n;i++){
+            if(abs(b[i]-g[j])<=1){
+                b[i] =102;
+                p++;
+                break;
+            }
+        }
+        j++;
+    }
+    cout<<p<<endl;
+    return 0;
+}
diff --git a/Codeforces/489C.cpp b/Codeforces/489C.cpp
new file mode 100644
index 0000000..75ddf3b
--- /dev/null
+++ b/Codeforces/489C.cpp
@@ -0,0 +1,10 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int m,s;
+    cin>>m>>s;
+
+
+    return 0;
+}
diff --git a/Codeforces/492B.cpp b/Codeforces/492B.cpp
new file mode 100644
index 0000000..61498b9
--- /dev/null
+++ b/Codeforces/492B.cpp
@@ -0,0 +1,22 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n,l;
+    cin>>n>>l;
+    int a[n];
+    for(int i=0;i<n;i++){
+        cin>>a[i];
+    }
+    sort(a,a+n);
+    int d = max(a[0]-0, l-a[n-1])*2;
+    for(int i=0;i<n-1;i++){
+        int temp = (a[i+1]-a[i]);
+        if(temp>=d){
+            d = temp;
+        }
+    }
+    cout.precision(10);
+    cout<<fixed<<(d/2.0)<<endl;
+    return 0;
+}
diff --git a/Codeforces/4C.cpp b/Codeforces/4C.cpp
new file mode 100644
index 0000000..f627c7d
--- /dev/null
+++ b/Codeforces/4C.cpp
@@ -0,0 +1,22 @@
+#include<bits/stdc++.h>
+#include<map>
+#include<string>
+using namespace std;
+
+int main(){
+    map<string,int> a;
+    int n;
+    cin>>n;
+    while(n--){
+        string temp;
+        cin>>temp;
+        if(a.count(temp)){
+            cout<<temp<<a[temp]<<endl;
+            a[temp]++;
+        }
+        else{
+            cout<<"OK"<<endl;
+            a[temp] = 1;
+        }
+    }
+}
diff --git a/Codeforces/580A.cpp b/Codeforces/580A.cpp
new file mode 100644
index 0000000..576e5e9
--- /dev/null
+++ b/Codeforces/580A.cpp
@@ -0,0 +1,26 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    int a[n];
+    for(int i=0;i<n;i++){
+        cin>>a[i];
+    }
+    int dp[n];
+    dp[0] =1;
+    int m =1;
+    for(int i=1;i<n;i++){
+        if(a[i]>= a[i-1]){
+            dp[i] = 1+ dp[i-1];
+            m = max(dp[i],m);
+        }
+        else{
+            dp[i] = 1;
+        }
+    }
+    cout<<m<<endl;
+    return 0;
+
+}
diff --git a/Codeforces/996A.cpp b/Codeforces/996A.cpp
new file mode 100644
index 0000000..9e8ed68
--- /dev/null
+++ b/Codeforces/996A.cpp
@@ -0,0 +1,30 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    int ans =0;
+    if(n/100){
+        ans += n/100;
+        n -= (n/100)*100;
+    }
+    if(n/20){
+        ans += n/20;
+        n -= (n/20)*20;
+    }
+    if(n/10){
+        ans += n/10;
+        n -= (n/10)*10;
+    }
+    if(n/5){
+        ans += n/5;
+        n -= (n/5)*5;
+    }
+    if(n>0){
+        ans += n;
+    }
+    cout<<ans<<endl;
+
+    return 0;
+}
diff --git a/Codeforces/DFS/520B.cpp b/Codeforces/DFS/520B.cpp
new file mode 100644
index 0000000..460cf1a
--- /dev/null
+++ b/Codeforces/DFS/520B.cpp
@@ -0,0 +1,35 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int bfs(int x, int y){
+    std::vector<bool> v(10002,false);
+    v[x] = true;
+    std::queue<pair <int,int>> q;     //value,distance
+    q.push(x,0);
+    while(!q){
+        pair <int,int> p = q.front();
+        q.pop();
+        v[p.first] = true;
+        if(p.first==y){
+            return(p.second);
+        }
+        else{
+            if(p.first*2==y){
+                return(p.second +1);
+            }
+            else if(p.first*2<y&&v[p.first*2]==false) q.push(p.first*2,p.second+1);
+            if(p.first-1==y){
+                return(p.second +1);
+            }
+            else if(p.first-1>0&&v[p.first-1]==false) q.push(p.first-1,p.second+1);
+        }
+    }
+    return 0;
+}
+
+int main(){
+    int n,m;
+    cin>>n>>m;
+    int c = bfs(n,m);
+    cout<<c<<endl;
+}
diff --git a/Netflix Page (unfinished)/JS/main.js b/Netflix Page (unfinished)/JS/main.js
new file mode 100644
index 0000000..e69de29
diff --git a/Netflix Page (unfinished)/css/style.css b/Netflix Page (unfinished)/css/style.css
new file mode 100644
index 0000000..23d38a1
--- /dev/null
+++ b/Netflix Page (unfinished)/css/style.css	
@@ -0,0 +1,274 @@
+:root {
+  --primary-color: #e50914;
+  --dark-color: #141414;
+  --light-color: #f4f4f4;
+}
+
+* {
+  box-sizing: border-box;
+  margin: 0;
+  padding: 0;
+}
+
+body {
+  font-family: "Arial";
+  -webkit-font-smoothing: antialiased;
+  background: black;
+  color: #666;
+}
+
+ul {
+  list-style: none;
+}
+h1,
+h2,
+h3,
+h4 {
+  color: #fff;
+}
+a {
+  color: #fff;
+  text-decoration: none;
+}
+
+p {
+  margin: 0.5rem 0;
+}
+img {
+  width: 100%;
+}
+
+.showcase {
+  width: 100%;
+  height: 93vh;
+  position: relative;
+  background: url("https://i.ibb.co/vXqDmnh/background.jpg") no-repeat center
+    center/cover;
+}
+
+.showcase::after {
+  content: "";
+  position: absolute;
+  top: 0;
+  left: 0;
+  width: 100%;
+  height: 100%;
+  z-index: 1;
+  background: rgba(0, 0, 0, 0.6);
+  box-shadow: inset 120px 100px 250px #000000, inset -120px -100px 250px #000000;
+}
+.showcase-top {
+  z-index: 2;
+  position: relative;
+  height: 90px;
+}
+
+.showcase-top img {
+  position: absolute;
+  width: 170px;
+  top: 50%;
+  left: 50%;
+  transform: translate(-50%, -50%);
+}
+
+.showcase-top a {
+  position: absolute;
+  top: 50%;
+  right: 0;
+  transform: translate(-50%, -50%);
+}
+
+.showcase-content {
+  z-index: 2;
+  position: relative;
+  margin: auto;
+  display: flex;
+  flex-direction: column;
+  justify-content: center;
+  align-items: center;
+  text-align: center;
+  margin-top: 9rem;
+}
+.showcase-content h1 {
+  font-weight: ;
+  font-size: 5.2rem;
+  line-height: 1.1;
+  margin-bottom: 2rem;
+}
+
+.showcase-content p {
+  text-transform: uppercase;
+  color: white;
+  font-weight: 400;
+  font-size: 1.9rem;
+  line-height: 1.25;
+  margin-bottom: 2rem;
+}
+
+/* tabs */
+
+.tabs {
+  background: var(--dark-color);
+  padding-top: 1rem;
+  border-bottom: 3px solid #3d3d3d;
+}
+
+.tabs .container {
+  display: grid;
+  grid-template-columns: repeat(3, 1fr);
+  grid-gap: 1rem;
+  justify-self: center;
+  align-items: center;
+  text-align: center;
+}
+.tabs p {
+  font-size: 1.2rem;
+  padding-top: 0.5rem;
+}
+
+.tabs .container > div {
+  padding : 1.5 0;
+}
+.tabs .container > div:hover {
+  color: white;
+  cursor: pointer;
+}
+.tab-border {
+  border-bottom: var(--primary-color) 4px solid;
+}
+/* tab content */
+.tab-content {
+  padding 3rem 0;
+  color: #fff;
+}
+#tab-1-content .tab-1-content-inner {
+  display: grid;
+  grid-template-columns: repeat(2,1fr);
+  grid-gap: 2rem;
+  justify-content: center;
+  align-items: center;
+}
+
+#tab-2-content .tab-2-content-top {
+  margin-top: 2rem;
+  display: grid;
+  grid-template-columns: 2fr 1fr;
+  grid-gap: 1rem;
+  justify-content: center;
+  align-items: center;
+
+}
+#tab-2-content .tab-2-content-bottom {
+  margin-top: 2rem;
+  display: grid;
+  grid-template-columns: 1fr 1fr 1fr;
+  grid-gap: 2rem;
+  justify-content: center;
+  align-items: center;
+  text-align: center;
+
+}
+.table {
+  width: 100%;
+  margin-top: 2rem;
+  border-collapse: collapse;
+  border-spacing: 0;
+}
+.table thead th {
+  text-transform: uppercase;
+  padding : 0.8rem;
+}
+.table tbody tr td {
+  color : #999;
+  text-align: center;
+  padding: 0.8rem 1.2rem;
+}
+.table tbody tr td:first-child {
+  text-align: left;
+}
+.table tbody tr:nth-child(odd){
+  background:#222;
+}
+
+/* footer */
+
+.footer {
+  max-width: 70%;
+  margin: 1rem auto;
+}
+
+.footer a {
+  color: #999;
+}
+
+.footer .footer-cols{
+  display: grid;
+  grid-template-columns: repeat(4,1fr);
+  grid-gap: 2rem;
+  
+}
+.footer li {
+  line-height: 1.9;
+}
+/* COntainer */
+.container {
+  max-width: 70%;
+  margin: auto;
+  padding : 0 2rem;
+}
+
+/* text */
+
+.text-lg {
+  font-size: 1.8rem;
+  margin-bottom: 1rem;
+}
+.text-md {
+  font-size: 1.5rem;
+  margin-bottom: 1rem;
+}
+.text-center {
+  text-align: center;
+}
+
+.text-dark {
+  color: #999;
+}
+
+
+/* Buttons */
+
+.btn {
+  display: inline-block;
+  background: var(--primary-color);
+  color: #fff;
+  padding: 0.4rem, 1.3rem;
+  text-align: center;
+  cursor: pointer;
+  border: none;
+  font-size: 1rem;
+  margin-right: 0.5rem;
+  outline: none;
+  box-shadow: 0 1px 0 rgba(0, 0, 0, 0.45);
+  border-radius: 2px;
+}
+
+.btn:hover {
+  opacity: 0.9;
+}
+
+.btn-rounded {
+  border-radius: 5px;
+}
+
+.btn-xl {
+  font-size: 2rem;
+  padding: 1.5rem 2.1rem;
+  text-transform: uppercase;
+}
+
+.btn-lg {
+	font-size: 1rem;
+	padding: 0.8rem 1.3rem;
+	text-transform: uppercase;
+}
diff --git a/Netflix Page (unfinished)/index.html b/Netflix Page (unfinished)/index.html
new file mode 100644
index 0000000..ea5b8bb
--- /dev/null
+++ b/Netflix Page (unfinished)/index.html	
@@ -0,0 +1,193 @@
+<!DOCTYPE html>
+<html lang="en">
+  <head>
+    <meta charset="UTF-8" />
+    <meta name="viewport" content="width=device-width, initial-scale=1.0" />
+    <title>Netflix Watch tv shows online</title>
+    <link rel="stylesheet" href="css/style.css" />
+    <script
+      src="https://kit.fontawesome.com/352bcee87b.js"
+      crossorigin="anonymous"
+    ></script>
+  </head>
+  <body>
+    <header class="showcase">
+      <div class="showcase-top">
+        <img src="https://i.ibb.co/r5krrdz/logo.png" alt="netflix" />
+        <a href="#" class="btn btn-rounded">Sign In</a>
+      </div>
+      <div class="showcase-content">
+        <h1>See what's next.</h1>
+        <p>Watch anywhere. Cancel anytime.</p>
+        <a href="#" class="btn btn-xl">
+          Watch Free For 30 Days <i class="fas fa-chevron-right btn-icon"></i>
+        </a>
+      </div>
+    </header>
+    <section class="tabs">
+      <div class="container">
+        <div id="tab-1" class="tab-item tab-border">
+          <i class="fas fa-door-open fa-3x"></i>
+          <p class="hide-sm">Cancel at any time</p>
+        </div>
+        <div id="tab-2" class="tab-item">
+          <i class="fas fa-tablet-alt fa-3x"></i>
+          <p class="hide-sm">Watch anywhere</p>
+        </div>
+        <div id="tab-3" class="tab-item">
+          <i class="fas fa-tags fa-3x"></i>
+          <p class="hide-sm">Pick your price</p>
+        </div>
+      </div>
+    </section>
+    <section class="tab-content">
+      <div class="container">
+        <!-- tab-1 -->
+        <!-- <div id="tab-1-content" class="show tab-content-item">
+          <div class="tab-1-content-inner">
+            <div>
+              <p class="text-lg">
+                If you decide Netflix isn't for you - no problem. No commitment.
+                Cancel online anytime.
+              </p>
+              <a href="#" class="btn btn-lg">Watch Free For 30 Days</a>
+            </div>
+            <img src="https://i.ibb.co/J2xDJV7/tab-content-1.png" alt="" />
+          </div>
+        </div> -->
+        <!-- tab-2 -->
+        <!-- Tab Content 2 -->
+        <!-- <div id="tab-2-content" class="tab-content-item">
+          <div class="tab-2-content-top">
+            <p class="text-lg">
+              Watch TV shows and movies anytime, anywhere — personalized for
+              you.
+            </p>
+            <a href="#" class="btn btn-lg">Watch Free For 30 Days</a>
+          </div>
+          <div class="tab-2-content-bottom">
+            <div>
+              <img src="https://i.ibb.co/DpdN7Gn/tab-content-2-1.png" alt="" />
+              <p class="text-md">Watch on your TV</p>
+              <p class="text-dark">
+                Smart TVs, PlayStation, Xbox, Chromecast, Apple TV, Blu-ray
+                players and more.
+              </p>
+            </div>
+            <div>
+              <img src="https://i.ibb.co/R3r1SPX/tab-content-2-2.png" alt="" />
+              <p class="text-md">Watch instantly or download for later</p>
+              <p class="text-dark">
+                Available on phone and tablet, wherever you go.
+              </p>
+            </div>
+            <div>
+              <img src="https://i.ibb.co/gDhnwWn/tab-content-2-3.png" alt="" />
+              <p class="text-md">Use any computer</p>
+              <p class="text-dark">Watch right on Netflix.com.</p>
+            </div>
+          </div>
+        </div> -->
+        <!-- tab-3 -->
+        <div id="tab-2-content" class="tab-content-item">
+          <div class="text-center">
+            <p class="text-lg">
+              Choose one plan and watch everything on Netflix.
+            </p>
+            <a href="#" class="btn btn-lg">Watch Free For 30 Days</a>
+          </div>
+          <table class="table">
+            <thead>
+              <tr>
+                <th></th>
+                <th>Basic</th>
+                <th>Standard</th>
+                <th>Premium</th>
+              </tr>
+            </thead>
+            <tbody>
+              <tr>
+                <td>Monthly price after free month ends on 6/19/19</td>
+                <td>$8.99</td>
+                <td>$12.99</td>
+                <td>$15.99</td>
+              </tr>
+              <tr>
+                <td>HD Available</td>
+                <td><i class="fas fa-times"></i></td>
+                <td><i class="fas fa-check"></i></td>
+                <td><i class="fas fa-check"></i></td>
+              </tr>
+              <tr>
+                <td>Ultra HD Available</td>
+                <td><i class="fas fa-times"></i></td>
+                <td><i class="fas fa-times"></i></td>
+                <td><i class="fas fa-check"></i></td>
+              </tr>
+              <tr>
+                <td>Screens you can watch on at the same time</td>
+                <td>1</td>
+                <td>2</td>
+                <td>4</td>
+              </tr>
+              <tr>
+                <td>Watch on your laptop, TV, phone and tablet</td>
+                <td><i class="fas fa-check"></i></td>
+                <td><i class="fas fa-check"></i></td>
+                <td><i class="fas fa-check"></i></td>
+              </tr>
+              <tr>
+                <td>Unlimited movies and TV shows</td>
+                <td><i class="fas fa-check"></i></td>
+                <td><i class="fas fa-check"></i></td>
+                <td><i class="fas fa-check"></i></td>
+              </tr>
+              <tr>
+                <td>Cancel anytime</td>
+                <td><i class="fas fa-check"></i></td>
+                <td><i class="fas fa-check"></i></td>
+                <td><i class="fas fa-check"></i></td>
+              </tr>
+              <tr>
+                <td>First month free</td>
+                <td><i class="fas fa-check"></i></td>
+                <td><i class="fas fa-check"></i></td>
+                <td><i class="fas fa-check"></i></td>
+              </tr>
+            </tbody>
+          </table>
+        </div>
+      </div>
+    </section>
+    <footer class="footer">
+      <p>Questions? Call 1-866-579-7172</p>
+      <div class="footer-cols">
+        <ul>
+          <li><a href="#">FAQ</a></li>
+          <li><a href="#">Investor Relations</a></li>
+          <li><a href="#">Ways To Watch</a></li>
+          <li><a href="#">Corporate Information</a></li>
+          <li><a href="#">Netflix Originals</a></li>
+        </ul>
+        <ul>
+          <li><a href="#">Help Center</a></li>
+          <li><a href="#">Jobs</a></li>
+          <li><a href="#">Terms Of Use</a></li>
+          <li><a href="#">Contact Us</a></li>
+        </ul>
+        <ul>
+          <li><a href="#">Account</a></li>
+          <li><a href="#">Redeem Gift Cards</a></li>
+          <li><a href="#">Privacy</a></li>
+          <li><a href="#">Speed Test</a></li>
+        </ul>
+        <ul>
+          <li><a href="#">Media Center</a></li>
+          <li><a href="#">Buy Gift Cards</a></li>
+          <li><a href="#">Cookie Preferences</a></li>
+          <li><a href="#">Legal Notices</a></li>
+        </ul>
+      </div>
+    </footer>
+  </body>
+</html>