├── Programming
    ├── CPP
    │   ├── Dynamic Programming
    │   │   └── Stock_Maximize.cpp
    │   ├── Graph Theory
    │   │   └── BFS_Short_Reach.cpp
    │   └── Miscellenous
    │   │   └── staircase.cpp
    ├── Python
    │   └── Miscellaneous
    │   │   └── Absolute_Permutation.py
    └── Robots.txt
├── README.md
└── Web-Development
    ├── Mum with cub
        ├── index.html
        ├── readme.md
        └── style.css
    └── Robots.txt


/Programming/CPP/Dynamic Programming/Stock_Maximize.cpp:
--------------------------------------------------------------------------------
 1 | // PROBLEM NAME: Stock Maximize (Dynamic Programming) at HackerRank Copyright.
 2 | // SUBMITTED BY: Jishan Shaikh
 3 | // LEVEL: Experienced in C++
 4 | // =========================
 5 | // What to learn?
 6 | // The Essense of Dynamic Programming i.e. How dynamic programming works?
 7 | // ======================================================================
 8 | 
 9 | #include <iostream>
10 | #include <set>
11 | #include <map>
12 | #include <cmath>
13 | #include <cstdio>
14 | #include <vector>
15 | #include <algorithm>
16 | #include <queue>
17 | 
18 | using namespace std;
19 | 
20 | int num[11111111];
21 | int main(){
22 |   int t;
23 |   cin >> t;
24 |   for(int cas=1; cas<=t; cas++){
25 |     vector<pair<int, int>> a;
26 |     a.clear();
27 |     int n;
28 |     cin >> n;
29 |     for(int i=0; i<n; i++){
30 |       cin >> num[i];
31 |       a.push_back(make_pair(num[i], i));
32 |     }
33 |     sort(a.begin(), a.end());
34 |     int start=0;
35 |     long long res=0;
36 |     for(int i=a.size()-1; i>=0; i--){
37 |       if(a[i].second>=start){
38 |         for(; start<=a[i].second; start++){
39 |           res -= num[start];
40 |           res += a[i].first;
41 |         }
42 |       }
43 |     }
44 |     cout << res << endl;
45 |   }
46 |   return 0;
47 | }
48 | 


--------------------------------------------------------------------------------
/Programming/CPP/Graph Theory/BFS_Short_Reach.cpp:
--------------------------------------------------------------------------------
 1 | // PROBLEM NAME: Breadth First Search: Shortest Reach (Graph Theory) at HackerRank Copyright.
 2 | // SUBMITTED BY: Jishan Shaikh
 3 | // LEVEL: Experienced in C++
 4 | // =========================
 5 | // What to learn?
 6 | // Implementation of Breadth first search in adjacency matrix representation
 7 | // =========================================================================
 8 | 
 9 | #include <bits/stdc++.h>
10 | 
11 | using namespace std;
12 | 
13 | vector <int> edge[1999];
14 | 
15 | int main(){
16 |     int t, n, m, x, y, s, i;
17 |     cin >> t;
18 |     while(t--){
19 |         cin >> n >> m;
20 |         for(i=0; i<n+3; i++)
21 |             edge[i].clear();
22 |         for(i=0; i<m; i++){         // x and y are the vertices of which edge exists
23 |             cin >> x >> y;
24 |             edge[x].push_back(y);
25 |             edge[y].push_back(x);
26 |         }
27 |         cin >> s;
28 |         
29 |         bool vis[n+1];
30 |         memset(vis, false, sizeof(vis));    // Initialising all values of vis to false i.e. not visited
31 |     
32 |         int dist[n+1];
33 |         memset(dist, 0, sizeof(dist));      // Initialising all values of dist to 0;
34 |     
35 |         list <int> q;
36 |         q.push_back(s);
37 |         vis[s]=true;
38 |         dist[s]=0;
39 |         while(!q.empty()){
40 |             int u=q.front();
41 |             q.pop_front();
42 |             for(i=0; i<edge[u].size(); i++){
43 |                 int v=edge[u][i];
44 |                 if(!vis[v]){
45 |                     vis[v]=true;
46 |                     dist[v]=dist[u]+6;      // Weight of edge is 6 (given)
47 |                     q.push_back(v);
48 |                 }
49 |             }
50 |         }
51 |         for(i=1; i<=n; i++){
52 |             if(i!=s){
53 |                 if(dist[i]==0)
54 |                     cout<<"-1 ";
55 |                 else
56 |                 cout << dist[i] << " ";
57 |             }
58 |         }
59 |         cout << endl;
60 |     }
61 |     return 0;
62 | }
63 | 


