p5 done

Author: sspathare97

commands.sh

@@ -7,6 +7,8 @@ for i in {0..2} ; do g++ s.cpp && ./a.out < "../test-cases/input/input0${i}.txt"
 
 for i in {3..5} ; do g++ m.cpp && ./a.out > "../test-cases/input/input0${i}.txt"; sleep 1; done
 for i in {6..8} ; do g++ m.cpp && ./a.out > "../test-cases/input/input0${i}.txt"; sleep 1; done
+for i in {3..5} ; do g++ s.cpp && ./a.out < "../test-cases/input/input0${i}.txt" > "../test-cases/output/output0${i}.txt" ; done
+for i in {6..8} ; do g++ s.cpp && ./a.out < "../test-cases/input/input0${i}.txt" > "../test-cases/output/output0${i}.txt" ; done
 for i in {3..8} ; do g++ s.cpp && ./a.out < "../test-cases/input/input0${i}.txt" > "../test-cases/output/output0${i}.txt" ; done
 
 g++ s.cpp && ./a.out < "../test-cases/input/input00.txt" > "../test-cases/output/output00.txt"

problem-3/author-solutions/b.py

@@ -7,6 +7,7 @@ def isBalanced(x):
     leftSum += ord(s[i]) - ord('0')
     rightSum += ord(s[n -1 -i]) - ord('0')
   return leftSum == rightSum
+
 n = int(input())
 v = [int(x) for x in input().split()]
 count = 0

problem-5/author-solutions/.gitkeep

@@ -0,0 +1,37 @@
+#include<iostream>
+using namespace std;
+struct Node {
+  Node* children[26]{};
+};
+void insert(Node* root, string s) {
+  for (int i=0; s[i]; i++) {
+    int idx = s[i] - 'a';
+    if (!root->children[idx]) {
+      root->children[idx] = new Node();
+    }
+    root = root->children[idx];
+  }
+}
+void solve(Node* root, string& s) {
+  bool leaf = true;
+  for(int idx=0; idx<26; idx++) {
+    if (root->children[idx]) {
+      leaf = false;
+      s.push_back('a' + idx);
+      solve(root->children[idx], s);
+      s.pop_back();
+    }
+  }
+  if (leaf) cout << s << '\n';
+}
+int main(void) {
+  int n; cin >> n;
+  Node* root = new Node();
+  for (int i=0; i<n; i++) {
+    string s; cin >> s;
+    insert(root, s);
+  }
+  string s;
+  solve(root, s);
+  return 0;
+}

problem-5/author-solutions/s.cpp

@@ -0,0 +1,49 @@
+import java.io.*;
+import java.util.*;
+
+public class Solution {
+  static class Node {
+    Node[] children;
+    Node() {
+      children = new Node[26];
+      for(int idx=0; idx<26; idx++) {
+        children[idx] = null;
+      }
+    }
+  }
+  
+  static void insert(Node root, String s) {
+    int n = s.length();
+    for (int i=0; i < n; i++) {
+      int idx = (int)(s.charAt(i) - 'a');
+      if (root.children[idx] == null) {
+        root.children[idx] = new Node();
+      }
+      root = root.children[idx];
+    }
+  }
+  static void solve(Node root, StringBuffer s) {
+    boolean leaf = true;
+    for(int idx=0; idx<26; idx++) {
+      if (root.children[idx] != null) {
+        leaf = false;
+        s.append((char)('a' + idx));
+        solve(root.children[idx], s);
+        s.deleteCharAt(s.length() - 1);
+      }
+    }
+    if (leaf) System.out.println(s);
+  }
+
+  public static void main(String[] args) {
+    Scanner sc=new Scanner(System.in);  
+    int n=sc.nextInt();
+    Node root = new Node();
+    for (int i=0; i<n; i++) {
+      String s = sc.next();
+      insert(root, s);
+    }
+    StringBuffer s = new StringBuffer();
+    solve(root, s);
+  }
+}

problem-5/author-solutions/s.java

@@ -0,0 +1,30 @@
+class Node:
+  def __init__(self):
+    self.children = [None for _ in range(26)]
+
+def insert(root, s):
+  for i in range(len(s)):
+    idx = ord(s[i]) - ord('a')
+    if (root.children[idx] is None):
+      root.children[idx] = Node()
+    root = root.children[idx]
+
+def solve(root, s):
+  leaf = True
+  for idx in range(26):
+    if (root.children[idx] is not None):
+      leaf = False
+      s.append(chr(ord('a') + idx))
+      solve(root.children[idx], s)
+      s.pop()
+  if (leaf):
+    print(''.join(s))
+
+n = int(input())
+root = Node()
+for i in range(n):
+  s = input()
+  insert(root, s)
+
+s = []
+solve(root, s)

