Add files via upload

Author: ankit-tiwari-dev

Add_1_to_a_SLL.cpp

@@ -0,0 +1,132 @@
+//{ Driver Code Starts
+// Initial template for C++
+
+#include <bits/stdc++.h>
+using namespace std;
+
+struct Node {
+    int data;
+    struct Node* next;
+
+    Node(int x) {
+        data = x;
+        next = NULL;
+    }
+};
+
+void printList(Node* node) {
+    while (node != NULL) {
+        cout << node->data % 10;
+        node = node->next;
+    }
+    cout << "\n";
+}
+
+
+// } Driver Code Ends
+// User function template for C++
+
+/*
+
+struct Node
+{
+    int data;
+    struct Node* next;
+
+    Node(int x){
+        data = x;
+        next = NULL;
+    }
+};
+
+*/
+
+class Solution {  
+public:  
+    Node* reverse(Node* head) {  
+        Node* temp = head;  
+        Node* front = NULL;  
+        Node* prev = NULL;  
+        
+        while (temp != NULL) 
+        {  
+            front = temp->next;   
+            temp->next = prev;    
+            prev = temp;         
+            temp = front;      
+        }  
+        return prev; 
+    }  
+    
+    Node* addOne(Node* head) {  
+        head = reverse(head); 
+        Node * temp = head;
+        int carry = 1;                
+        
+        while (temp != NULL) 
+        {  
+            temp->data += carry;   
+            if (temp->data < 10) 
+            {  
+                carry = 0;   
+                break;   
+            } 
+            else 
+            {  
+                temp->data = 0;   
+                carry = 1;  
+            }  
+            temp = temp->next; 
+        }  
+
+        if (carry == 1)
+        {  
+            Node* newnode = new Node(1);  
+            head = reverse(head); 
+            newnode->next = head;   
+            return newnode; 
+        }  
+        
+        head = reverse(head);   
+        return head;
+    }  
+};
+
+
+//{ Driver Code Starts.
+
+int main() {
+    int t;
+    cin >> t;
+    cin.ignore();
+    while (t--) {
+        vector<int> arr;
+        string input;
+        getline(cin, input);
+        stringstream ss(input);
+        int number;
+        while (ss >> number) {
+            arr.push_back(number);
+        }
+
+        if (arr.empty()) {
+            cout << -1 << endl;
+            continue;
+        }
+
+        int data = arr[0];
+        struct Node* head = new Node(data);
+        struct Node* tail = head;
+        for (int i = 1; i < arr.size(); ++i) {
+            data = arr[i];
+            tail->next = new Node(data);
+            tail = tail->next;
+        }
+        Solution ob;
+        head = ob.addOne(head);
+        printList(head);
+    }
+    return 0;
+}
+
+// } Driver Code Ends

AggressiveCows.cpp

@@ -0,0 +1,77 @@
+//{ Driver Code Starts
+// Initial Template for C++
+#include <bits/stdc++.h>
+using namespace std;
+
+
+// } Driver Code Ends
+// User function Template for C++
+
+class Solution {
+public:
+    bool canWePlace(vector<int> &stalls, int distance, int cows)
+    {
+        int cntCows = 1;
+        int last = stalls[0];
+        for(int i = 0; i < stalls.size(); i++)
+        {
+            if(stalls[i] - last >= distance)
+            {
+                cntCows++;
+                last = stalls[i];
+            }
+            if(cntCows >= cows)
+                return true;
+        }
+        return false;
+    }
+    int solve(int n, int k, vector<int> &stalls) {
+        sort(stalls.begin(), stalls.end());
+        int ans = -1;
+        int low = 1;
+        int high = stalls[stalls.size() - 1];
+        while(low <= high)
+        {
+            int mid = (low + high)/2;
+            if(canWePlace(stalls, mid, k))
+            {
+                ans = mid;
+                low = mid+1;
+            }
+            else high = mid-1;
+        }
+        return ans;
+    }
+};
+
+//{ Driver Code Starts.
+
+int main() {
+    int t = 1;
+    cin >> t;
+
+    // freopen ("output_gfg.txt", "w", stdout);
+
+    while (t--) {
+        // Input
+
+        int n, k;
+        cin >> n >> k;
+
+        vector<int> stalls(n);
+        for (int i = 0; i < n; i++) {
+            cin >> stalls[i];
+        }
+        // char ch;
+        // cin >> ch;
+
+        Solution obj;
+        cout << obj.solve(n, k, stalls) << endl;
+
+        // cout << "~\n";
+    }
+    // fclose(stdout);
+
+    return 0;
+}
+// } Driver Code Ends

Alien_Dictionary.cpp

@@ -0,0 +1,117 @@
+//{ Driver Code Starts
+// Initial Template for C++
+
+#include <bits/stdc++.h>
+using namespace std;
+
+// } Driver Code Ends
+// User function Template for C++
+
+class Solution{
+    private:
+    vector<int> topoSort(int V, vector<int> adj[])
+    {
+        int indegree[V] = {0};
+        for(int i = 0; i < V; i++)
+        {
+            for(auto it : adj[i])
+            {
+                indegree[it]++;
+            }
+        }
+        queue<int>q;
+        for(int i = 0; i < V; i++)
+        {
+            if(indegree[i] == 0)
+            {
+                q.push(i);
+            }
+        }
+        vector<int> topo;
+        while(!q.empty())
+        {
+            int node = q.front();
+            q.pop();
+            topo.push_back(node);
+            for(auto it : adj[node])
+            {
+                indegree[it]--;
+                if(indegree[it] == 0) q.push(it);
+            }
+        }
+        return topo;
+    }
+    public:
+    string findOrder(string dict[], int N, int K) {
+        vector<int>adj[K];
+        for(int i = 0; i < N-1; i++)
+        {
+            string s1 = dict[i];
+            string s2 = dict[i+1];
+            int len = min(s1.size(), s2.size());
+            for(int ptr = 0; ptr < len; ptr++)
+            {
+                if(s1[ptr] != s2[ptr])
+                {
+                    adj[s1[ptr] - 'a'].push_back(s2[ptr] - 'a');
+                    break;
+                }
+            }
+        }
+        vector<int>topo = topoSort(K, adj);
+        string ans = "";
+        for(auto it : topo)
+        {
+            ans = ans + char(it + 'a');
+        }
+        return ans;
+    }
+};
+
+//{ Driver Code Starts.
+string order;
+bool f(string a, string b) {
+    int p1 = 0;
+    int p2 = 0;
+    for (int i = 0; i < min(a.size(), b.size()) and p1 == p2; i++) {
+        p1 = order.find(a[i]);
+        p2 = order.find(b[i]);
+        //	cout<<p1<<" "<<p2<<endl;
+    }
+
+    if (p1 == p2 and a.size() != b.size()) return a.size() < b.size();
+
+    return p1 < p2;
+}
+
+// Driver program to test above functions
+int main() {
+    int t;
+    cin >> t;
+    while (t--) {
+        int N, K;
+        cin >> N >> K;
+        string dict[N];
+        for (int i = 0; i < N; i++) cin >> dict[i];
+        
+        Solution obj;
+        string ans = obj.findOrder(dict, N, K);
+        order = "";
+        for (int i = 0; i < ans.size(); i++) order += ans[i];
+
+        string temp[N];
+        std::copy(dict, dict + N, temp);
+        sort(temp, temp + N, f);
+
+        bool f = true;
+        for (int i = 0; i < N; i++)
+            if (dict[i] != temp[i]) f = false;
+
+        if(f)cout << 1;
+        else cout << 0;
+        cout << endl;
+    }
+    return 0;
+}
+
+// } Driver Code Ends