--------------------------------------------------------------------------------
/Programming/CPP/Miscellenous/staircase.cpp:
--------------------------------------------------------------------------------
 1 | // Problem name: Staircase (hackerrank/algorithms/warmup/)
 2 | // Solution by: Jishan Shaikh (@jishanshaikh)
 3 | 
 4 | #include <bits/stdc++.h>
 5 | 
 6 | using namespace std;
 7 | 
 8 | void staircase(int n){
 9 |    n--;
10 |    int i=n-1, j=0;
11 |    while(i<=n && j<=n && i+j==n-1){
12 |        for(int temp=i; temp>=0; temp--){
13 |            cout << " ";
14 |        }
15 |        for(int temp=j; temp>=0; temp--){
16 |            cout << "#";
17 |        }
18 |        cout << endl;
19 |        i--;
20 |        j++;
21 |    }
22 | }
23 | 
24 | int main(){
25 |     int n;
26 |     cin >> n;
27 |     staircase(n);
28 |     return 0;
29 | }
30 | 


--------------------------------------------------------------------------------
/Programming/Python/Miscellaneous/Absolute_Permutation.py:
--------------------------------------------------------------------------------
 1 | // PROBLEM NAME: Absolute Permutation (Implementation) at HackerRank Copyright.
 2 | // SUBMITTED BY: Jishan Shaikh
 3 | // LEVEL: Intermediate in Python
 4 | // =============================
 5 | // What to learn?
 6 | // map() and its features to problem solving.
 7 | // ==========================================
 8 | 
 9 | t = int(raw_input())
10 | ans = []
11 | 
12 | for _ in xrange(t):
13 |     n,k = map(int,raw_input().split())
14 |     ans = [0 for _ in xrange(n)]
15 |     for i in xrange(1,n+1):
16 |         if i-k >0 and ans[i-k-1]==0:
17 |             ans[i-k-1] = i
18 |         elif i+k <= n and ans[i+k-1] == 0:
19 |             ans[i+k-1] = i
20 |         else:
21 |             break
22 |     if 0 in ans:
23 |         print -1
24 |     else:
25 |         print " ".join(map(str,ans))
26 | 