problem-5/author-solutions/s.py

@@ -0,0 +1,40 @@
+**Challenge Name**  
+Experiment on Word Properties
+
+**Description**  
+Remove words whose properties are already present in some other words
+
+**Problem Statement**  
+The Vice Chair of [CS-GPDC](https://www.linkedin.com/company/cs-gpdc), [Sachin](https://www.linkedin.com/in/sachin-sharma-cu/), is running an experiment to study the properties of words. A word is a sequence of letters, $W = L_1 ... L_N$ of length $N$, and has $N$ properties. Through his previous experiments, Sachin has already established that when a new letter $L$ is added to a word $W_0$ of length $N$ to form a new word $W_1 = concat(W_0, L)$ of length $(N+1)$, it retains the original $N$ properties of the original word $W_0$, and gains a new $(N+1)^{th}$ unique property generated by the concatenation of $W_0$ and $L$. Sachin wants to analyze all the properties of words in a given list. However, since the properties of some of the words are already present in some other words, he wants you to filter out such words from the given list and generate the final list of words in ascending order.
+
+**Sample Example**  
+
+```text
+5
+app
+banana
+a
+apple
+abc
+```
+
+The properties of the word **app** are already present in **apple**; hence, we filter it out.  
+The properties of the word **banana** are not present in any of the words in the list; hence, we keep it.  
+The properties of the word **a** are already present in **app** and **apple**; hence, we filter it out.  
+The properties of the word **apple** are not present in any of the words in the list; hence, we keep it.  
+The properties of the word **abc** are not present in any of the words in the list; hence, we keep it.  
+
+Hence, we print each word on a new line from the final list of words {**banana**, **apple**, **abc**} in ascending order {**abc**, **apple**, **banana**}.
+
+**Input Format**  
+The first line contains an integer $N$, the number of words.  
+The next $N$ lines contain one word $W$ on each line.
+
+**Constraints**  
+$1 \leq N \leq 10^5$  
+$1 \leq W.length \leq 10^5$  
+$1 \leq \sum W.length \leq 2 \times 10^7$  
+$W$ consists of lowercase English letters only  
+
+**Output Format**  
+Print each word on a new line from the final list of words in ascending order

problem-5/statement.tex

@@ -0,0 +1,44 @@
+#include<iostream>
+#include<unordered_set>
+#include<vector>
+#include<cmath>
+#include<algorithm>
+using namespace std;
+typedef long long ll;
+float getRandFloat() {
+  return static_cast <float> (rand()) / static_cast <float> (RAND_MAX);
+}
+ll getRand(ll min, ll max) {
+  return min + static_cast <ll>( getRandFloat() * ( max - min + 1 ) );
+}
+string getRand(int n) {
+  string s;
+  for (int i=0; i<n; i++) s.push_back('a' + getRand(0, 25));
+  return s;
+}
+int main(void) {
+  srand(time(NULL));
+  ll n = 300; // 300, 1e5
+  cout << n <<'\n';
+  ll first = sqrt(n);
+  vector<string> v;
+  unordered_set<string> s;
+  while (s.size() < first) {
+    int sn = getRand(1, first);
+    string t = getRand(sn);
+    if (s.count(t)) continue;
+    s.insert(t);
+    v.push_back(t);
+  }
+  while (s.size() < n) {
+    int si = getRand(0, v.size()-1);
+    int ci = getRand(1, first);
+    string t = v[si] + (char)('a' + getRand(0, 25));
+    if (s.count(t)) continue;
+    s.insert(t);
+    v.push_back(t);
+  }
+  random_shuffle(v.begin(), v.end());
+  for(int i=0; i<n; i++) cout << v[i] << '\n';
+  return 0;
+}

problem-5/test-case-generator/.gitkeep

@@ -0,0 +1,6 @@
+5
+app
+banana
+a
+apple
+abc

problem-5/test-case-generator/m.cpp

@@ -0,0 +1,5 @@
+4
+cat
+car
+do
+dog

problem-5/test-cases/input/input00.txt

@@ -0,0 +1,5 @@
+4
+you
+are
+almost
+there