--------------------------------------------------------------------------------
/Programming/Robots.txt:
--------------------------------------------------------------------------------
1 | lorem ipsom idor.
2 | 


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | # :coffee: Explore-the-codes
 2 | > A collection of computer programs to learn, explore, and evaluate. Understand the problem, give a big punch to it, think more of it, tired. Now look up here. Run it? Like it? go home with a little new knowledge. Your helping hand to competitve programming (Beware of Plagiarism!). Nail the technical interviews with confidence.
 3 | 
 4 | ## Topics
 5 | - [Programming](https://www.github.com/programming)
 6 |   - [C Programming](https://www.github.com/)
 7 |   - [C++ Programming](https://github.com/Jishanshaikh4/Explore-the-codes/tree/master/Programming/CPP): Number of Programs till now **2**
 8 |   - [Java Programming](https://www.github.com/)
 9 |   - [Python Programming](https://github.com/Jishanshaikh4/Explore-the-codes/tree/master/Programming/Python): Number of Programs till now **1**
10 |   - [JavaScript Programming](https://www.github.com/)
11 |   - [PHP Programming](https://www.github.com/)
12 |   - [Matlab Programming](https://www.github.com/)
13 |   - [More](https://www.github.com/)
14 | - [Web Developement](https://www.github.com/)
15 |   - [HTML](https://www.github.com/)
16 |   - [CSS](https://www.github.com/)
17 |   - [JS](https://www.github.com/)
18 |   - [Bootstrap](https://www.github.com/)
19 |   - [More](https://www.github.com/)
20 | - Others
21 |   - [LaTex](https://www.github.com/)
22 |   - [Competitive Programming]((https://www.github.com/))
23 |   - [Coding. Why to do it?](https://www.github.com/)
24 |   - [Nail the Tech Interview.](https://www.github.com/)
25 |   - [More](https://www.github.com/)
26 |   
27 | ## More Information
28 | 
29 | ### What is it and How can you use it?
30 | Take a look at any of the code. You are encouraging to first read and understand the code (If you can) and then try to guess output when that code run. Now run the code and find what's the difference. Understand implementational details along with syntactical information of language. Do whatever you want to do with these. Good? Right. Suggestions? Leave a pull request. 
31 | 
32 | ### Wanna Contribute?
33 | Feel free to contribute. Any pretty suggestion will be acknowledged.
34 | 
35 | ### Licence
36 | Just feel free to examine and test these codes. They are set in Public Domain!
37 | 
38 | [![CC0](https://i.creativecommons.org/p/zero/1.0/88x31.png)](https://creativecommons.org/publicdomain/zero/1.0/)
39 | 


--------------------------------------------------------------------------------
/Web-Development/Mum with cub/index.html:
--------------------------------------------------------------------------------
 1 | <!DOCTYPE html5>
 2 | <html>
 3 |   <head>
 4 |     <title>Mum with cub</title>
 5 |     <link rel="stylesheet" type="text/css" href="style.css" />
 6 |   </head>
 7 |   <body>
 8 |     <svg viewBox="0 0 100 100">
 9 |       <path
10 |         style="opacity:1;fill:#fff;fill-rule:evenodd;stroke:none;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1"
11 |         d="M 20.128906 17.480469 C 19.836648 18.645035 20.059165 20.162987 19.861328 22.144531 C 18.056348 23.322502 14.574508 24.604855 12.433594 26.498047 C 10.29268 28.391239 10.886086 29.747935 10.101562 30.314453 C 6.7907064 32.705279 5.3485545 33.380494 2.8085938 35.113281 C 2.9472043 37.069282 3.6902754 38.494267 5.2304688 39.541016 C 9.5726927 42.492086 26.811862 43.21847 29.888672 47.488281 C 32.37986 50.945402 32.182748 58.246026 33.125 64.017578 C 34.067252 69.78913 35.10286 73.547558 37.375 82 L 92.740234 82 C 96.497789 68.192278 100.3772 59.022767 93.990234 43.208984 C 88.733521 30.193646 72.959898 24.483218 65.246094 25.041016 C 57.532289 25.598813 56.344234 27.650208 52.689453 27.611328 C 49.034672 27.572452 45.726286 25.127834 42.515625 24.802734 C 39.304964 24.477631 39.116037 25.143352 34.820312 24.548828 C 30.524587 23.954305 23.769379 18.414118 20.128906 17.480469 z M 13.482422 28.75 A 1.3392857 1.4285715 0 0 1 14.822266 30.177734 A 1.3392857 1.4285715 0 0 1 13.482422 31.607422 A 1.3392857 1.4285715 0 0 1 12.142578 30.177734 A 1.3392857 1.4285715 0 0 1 13.482422 28.75 z " />
12 |       <path
13 |         class="cub"
14 |         d="M 42.410156 55.089844 C 42.410156 56.691319 42.44321 56.103204 42.5 57.322266 C 40.726433 57.603828 39.924598 58.703419 38.884766 59.642578 C 37.844934 60.581737 38.042777 61.49319 37.455078 62.232422 C 36.867379 62.971654 35.916882 62.980423 35 64.017578 C 35.02062 66.661876 36.157314 66.548667 37.947266 67.589844 C 39.737218 68.631021 43.863259 67.709662 45.847656 69.330078 C 47.832054 70.950493 48.251484 73.992432 48.347656 76.294922 C 48.443826 78.597412 48.57259 79.254103 47.767578 82 L 80.357422 82 C 81.012463 74.321429 81.008835 70.71935 76.339844 65.892578 C 67.675822 56.935769 59.77276 63.052378 53.214844 60.892578 C 46.656928 58.732779 45.906313 54.872359 42.410156 55.089844 z M 40.154297 61.109375 A 0.94701803 1.0101526 0 0 1 41.099609 62.119141 A 0.94701803 1.0101526 0 0 1 40.154297 63.128906 A 0.94701803 1.0101526 0 0 1 39.207031 62.119141 A 0.94701803 1.0101526 0 0 1 40.154297 61.109375 z " />
15 |       <path
16 |         style="opacity:1;fill:#fff;fill-rule:evenodd;stroke:none;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1"
17 |         d="m 39.107143,49.107143 c 0,0 11.639271,11.063881 14.107142,18.529959 2.467871,7.466077 0.892858,14.362898 0.892858,14.362898 h 11.428571 c 0,0 1.305124,-10.790824 0,-16.642857 -1.305124,-5.852033 -8.214286,-17.5 -8.214286,-17.5 z"
18 |         id="path951"
19 |         inkscape:connector-curvature="0"
20 |         sodipodi:nodetypes="czcczcc" />
21 |     </svg>
22 |   </body>
23 | </html>
24 | 


--------------------------------------------------------------------------------
/Web-Development/Mum with cub/readme.md:
--------------------------------------------------------------------------------
1 | # Mum with cub
2 | 
3 | ## Important
4 | - Forked from [Codepen.io](https://codepen.io/ainalem/pen/vagXBL).
5 | - Licensed as per Codepen.io and [Mikael Ainalem](https://codepen.io/ainalem). 
6 | - Thanks [Mikael Ainalem](https://codepen.io/ainalem) for a brilliant idea.
7 | 


--------------------------------------------------------------------------------
/Web-Development/Mum with cub/style.css:
--------------------------------------------------------------------------------
 1 | body {
 2 |   margin: 0;
 3 | }
 4 | svg {
 5 |   background: black;
 6 |   filter: invert(100%);
 7 |   height: 100vmin;
 8 |   left: calc(50% - 50vmin);
 9 |   position: absolute;
10 |   width: 100vmin;
11 | }
12 | .cub {
13 |   animation: Cycle 5s infinite;
14 |   fill:#fff;
15 |   mix-blend-mode:difference;
16 |   stroke-linecap:butt;
17 |   stroke-linejoin:miter;
18 |   stroke-opacity:1;
19 |   stroke-width:1px;
20 |   stroke:none;
21 | }
22 | @keyframes Cycle {
23 |   0% { transform: translateX(70%); }
24 |   5% { transform: translateX(70%); }
25 |   25% { transform: translateX(0%); }
26 |   75% { transform: translateX(0%); }
27 |   95% { transform: translateX(-85%); }
28 |   100% { transform: translateX(-85%); }
29 | }
30 | 


--------------------------------------------------------------------------------
/Web-Development/Robots.txt:
--------------------------------------------------------------------------------
1 | Lorem Ipsum idor.
2 | 


--------------------------------------------------------------------------------