[ { "path": ".vscode/settings.json", "content": "{\n \"files.associations\": {\n \"ostream\": \"cpp\",\n \"array\": \"cpp\",\n \"atomic\": \"cpp\",\n \"*.tcc\": \"cpp\",\n \"bitset\": \"cpp\",\n \"cctype\": \"cpp\",\n \"cfenv\": \"cpp\",\n \"charconv\": \"cpp\",\n \"chrono\": \"cpp\",\n \"cinttypes\": \"cpp\",\n \"clocale\": \"cpp\",\n \"cmath\": \"cpp\",\n \"codecvt\": \"cpp\",\n \"complex\": \"cpp\",\n \"condition_variable\": \"cpp\",\n \"csetjmp\": \"cpp\",\n \"csignal\": \"cpp\",\n \"cstdarg\": \"cpp\",\n \"cstddef\": \"cpp\",\n \"cstdint\": \"cpp\",\n \"cstdio\": \"cpp\",\n \"cstdlib\": \"cpp\",\n \"cstring\": \"cpp\",\n \"ctime\": \"cpp\",\n \"cuchar\": \"cpp\",\n \"cwchar\": \"cpp\",\n \"cwctype\": \"cpp\",\n \"deque\": \"cpp\",\n \"forward_list\": \"cpp\",\n \"list\": \"cpp\",\n \"unordered_map\": \"cpp\",\n \"unordered_set\": \"cpp\",\n \"vector\": \"cpp\",\n \"exception\": \"cpp\",\n \"algorithm\": \"cpp\",\n \"functional\": \"cpp\",\n \"iterator\": \"cpp\",\n \"map\": \"cpp\",\n \"memory\": \"cpp\",\n \"memory_resource\": \"cpp\",\n \"numeric\": \"cpp\",\n \"optional\": \"cpp\",\n \"random\": \"cpp\",\n \"ratio\": \"cpp\",\n \"regex\": \"cpp\",\n \"set\": \"cpp\",\n \"string\": \"cpp\",\n \"string_view\": \"cpp\",\n \"system_error\": \"cpp\",\n \"tuple\": \"cpp\",\n \"type_traits\": \"cpp\",\n \"utility\": \"cpp\",\n \"fstream\": \"cpp\",\n \"future\": \"cpp\",\n \"initializer_list\": \"cpp\",\n \"iomanip\": \"cpp\",\n \"iosfwd\": \"cpp\",\n \"iostream\": \"cpp\",\n \"istream\": \"cpp\",\n \"limits\": \"cpp\",\n \"mutex\": \"cpp\",\n \"new\": \"cpp\",\n \"scoped_allocator\": \"cpp\",\n \"shared_mutex\": \"cpp\",\n \"sstream\": \"cpp\",\n \"stdexcept\": \"cpp\",\n \"streambuf\": \"cpp\",\n \"thread\": \"cpp\",\n \"typeindex\": \"cpp\",\n \"typeinfo\": \"cpp\",\n \"valarray\": \"cpp\"\n }\n}" }, { "path": "06 MAY SHIFT 1/MAJORITY ELEMENT/code.cpp", "content": "#include \n#include \n#include \n#include \n\nusing namespace std;\n\nvoid findMajorityElement(vector& arr, int N) {\n unordered_map freq;\n for (string& n : arr) {\n if (freq.find(n) != freq.end()) {\n freq[n]++;\n } else {\n freq[n] = 1;\n }\n }\n for (auto& it : freq) {\n if (it.second >= N / 3) {\n cout << it.first << \" \";\n }\n }\n}\n\nvoid findMajorityElementInt(vector& arr, int N) {\n unordered_map freq;\n for (int& num : arr) {\n if (freq.find(num) != freq.end()) {\n freq[num]++;\n } else {\n freq[num] = 1;\n }\n }\n for (auto& it : freq) {\n if (it.second >= N / 3) {\n cout << it.first << \" \";\n }\n }\n}\n\nvoid input_array_format() {\n cout << \"\\nEnter elements in format [e1,e2,e3]: \";\n string input;\n getline(cin, input);\n stringstream ss(input);\n string token;\n vector arr;\n while (getline(ss, token, ',')) {\n arr.push_back(token);\n }\n findMajorityElement(arr, arr.size());\n}\n\nvoid input_space_separated() {\n cout << \"\\nCase 2: Enter space-separated elements: \";\n string input;\n getline(cin, input);\n stringstream ss(input);\n int num;\n vector arr;\n while (ss >> num) {\n arr.push_back(num);\n }\n findMajorityElementInt(arr, arr.size());\n}\n\nint main() {\n input_array_format();\n input_space_separated();\n return 0;\n}\n" }, { "path": "06 MAY SHIFT 1/MAJORITY ELEMENT/code.java", "content": "import java.util.HashMap;\nimport java.util.Scanner;\n\npublic class MajorityElement {\n\n public static void findMajorityElement(String[] arr, int N) {\n HashMap freq = new HashMap<>();\n for (String n : arr) {\n if (freq.containsKey(n)) {\n freq.put(n, freq.get(n) + 1);\n } else {\n freq.put(n, 1);\n }\n }\n for (String key : freq.keySet()) {\n if (freq.get(key) >= N / 3) {\n System.out.print(key + \" \");\n }\n }\n }\n\n public static void findMajorityElementInt(int[] arr, int N) {\n HashMap freq = new HashMap<>();\n for (int num : arr) {\n if (freq.containsKey(num)) {\n freq.put(num, freq.get(num) + 1);\n } else {\n freq.put(num, 1);\n }\n }\n for (int key : freq.keySet()) {\n if (freq.get(key) >= N / 3) {\n System.out.print(key + \" \");\n }\n }\n }\n\n public static void inputArrayFormat() {\n Scanner scanner = new Scanner(System.in);\n System.out.print(\"\\nEnter elements in format [e1,e2,e3]: \");\n String input = scanner.nextLine().replaceAll(\"[\\\\[\\\\]]\", \"\");\n String[] arr = input.split(\",\");\n findMajorityElement(arr, arr.length);\n }\n\n public static void inputSpaceSeparated() {\n Scanner scanner = new Scanner(System.in);\n System.out.print(\"\\nCase 2: Enter space-separated elements: \");\n String input = scanner.nextLine();\n String[] strArr = input.split(\"\\\\s+\");\n int[] arr = new int[strArr.length];\n for (int i = 0; i < strArr.length; i++) {\n arr[i] = Integer.parseInt(strArr[i]);\n }\n findMajorityElementInt(arr, arr.length);\n }\n\n public static void main(String[] args) {\n inputArrayFormat();\n inputSpaceSeparated();\n }\n}\n" }, { "path": "06 MAY SHIFT 1/MAJORITY ELEMENT/code.py", "content": "def findMajorityElement(arr, N):\n freq = {}\n for n in arr:\n num = int(n)\n if num in freq:\n freq[num] += 1 \n else:\n freq[num] = 1\n for key, val in freq.items():\n if val >= N // 3:\n print(key, end=\" \")\n\n\ndef findMajorityElementInt(arr, N):\n freq = {}\n for num in arr:\n if num in freq:\n freq[num] += 1 \n else:\n freq[num] = 1\n for key, val in freq.items():\n if val >= N // 3:\n print(key, end=\" \")\n \n\ndef input_array_format():\n print(\"\\n[e1,e2,e3]\")\n arr = list(map(str, input().strip(\"[]\").split(',')))\n findMajorityElement(arr, len(arr))\n\ndef input_space_separated():\n print(\"\\nCase 2: space separated\")\n arr = list(map(int, input().split()))\n findMajorityElementInt(arr, len(arr))\n\n\ninput_array_format()\ninput_space_separated()" }, { "path": "06 MAY SHIFT 1/SORT NUMBERS/code.cpp", "content": "#include \n#include \n\nusing namespace std;\n\nvector sortBySwap(vector& arr, int N) {\n int left = 0;\n int mid = 0;\n int right = N - 1;\n while (mid <= right) {\n if (arr[mid] == '3') {\n swap(arr[left], arr[mid]);\n left++;\n mid++;\n } else if (arr[mid] == '6') {\n mid++;\n } else if (arr[mid] == '7') {\n swap(arr[right], arr[mid]);\n right--;\n }\n }\n return arr;\n}\n\nint main() {\n cout << \"\\nEnter space-separated elements: \";\n vector arr;\n char c;\n while (cin >> c) {\n arr.push_back(c);\n }\n arr = sortBySwap(arr, arr.size());\n for (char c : arr) {\n cout << c << \" \";\n }\n return 0;\n}\n" }, { "path": "06 MAY SHIFT 1/SORT NUMBERS/code.java", "content": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class SortBySwap {\n\n public static List sortBySwap(char[] arr, int N) {\n int left = 0;\n int mid = 0;\n int right = N - 1;\n while (mid <= right) {\n if (arr[mid] == '3') {\n char temp = arr[left];\n arr[left] = arr[mid];\n arr[mid] = temp;\n left++;\n mid++;\n } else if (arr[mid] == '6') {\n mid++;\n } else if (arr[mid] == '7') {\n char temp = arr[right];\n arr[right] = arr[mid];\n arr[mid] = temp;\n right--;\n }\n }\n List result = new ArrayList<>();\n for (char c : arr) {\n result.add(c);\n }\n return result;\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n System.out.print(\"\\nEnter space-separated elements: \");\n String input = scanner.nextLine();\n char[] arr = input.toCharArray();\n List sortedArr = sortBySwap(arr, arr.length);\n for (char c : sortedArr) {\n System.out.print(c + \" \");\n }\n }\n}\n" }, { "path": "06 MAY SHIFT 1/SORT NUMBERS/code.py", "content": "def sortBySwap(arr, N):\n left = 0\n mid = 0 \n right = N - 1 \n while mid <= right:\n if arr[mid] == '3':\n arr[left], arr[mid] = arr[mid], arr[left]\n left += 1\n mid += 1\n \n elif arr[mid] == '6':\n mid += 1\n\n elif arr[mid] == '7':\n arr[right], arr[mid] = arr[mid], arr[right]\n right -= 1\n return arr \n\nprint(\"\\nSpace separated\")\narr = list(map(str, input().split()))\nprint(*sortBySwap(arr, len(arr)))\n\n\n" }, { "path": "06 MAY SHIFT 2/Missing number/code.cpp", "content": "#include \n#include \n#include \n\nusing namespace std;\n\nint getMissingNumIntFormat(vector& arr, int size) {\n int totalSum = 0;\n int n = size + 1;\n for (int num : arr) {\n totalSum += num;\n }\n int actualSum = (n * (n + 1)) / 2;\n return actualSum - totalSum;\n}\n\nint getMissingNumStrFormat(vector& arr, int size) {\n int totalSum = 0;\n int n = size + 1;\n for (auto str : arr) {\n int num = stoi(str); // Convert string to integer using stoi\n totalSum += num;\n }\n int actualSum = (n * (n + 1)) / 2;\n return actualSum - totalSum;\n}\n\n\n\n\nvoid input_space_separated() {\n cout << \"\\nEnter space-separated elements: \";\n int N; \n cin >> N;\n cin.ignore(); \n string input;\n getline(cin, input);\n stringstream ss(input);\n int num;\n vector arr;\n while (ss >> num) { \n arr.push_back(num);\n }\n cout << \"Missing number: \" << getMissingNumIntFormat(arr, N) << endl;\n}\n\n\nvoid input_array_format() {\n cout << \"\\nEnter elements in format e1,e2,e3: \";\n string input;\n int N; cin >> N;\n cin.ignore(); \n getline(cin, input);\n stringstream ss(input);\n string token;\n vector arr;\n while (getline(ss, token, ',')) {\n arr.push_back(token);\n }\n cout << \"Missing number: \" << getMissingNumStrFormat(arr, N) << endl;\n}\n\nint main() {\n input_space_separated();\n input_array_format();\n return 0;\n}\n" }, { "path": "06 MAY SHIFT 2/Missing number/code.java", "content": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static int getMissingNumIntFormat(List arr, int size) {\n int totalSum = 0;\n int n = size + 1;\n for (int num : arr) {\n totalSum += num;\n }\n int actualSum = (n * (n + 1)) / 2;\n return actualSum - totalSum;\n }\n\n public static int getMissingNumStrFormat(List arr, int size) {\n int totalSum = 0;\n int n = size + 1;\n for (String str : arr) {\n int num = Integer.parseInt(str);\n totalSum += num;\n }\n int actualSum = (n * (n + 1)) / 2;\n return actualSum - totalSum;\n }\n\n public static void input_space_separated() {\n Scanner scanner = new Scanner(System.in);\n System.out.print(\"\\nEnter space-separated elements: \");\n int N = scanner.nextInt();\n scanner.nextLine(); // Consume the newline character left in the input buffer\n String input = scanner.nextLine();\n Scanner ss = new Scanner(input);\n List arr = new ArrayList<>();\n while (ss.hasNextInt()) {\n arr.add(ss.nextInt());\n }\n System.out.println(\"Missing number: \" + getMissingNumIntFormat(arr, N));\n }\n\n public static void input_array_format() {\n Scanner scanner = new Scanner(System.in);\n System.out.print(\"\\nEnter elements in format e1,e2,e3: \");\n int N = scanner.nextInt();\n scanner.nextLine(); \n String input = scanner.nextLine();\n String[] tokens = input.split(\",\");\n List arr = new ArrayList<>();\n for (String token : tokens) {\n arr.add(token);\n }\n System.out.println(\"Missing number: \" + getMissingNumStrFormat(arr, N));\n }\n\n public static void main(String[] args) {\n input_space_separated();\n input_array_format();\n }\n}\n" }, { "path": "06 MAY SHIFT 2/Missing number/code.py", "content": "def getMissingNumIntFormat(arr, size):\n totalSum = 0\n n = size + 1\n for num in arr:\n totalSum += num \n \n actualSum = int((n * (n + 1) )/ 2)\n return actualSum - totalSum\n\n\ndef intFormat():\n N = int(input())\n arr = list(map(int, input().split()))\n print(getMissingNumIntFormat(arr, N))\n\ndef getMissingNumStrFormat(arr, size):\n totalSum = 0\n for num_str in arr: \n num = int(num_str)\n totalSum += num \n n = size + 1\n actualSum = int((n * (n + 1)) / 2)\n return actualSum - totalSum\n\ndef strFormat():\n N = int(input())\n arr = list(map(str, input().split(',')))\n print(getMissingNumStrFormat(arr, N))\n\n\nintFormat()\nstrFormat()" }, { "path": "06 MAY SHIFT 2/Prime number/code.cpp", "content": "#include \n\nusing namespace std;\n\nbool isPrime(int number) {\n if (number <= 1) { // 1 and below are not prime\n return false;\n }\n if (number <= 3) { // 2 and 3 are prime\n return true;\n }\n if (number % 2 == 0 || number % 3 == 0) { // Eliminate multiples of 2 and 3\n return false;\n }\n\n // Check divisibility by numbers of the form 6k ± 1, up to sqrt(n)\n int i = 5;\n while (i * i <= number) {\n if (number % i == 0 || number % (i + 2) == 0) {\n return false;\n }\n i += 6;\n }\n return true;\n}\n\nbool calculateSum(int n) {\n int sum = 0;\n while (n > 0) {\n int num = n % 10;\n sum += num;\n n /= 10;\n }\n return isPrime(sum);\n}\n\nint main() {\n int n, m;\n cin >> n >> m;\n for (int i = n; i <= m; i++) {\n if (isPrime(i) && calculateSum(i)) {\n cout << i << endl;\n }\n }\n return 0;\n}\n" }, { "path": "06 MAY SHIFT 2/Prime number/code.java", "content": "import java.util.Scanner;\n\npublic class Main {\n\n public static boolean isPrime(int number) {\n if (number <= 1) { // 1 and below are not prime\n return false;\n }\n if (number <= 3) { // 2 and 3 are prime\n return true;\n }\n if (number % 2 == 0 || number % 3 == 0) { // Eliminate multiples of 2 and 3\n return false;\n }\n\n // Check divisibility by numbers of the form 6k ± 1, up to sqrt(n)\n int i = 5;\n while (i * i <= number) {\n if (number % i == 0 || number % (i + 2) == 0) {\n return false;\n }\n i += 6;\n }\n return true;\n }\n\n public static boolean calculateSum(int n) {\n int sum = 0;\n while (n > 0) {\n int num = n % 10;\n sum += num;\n n /= 10;\n }\n return isPrime(sum);\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n int m = scanner.nextInt();\n for (int i = n; i <= m; i++) {S\n if (isPrime(i) && calculateSum(i)) {\n System.out.println(i);\n }\n }\n }\n}\n" }, { "path": "06 MAY SHIFT 2/Prime number/code.py", "content": "def isPrime(number):\n if number <= 1: \n return False\n if number <= 3:\n return True\n if number % 2 == 0 or number % 3 == 0:\n return False\n i = 5\n while i * i <= number:\n if number % i == 0 or number % (i + 2) == 0:\n return False\n i += 6\n return True\n\ndef calculateSum(n):\n sum = 0\n while n > 0:\n num = n % 10 \n sum += num \n n /= 10\n if isPrime(sum):\n return True\n else:\n return False\n \nn, m = map(int, input().split())\nfor i in range(n, m+1):\n if isPrime(i) and calculateSum(i):\n print(i)\n " }, { "path": "08 MAY SHIFT 2/SequenceQuestion/code.cpp", "content": "#include \nusing namespace std;\n\nbool is_positive_integer(const string& str) {\n for (char c : str) {\n if (!isdigit(c)) {\n return false;\n }\n }\n return !str.empty() && stoi(str) > 0;\n}\n\nvector generate_sequence(int n) {\n vector sequence;\n sequence.push_back(n);\n while (n != 1) {\n if (n % 2 == 0)\n n /= 2;\n else\n n = 3 * n + 1;\n sequence.push_back(n);\n }\n return sequence;\n}\n\npair max_length_of_sequence_and_k(int n) {\n int maxLen = 0, kValue = 0;\n for (int i = 1; i <= n; ++i) {\n vector sequence = generate_sequence(i);\n int currLen = sequence.size();\n if (currLen > maxLen) {\n maxLen = currLen;\n kValue = i;\n }\n }\n return make_pair(maxLen, kValue);\n}\n\npair max_sequence_value_and_k(int n) {\n int max_k = 0, max_val = 0;\n for (int k = 1; k <= n; ++k) {\n vector sequence = generate_sequence(k);\n int max_val_k = *max_element(sequence.begin(), sequence.end());\n if (max_val_k > max_val) {\n max_val = max_val_k;\n max_k = k;\n }\n }\n return make_pair(max_val, max_k);\n}\n\nint main() {\n string n_str;\n cin >> n_str;\n if (is_positive_integer(n_str)) {\n int n = stoi(n_str);\n vector sequence = generate_sequence(n);\n auto max_val_k = max_sequence_value_and_k(n);\n auto maxLen_kValue = max_length_of_sequence_and_k(n);\n cout << \"Sequence: [\";\n for (size_t i = 0; i < sequence.size(); ++i) {\n cout << sequence[i];\n if (i != sequence.size() - 1) {\n cout << \", \";\n }\n }\n cout << \"]\" << endl;\n cout << maxLen_kValue.first << \" \" << maxLen_kValue.second << endl;\n cout << max_val_k.first << \" \" << max_val_k.second << endl;\n } else {\n cout << \"Error!\" << endl;\n }\n return 0;\n}\n\n" }, { "path": "08 MAY SHIFT 2/SequenceQuestion/code.java", "content": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n public static boolean isPositiveInteger(String str) {\n for (char c : str.toCharArray()) {\n if (!Character.isDigit(c)) {\n return false;\n }\n }\n return !str.isEmpty() && Integer.parseInt(str) > 0;\n }\n\n public static List generateSequence(int n) {\n List sequence = new ArrayList<>();\n sequence.add(n);\n while (n != 1) {\n if (n % 2 == 0)\n n /= 2;\n else\n n = 3 * n + 1;\n sequence.add(n);\n }\n return sequence;\n }\n\n public static int[] maxLengthOfSequenceAndK(int n) {\n int maxLen = 0, kValue = 0;\n for (int i = 1; i <= n; i++) {\n List sequence = generateSequence(i);\n int currLen = sequence.size();\n if (currLen > maxLen) {\n maxLen = currLen;\n kValue = i;\n }\n }\n return new int[]{maxLen, kValue};\n }\n\n public static int[] maxSequenceValueAndK(int n) {\n int max_k = 0, max_val = 0;\n for (int k = 1; k <= n; k++) {\n List sequence = generateSequence(k);\n int max_val_k = sequence.stream().mapToInt(Integer::intValue).max().orElse(Integer.MIN_VALUE);\n if (max_val_k > max_val) {\n max_val = max_val_k;\n max_k = k;\n }\n }\n return new int[]{max_val, max_k};\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String n_str = scanner.nextLine();\n scanner.close();\n if (isPositiveInteger(n_str)) {\n int n = Integer.parseInt(n_str);\n List sequence = generateSequence(n);\n int[] max_val_k = maxSequenceValueAndK(n);\n int[] maxLen_kValue = maxLengthOfSequenceAndK(n);\n System.out.print(\"Sequence: [\");\n for (int i = 0; i < sequence.size(); i++) {\n System.out.print(sequence.get(i));\n if (i != sequence.size() - 1) {\n System.out.print(\", \");\n }\n }\n System.out.println(\"]\");\n System.out.println(maxLen_kValue[0] + \" \" + maxLen_kValue[1]);\n System.out.println(max_val_k[0] + \" \" + max_val_k[1]);\n } else {\n System.out.println(\"Error!\");\n }\n }\n}\n" }, { "path": "08 MAY SHIFT 2/SequenceQuestion/code.py", "content": "def generate_sequence(n):\n sequence = [n]\n while n != 1:\n if n % 2 == 0:\n n //= 2\n else:\n n = 3 * n + 1\n sequence.append(n)\n return sequence\n\n\ndef max_length_of_sequence_and_k(n):\n maxLen = 0\n kValue = 0\n for i in range(1, n+1):\n sequence = generate_sequence(i)\n currLen = len(sequence)\n if currLen > maxLen:\n maxLen = currLen\n kValue = i \n return maxLen, kValue\n\n\ndef max_sequence_value_and_k(n):\n max_k = 0\n max_val = 0\n for k in range(1, n + 1):\n sequence = generate_sequence(k)\n max_val_k = max(sequence)\n if max_val_k > max_val:\n max_val = max_val_k\n max_k = k\n return max_val, max_k\n\n\nnum = input()\nif num.isdigit() and int(num) > 0:\n n = int(num)\n sequence = generate_sequence(n)\n max_val, max_k = max_sequence_value_and_k(n)\n max_length_of_sequence, k_value = max_length_of_sequence_and_k(n)\n print(sequence)\n print(max_length_of_sequence, k_value)\n print(max_val, max_k)\nelse:\n print(\"Error!\")\n" }, { "path": "08 MAY SHIFT 2/fiveThree Program/code.cpp", "content": "#include \n\nusing namespace std;\n\nvoid solve(vector& arr) {\n stringstream result;\n for (auto n : arr) {\n int num = stoi(n);\n if (num % 3 == 0 && num % 5 == 0) {\n cout << \"ThreeFive \" << \" \";\n } else if (num % 5 == 0) {\n cout << \"Five \"<< \" \";\n } else if (num % 3 == 0) {\n cout << \"Three \"<< \" \";\n } else {\n cout << num << \" \";\n }\n }\n}\n\nvoid input_array_format1() {\n int n; cin >> n;\n cin.ignore(); \n string input;\n getline(cin, input);\n input.erase(remove(input.begin(), input.end(), '['), input.end()); // Remove '['\n input.erase(remove(input.begin(), input.end(), ']'), input.end()); // Remove ']'\n stringstream ss(input);\n vector arr1;\n string element;\n while (ss >> element) { // Read elements separated by space\n arr1.push_back(element);\n }\n solve(arr1); // Print the result\n}\n\nint main() {\n input_array_format1();\n return 0;\n}\n" }, { "path": "08 MAY SHIFT 2/fiveThree Program/code.java", "content": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\nimport java.util.StringJoiner;\n\npublic class Main {\n public static String solve(List arr) {\n StringBuilder result = new StringBuilder();\n for (String n : arr) {\n int num = Integer.parseInt(n);\n if (num % 3 == 0 && num % 5 == 0) {\n result.append(\"ThreeFive \");\n } else if (num % 5 == 0) {\n result.append(\"Five \");\n } else if (num % 3 == 0) {\n result.append(\"Three \");\n } else {\n result.append(num).append(\" \");\n }\n }\n return result.toString();\n }\n\n public static void inputArrayFormat1() {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n scanner.nextLine(); // Consume the newline character\n String input = scanner.nextLine();\n input = input.replaceAll(\"[\\\\[\\\\]]\", \"\"); // Remove '[' and ']'\n String[] elements = input.split(\"\\\\s+\");\n List arr = new ArrayList<>();\n for (String element : elements) {\n arr.add(element);\n }\n System.out.println(solve(arr)); // Print the result\n scanner.close();\n }\n\n public static void main(String[] args) {\n inputArrayFormat1();\n }\n}\n" }, { "path": "08 MAY SHIFT 2/fiveThree Program/code.py", "content": "def solve(arr, N):\n result = []\n for num in arr:\n if num % 3 == 0 and num % 5 == 0:\n print(\"ThreeFive\", end = \" \")\n elif num % 5 == 0:\n print(\"Five\", end = \" \")\n elif num % 3 == 0:\n print(\"Three\", end = \" \")\n else:\n print(num, end = \" \")\n\ndef input_array_format1():\n N = int(input())\n arr = list(map(int, input().strip('[]').split()))\n solve(arr,N)\n\ninput_array_format1()" }, { "path": "09 MAY 2024 SHIFT - 1/Armstrong Number/code.cpp", "content": "#include \n#include \n#include \n#include \n\nusing namespace std;\n\nbool isArmStrongNumber(int n, int k) {\n int sum = 0;\n int originalNum = n;\n while (originalNum > 0) {\n int digit = originalNum % 10;\n sum += pow(digit, k);\n originalNum /= 10;\n }\n return sum == n;\n}\n\nint main() {\n string input;\n cout << \"Enter numbers separated by commas: \";\n getline(cin, input);\n vector arr;\n size_t pos = 0;\n while ((pos = input.find(',')) != string::npos) {\n arr.push_back(input.substr(0, pos));\n input.erase(0, pos + 1);\n }\n arr.push_back(input);\n int flag = 0;\n for (string num_str : arr) {\n int num = stoi(num_str);\n int n = num_str.length();\n if (isArmStrongNumber(num, n)) {\n cout << num << \" \";\n flag = 1;\n }\n }\n if (flag == 0) {\n cout << \"No Armstrong numbers present\";\n }\n return 0;\n}\n" }, { "path": "09 MAY 2024 SHIFT - 1/Armstrong Number/code.java", "content": "import java.util.Scanner;\nimport java.util.ArrayList;\n\npublic class ArmstrongNumber {\n static boolean isArmStrongNumber(int n, int k) {\n int sum = 0;\n int originalNum = n;\n while (originalNum > 0) {\n int digit = originalNum % 10;\n sum += Math.pow(digit, k);\n originalNum /= 10;\n }\n return sum == n;\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n System.out.print(\"Enter numbers separated by commas: \");\n String input = scanner.nextLine();\n String[] arr = input.split(\",\");\n ArrayList numbers = new ArrayList<>();\n for (String num : arr) {\n numbers.add(num);\n }\n int flag = 0;\n for (String num_str : numbers) {\n int num = Integer.parseInt(num_str);\n int n = num_str.length();\n if (isArmStrongNumber(num, n)) {\n System.out.print(num + \" \");\n flag = 1;\n }\n }\n if (flag == 0) {\n System.out.print(\"No Armstrong numbers present\");\n }\n scanner.close();\n }\n}\n" }, { "path": "09 MAY 2024 SHIFT - 1/Armstrong Number/code.py", "content": "def isArmStrongNumber(n, k):\n sum = 0\n originalNum = n\n while originalNum > 0:\n digit = originalNum % 10 \n sum += digit ** k \n originalNum //= 10 \n \n if sum == n:\n return True \n return False\n\narr = input(\"Enter numbers separated by commas: \").strip('[]').split(',')\nflag = 0\nfor num_str in arr:\n num = int(num_str)\n n = len(str(num))\n if isArmStrongNumber(num, n):\n print(num, end=\" \")\n flag = 1\nif flag == 0:\n print(\"No Armstrong numbers present\")\n" }, { "path": "09 MAY 2024 SHIFT - 1/print top K students/code.cpp", "content": "#include \n\nusing namespace std;\n\nint main() {\n string s;\n getline(cin, s);\n vector l;\n string token;\n istringstream iss(s);\n while (iss >> token) {\n l.push_back(token);\n }\n int k = stoi(l[0]);\n int N = stoi(l[1]);\n vector> arr;\n\n for (int i = 2; i < l.size(); i += 2) {\n int marks = stoi(l[i]);\n string name = l[i + 1];\n arr.push_back(make_pair(marks, name));\n }\n\n sort(arr.begin(), arr.end(), greater>());\n\n for (int top = 0; top < k && top < arr.size(); top++) {\n cout << arr[top].second << \": \" << arr[top].first << endl;\n }\n\n return 0;\n}\n" }, { "path": "09 MAY 2024 SHIFT - 1/print top K students/code.java", "content": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String s = scanner.nextLine();\n String[] l = s.split(\" \");\n int k = Integer.parseInt(l[0]);\n int N = Integer.parseInt(l[1]);\n List> arr = new ArrayList<>();\n\n for (int i = 2; i < l.length; i += 2) {\n int marks = Integer.parseInt(l[i]);\n String name = l[i + 1];\n arr.add(new Pair<>(marks, name));\n }\n\n Collections.sort(arr, new Comparator>() {\n @Override\n public int compare(Pair o1, Pair o2) {\n return Integer.compare(o2.getKey(), o1.getKey());\n }\n });\n\n for (int top = 0; top < k && top < arr.size(); top++) {\n Pair pair = arr.get(top);\n System.out.println(pair.getValue() + \": \" + pair.getKey());\n }\n }\n}\n" }, { "path": "09 MAY 2024 SHIFT - 1/print top K students/code.py", "content": "s = input()\nl = s.split()\nk, N = int(l[0]), int(l[1])\narr = []\nfor i in range(2, len(l), 2):\n marks, name = int(l[i]), l[i+1]\n arr.append((marks, name))\nsorted_array = sorted(arr, key=lambda x: x[0], reverse=True)\n\nfor top in range(k):\n marks, name = sorted_array[top]\n print(\"{}: {}\".format(name, marks))\n" }, { "path": "14 May Shift 1/Maximum Sum of Subarray/codeCpp.cpp", "content": "#include \n#include \n#include \n#include \n\nusing namespace std;\n\nint main() {\n string input;\n getline(cin, input);\n stringstream ss(input);\n vector nums;\n int num;\n while (ss >> num) {\n nums.push_back(num);\n }\n int maxSum = nums[0];\n int currentSum = 0;\n for (int i = 0; i < nums.size(); ++i) {\n currentSum += nums[i];\n if (currentSum > maxSum) {\n maxSum = max(currentSum, maxSum);\n }\n if (currentSum < 0) {\n currentSum = 0;\n }\n }\n cout << maxSum << endl;\n return 0;\n}\n" }, { "path": "14 May Shift 1/Maximum Sum of Subarray/codeJava.java", "content": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String[] strNums = scanner.nextLine().split(\" \");\n int[] nums = new int[strNums.length];\n for (int i = 0; i < nums.length; i++) {\n nums[i] = Integer.parseInt(strNums[i]);\n }\n int maxSum = nums[0];\n int currentSum = 0;\n for (int i = 0; i < nums.length; i++) {\n currentSum += nums[i];\n if (currentSum > maxSum) {\n maxSum = Math.max(currentSum, maxSum);\n }\n if (currentSum < 0) {\n currentSum = 0;\n }\n }\n System.out.println(maxSum);\n }\n}\n" }, { "path": "14 May Shift 1/Maximum Sum of Subarray/codePy.py", "content": "nums = list(map(int, input().split()))\nmaxSum = nums[0]\ncurrentSum = 0\nfor i in range(len(nums)):\n currentSum += nums[i]\n if currentSum > maxSum:\n maxSum = max(currentSum, maxSum)\n if currentSum < 0:\n currentSum = 0\nprint(maxSum)" }, { "path": "14 May Shift 1/Sum of unique elements/codeCpp.cpp", "content": "#include \n#include \n#include \n#include \n\nusing namespace std;\n\nint main() {\n string input;\n getline(cin, input);\n stringstream ss(input);\n vector nums;\n int num;\n while (ss >> num) {\n nums.push_back(num);\n }\n unordered_map d;\n for (int i = 0; i < nums.size(); ++i) {\n if (d.find(nums[i]) == d.end()) {\n d[nums[i]] = 1;\n } else {\n d[nums[i]]++;\n }\n }\n int ans = 0;\n for (auto it: d) {\n if (it.second == 1) {\n ans += it.first;\n }\n }\n cout << ans << endl;\n return 0;\n}\n" }, { "path": "14 May Shift 1/Sum of unique elements/codeJava.java", "content": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String[] strNums = scanner.nextLine().split(\" \");\n int[] nums = new int[strNums.length];\n for (int i = 0; i < nums.length; i++) {\n nums[i] = Integer.parseInt(strNums[i]);\n }\n Map d = new HashMap<>();\n for (int num : nums) {\n if (!d.containsKey(num)) {\n d.put(num, 1);\n } else {\n d.put(num, d.get(num) + 1);\n }\n }\n int ans = 0;\n for (int key : d.keySet()) {\n if (d.get(key) == 1) {\n ans += key;\n }\n }\n System.out.print(ans);\n }\n}\n" }, { "path": "14 May Shift 1/Sum of unique elements/codePy.py", "content": "nums = list(map(int, input().split()))\nd = {}\nfor i in range(len(nums)):\n if nums[i] not in d:\n d[nums[i]] = 1\n else:\n d[nums[i]] += 1\nans = 0\nfor i in d.keys():\n if d[i] == 1:\n ans+=i\nprint(ans)" }, { "path": "14 May Shift 2/Cost of shipping/codeCpp.cpp", "content": "#include \n\ndouble calculate_total_cost(int weight, int distance) {\n double base_money = 5.00;\n double cost_per_kg = 2.00;\n double cost_per_10_km = 0.50;\n \n double weight_cost = weight * cost_per_kg;\n double distance_cost = (distance / 10) * cost_per_10_km;\n \n double total_cost = base_money + weight_cost + distance_cost;\n return total_cost;\n}\n\nint main() {\n int weight, distance;\n \n std::cin >> weight;\n std::cin >> distance;\n \n double total_cost = calculate_total_cost(weight, distance);\n \n char output[50];\n sprintf(output, \"$%.2f\", total_cost);\n \n std::cout << output << std::endl;\n \n return 0;\n}\n" }, { "path": "14 May Shift 2/Cost of shipping/codeJava.java", "content": "import java.util.Scanner;\n\npublic class Main {\n \n public static double calculateTotalCost(int weight, int distance) {\n double baseMoney = 5.00;\n double costPerKg = 2.00;\n double costPer10Km = 0.50;\n \n double weightCost = weight * costPerKg;\n double distanceCost = (distance / 10) * costPer10Km;\n \n double totalCost = baseMoney + weightCost + distanceCost;\n return totalCost;\n }\n \n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n \n int weight = scanner.nextInt();\n int distance = scanner.nextInt();\n \n double totalCost = calculateTotalCost(weight, distance);\n System.out.printf(\"$%.2f%n\", totalCost);\n \n scanner.close();\n }\n}\n" }, { "path": "14 May Shift 2/Cost of shipping/codePy.py", "content": "def calculate_total_cost(weight, distance):\n base_money = 5.00\n cost_per_kg = 2.00\n cost_per_10_km = 0.50\n \n weight_cost = weight * cost_per_kg\n distance_cost = (distance // 10) * cost_per_10_km\n \n total_cost = base_money + weight_cost + distance_cost\n return total_cost\n\n\nweight = int(input())\ndistance = int(input())\n\n\ntotal_cost = calculate_total_cost(weight, distance)\nprint(f\"${total_cost:.2f}\")\n" }, { "path": "14 May Shift 2/Number of Subarray of sum of K/codeCpp.cpp", "content": "#include \nusing namespace std;\n\nint subarraySum(vector& arr, int k) {\n unordered_map mpp;\n mpp[0] = 1;\n int preSum = 0, cnt = 0;\n for (int i = 0; i < arr.size(); ++i) {\n preSum += arr[i];\n int rest = preSum - k;\n cnt += mpp[rest];\n mpp[preSum] += 1;\n }\n return cnt;\n}\n\nint main() {\n string inputLine;\n getline(cin, inputLine);\n istringstream iss(inputLine);\n vector arr;\n int number;\n while (iss >> number) {\n arr.push_back(number);\n }\n\n int k;\n cin >> k;\n\n int result = subarraySum(arr, k);\n cout << result << endl;\n\n return 0;\n}\n" }, { "path": "14 May Shift 2/Number of Subarray of sum of K/codeJava.java", "content": "import java.util.*;\n\npublic class Main {\n\n public static int subarraySum(int[] arr, int k) {\n Map mpp = new HashMap<>();\n mpp.put(0, 1);\n int preSum = 0, cnt = 0;\n\n for (int num : arr) {\n preSum += num;\n int remove = preSum - k;\n cnt += mpp.getOrDefault(remove, 0);\n mpp.put(preSum, mpp.getOrDefault(preSum, 0) + 1);\n }\n\n return cnt;\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n String inputLine = scanner.nextLine();\n String[] inputStrings = inputLine.split(\" \");\n int[] arr = new int[inputStrings.length];\n for (int i = 0; i < inputStrings.length; i++) {\n arr[i] = Integer.parseInt(inputStrings[i]);\n }\n\n\n int k = scanner.nextInt();\n\n int result = subarraySum(arr, k);\n System.out.println(result);\n \n scanner.close();\n }\n}\n" }, { "path": "14 May Shift 2/Number of Subarray of sum of K/codePy.py", "content": "def subarray_sum(arr, k):\n mpp = {0: 1}\n pre_sum = 0\n cnt = 0\n \n for num in arr:\n pre_sum += num\n rest = pre_sum - k\n cnt += mpp.get(rest, 0)\n mpp[pre_sum] = mpp.get(pre_sum, 0) + 1\n \n return cnt\n\n\narr = list(map(int, input().split()))\nk = int(input())\n\nresult = subarray_sum(arr, k)\nprint(result)\n" }, { "path": "26 APRIL 2024 SHIFT - 1/Find subarray equals to target/codeCpp.cpp", "content": "#include \n#include \n#include \nusing namespace std;\n\nvoid bruteForce(vector& arr, int n, int target) {\n for (int i = 0; i < n; i++) {\n int curSum = 0;\n for (int j = i; j < n; j++) {\n curSum += arr[j];\n if (curSum == target) {\n for (int k = i; k <= j; k++) {\n cout << arr[k] << \" \";\n }\n cout << endl;\n }\n }\n }\n}\n\nvoid optimalApproach(vector& arr, int n, int target) {\n unordered_map sumMap;\n int curSum = 0;\n for (int i = 0; i < n; i++) {\n curSum += arr[i];\n if (curSum == target) {\n for (int j = 0; j <= i; j++) {\n cout << arr[j] << \" \";\n }\n cout << endl;\n }\n if (sumMap.find(curSum - target) != sumMap.end()) {\n int startIndex = sumMap[curSum - target] + 1;\n for (int k = startIndex; k <= i; k++) {\n cout << arr[k] << \" \";\n }\n cout << endl;\n }\n sumMap[curSum] = i;\n }\n}\n\nint main() {\n vector arr = {3, 4, -7, 1, 3, 3, 1, -4};\n int N = arr.size();\n int target = 7;\n optimalApproach(arr, N, target);\n return 0;\n}\n" }, { "path": "26 APRIL 2024 SHIFT - 1/Find subarray equals to target/codeJava.java", "content": "import java.util.HashMap;\n\npublic class Main {\n static void bruteForce(int[] arr, int n, int target) {\n for (int i = 0; i < n; i++) {\n int curSum = 0;\n for (int j = i; j < n; j++) {\n curSum += arr[j];\n if (curSum == target) {\n for (int k = i; k <= j; k++) {\n System.out.print(arr[k] + \" \");\n }\n System.out.println();\n }\n }\n }\n }\n\n static void optimalApproach(int[] arr, int n, int target) {\n HashMap sumMap = new HashMap<>();\n int curSum = 0;\n for (int i = 0; i < n; i++) {\n curSum += arr[i];\n if (curSum == target) {\n for (int j = 0; j <= i; j++) {\n System.out.print(arr[j] + \" \");\n }\n System.out.println();\n }\n if (sumMap.containsKey(curSum - target)) {\n int startIndex = sumMap.get(curSum - target) + 1;\n for (int k = startIndex; k <= i; k++) {\n System.out.print(arr[k] + \" \");\n }\n System.out.println();\n }\n sumMap.put(curSum, i);\n }\n }\n\n public static void main(String[] args) {\n int[] arr = {3, 4, -7, 1, 3, 3, 1, -4};\n int N = arr.length;\n int target = 7;\n optimalApproach(arr, N, target);\n }\n}\n" }, { "path": "26 APRIL 2024 SHIFT - 1/Find subarray equals to target/subArraySum.py", "content": "def bruteFroce(arr, n, target):\n for i in range(n):\n curSum = 0\n for j in range(i, n):\n curSum += arr[j]\n if curSum == target:\n print(arr[i:j+1])\n\ndef optimalApp (arr, n, target):\n sumMap = {}\n curSum = 0\n for i in range(n):\n curSum += arr[i]\n if curSum == target:\n print(arr[:i+1])\n if curSum - target in sumMap:\n startIndex = sumMap[curSum - target]+1\n print(arr[startIndex : i+1])\n sumMap[curSum] = i \n\narr = list(map(int, input().split())) # 3 4 -7 1 3 3 1 -4\nN = len(arr)\ntarget = int(input())\n# bruteFroce(arr, N, target)\noptimalApp(arr, N, target)\n" }, { "path": "26 APRIL 2024 SHIFT - 1/Unique Paths/codeCpp.cpp", "content": "#include \nusing namespace std;\n\nclass Solution {\nprivate:\n int f(int i, int j, vector> &dp){\n if(i == 0 && j == 0) return 1;\n if(i < 0 || j < 0) return 0;\n\n if(dp[i][j] != -1) return dp[i][j];\n\n int up = f(i-1, j, dp);\n int left = f(i, j-1, dp);\n return dp[i][j] = up + left;\n }\npublic:\n int uniquePaths(int m, int n) {\n vector> dp (m, vector(n, -1));\n return f(m-1, n-1, dp);\n }\n};" }, { "path": "26 APRIL 2024 SHIFT - 1/Unique Paths/codeJava.java", "content": "public class Solution {\n public int f(int i, int j, int[][] dp) {\n if (i == 0 && j == 0) return 1;\n if (i < 0 || j < 0) return 0;\n\n if (dp[i][j] != -1) return dp[i][j];\n\n int up = f(i - 1, j, dp);\n int left = f(i, j - 1, dp);\n dp[i][j] = up + left;\n return dp[i][j];\n }\n\n public int uniquePaths(int m, int n) {\n int[][] dp = new int[m][n];\n for (int i = 0; i < m; i++) {\n for (int j = 0; j < n; j++) {\n dp[i][j] = -1;\n }\n }\n return f(m - 1, n - 1, dp);\n }\n}\n" }, { "path": "26 APRIL 2024 SHIFT - 1/Unique Paths/uniquePaths.py", "content": "class Solution:\n def __init__(self):\n pass\n \n def f(self, i, j, dp):\n if i == 0 and j == 0:\n return 1\n if i < 0 or j < 0:\n return 0\n\n if dp[i][j] != -1:\n return dp[i][j]\n\n up = self.f(i - 1, j, dp)\n left = self.f(i, j - 1, dp)\n dp[i][j] = up + left\n return dp[i][j]\n\n def uniquePaths(self, m, n):\n dp = [[-1] * n for _ in range(m)]\n return self.f(m - 1, n - 1, dp)\n" }, { "path": "26 APRIL 2024 SHIFT - 2/Cube sum/code.cpp", "content": "#include \n\nusing namespace std;\n\nvoid findCubeSum(int start, int end) {\n int cubeSum = 0;\n for (int i = start; i <= end; i++) {\n cubeSum += i * i * i;\n }\n cout << cubeSum << endl;\n}\n\nint main() {\n int start, end;\n cin >> start >> end;\n findCubeSum(start, end);\n return 0;\n}\n" }, { "path": "26 APRIL 2024 SHIFT - 2/Cube sum/code.java", "content": "import java.util.Scanner;\n\npublic class Main {\n public static void findCubeSum(int start, int end) {\n int cubeSum = 0;\n for (int i = start; i <= end; i++) {\n cubeSum += Math.pow(i, 3);\n }\n System.out.println(cubeSum);\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int start = scanner.nextInt();\n int end = scanner.nextInt();\n findCubeSum(start, end);\n scanner.close();\n }\n}\n" }, { "path": "26 APRIL 2024 SHIFT - 2/Cube sum/cubeSum.py", "content": "def findCubeSum(start, end):\n cubeSum = 0\n for i in range(start, end+1):\n cubeSum += i ** 3 # i * i * i \n print(cubeSum)\n\nstart, end = map(int, input().split())\n# start = int(input())\n# end = int(input())\nfindCubeSum(start, end)" }, { "path": "26 APRIL 2024 SHIFT - 2/Find Most sell item-avg-totalsell/code.cpp", "content": "#include \n#include \n#include \n\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n\n // Method 1\n int maxCost = 0;\n string maxCostItem = \"\";\n double totalPrice = 0;\n double avg = 0;\n\n for (int i = 0; i < n; i++) {\n string item;\n int quantity, price;\n cin >> item >> quantity >> price;\n\n totalPrice += quantity * price;\n if (totalPrice > maxCost) {\n maxCostItem = item;\n }\n avg = totalPrice / (i + 1);\n }\n\n cout << \"Task 1 - Item: \" << maxCostItem << \"\\nTotal price: \" << fixed << totalPrice << \"\\nAverage Price: \" << avg << endl;\n\n // Method 2\n map store;\n maxCost = 0;\n maxCostItem = \"\";\n totalPrice = 0;\n\n for (int i = 0; i < n; i++) {\n string item;\n int quantity, price;\n cin >> item >> quantity >> price;\n totalPrice = quantity * price;\n store[item] += totalPrice;\n\n if (maxCost < store[item]) {\n maxCostItem = item;\n maxCost = store[item];\n }\n }\n\n double total = 0;\n for (auto& pair : store) {\n total += pair.second;\n }\n avg = total / n;\n\n cout << \"\\nTask 2 - Item: \" << maxCostItem << \"\\nTotal price: \" << fixed << total << \"\\nAverage Price: \" << avg << endl;\n\n return 0;\n}\n" }, { "path": "26 APRIL 2024 SHIFT - 2/Find Most sell item-avg-totalsell/code.java", "content": "import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n\n // Method 1\n int maxCost = 0;\n String maxCostItem = \"\";\n double totalPrice = 0;\n double avg = 0;\n\n for (int i = 0; i < n; i++) {\n String item = scanner.next();\n int quantity = scanner.nextInt();\n int price = scanner.nextInt();\n\n totalPrice += quantity * price;\n if (totalPrice > maxCost) {\n maxCostItem = item;\n }\n avg = totalPrice / (i + 1);\n }\n\n System.out.printf(\"Task 1 - Item: %s\\nTotal price: %.2f\\nAverage Price: %.2f\\n\", maxCostItem, totalPrice, avg);\n\n // Method 2\n Map store = new HashMap<>();\n maxCost = 0;\n maxCostItem = \"\";\n totalPrice = 0;\n\n for (int i = 0; i < n; i++) {\n String item = scanner.next();\n int quantity = scanner.nextInt();\n int price = scanner.nextInt();\n totalPrice = quantity * price;\n store.put(item, store.getOrDefault(item, 0.0) + totalPrice);\n\n if (maxCost < store.get(item)) {\n maxCostItem = item;\n maxCost = store.get(item).intValue();\n }\n }\n\n double total = store.values().stream().mapToDouble(Double::doubleValue).sum();\n avg = total / n;\n\n System.out.printf(\"\\nTask 2 - Item: %s\\nTotal price: %.2f\\nAverage Price: %.2f\\n\", maxCostItem, total, avg);\n\n scanner.close();\n }\n}\n" }, { "path": "26 APRIL 2024 SHIFT - 2/Find Most sell item-avg-totalsell/code.py", "content": "n = int(input())\nmaxCost = 0\nmaxCostItem = \"\"\ntotalPrice = 0\navg = 0\nfor i in range(n):\n item = input()\n quantity = int(input())\n price = int(input())\n\n totalPrice += quantity * price \n if totalPrice > maxCost:\n maxCostItem = item \n avg = totalPrice / (i+1)\n\nprint(\"Item: {} \\nTotal price: {:.2f}\\n Average Price: {:.2f}\".format(maxCostItem, totalPrice, avg))\n\nstore = {}\nfor i in range(n):\n item = input()\n quantity = int(input())\n price = int(input())\n totalPrice = quantity * price\n store[item] = store.get(item, 0) + totalPrice\n\ntotal = 0\nfor key, val in store.items(): \n if maxCost < val:\n maxCostItem = key\n maxCost = val \n total += val \n\naverage = total / n\n\nprint(\"Item: {} \\nTotal price: {:.2f}\\n Average Price: {:.2f}\".format(maxCostItem, total, average))\n \n\n \n\n" }, { "path": "29 APRIL 2024 Shift - 1/Maximum element of subarray/code.cpp", "content": "#include \n#include \n#include \n\nusing namespace std;\n\nvoid solve(vector& arr, int k) {\n vector ans;\n for (int i = 0; i < arr.size() - k + 1; i++) {\n priority_queue maxHeap;\n for (int j = i; j < i + k; j++) {\n maxHeap.push(arr[j]);\n }\n ans.push_back(maxHeap.top());\n }\n for (int num : ans) {\n cout << num << \" \";\n }\n cout << endl;\n}\n\nvoid optimalSolution(vector& arr, int k) {\n priority_queue> maxHeap;\n vector ans;\n\n for (int i = 0; i < k; i++) {\n maxHeap.push({arr[i], i});\n }\n ans.push_back(maxHeap.top().first);\n\n for (int i = k; i < arr.size(); i++) {\n maxHeap.push({arr[i], i});\n while (maxHeap.top().second <= i - k) {\n maxHeap.pop();\n }\n ans.push_back(maxHeap.top().first);\n }\n for (int num : ans) {\n cout << num << \" \";\n }\n cout << endl;\n}\n\nint main() {\n vector arr;\n int num;\n while (cin >> num) {\n arr.push_back(num);\n if (cin.get() == '\\n') break;\n }\n int k;\n cin >> k;\n solve(arr, k);\n optimalSolution(arr, k);\n return 0;\n}\n" }, { "path": "29 APRIL 2024 Shift - 1/Maximum element of subarray/code.java", "content": "import java.util.*;\n\npublic class Main {\n public static void solve(ArrayList arr, int k) {\n ArrayList ans = new ArrayList<>();\n for (int i = 0; i < arr.size() - k + 1; i++) {\n PriorityQueue maxHeap = new PriorityQueue<>(Collections.reverseOrder());\n for (int j = i; j < i + k; j++) {\n maxHeap.offer(arr.get(j));\n }\n ans.add(maxHeap.peek());\n }\n for (int num : ans) {\n System.out.print(num + \" \");\n }\n System.out.println();\n }\n\n public static void optimalSolution(ArrayList arr, int k) {\n PriorityQueue maxHeap = new PriorityQueue<>((a, b) -> b[0] - a[0]);\n ArrayList ans = new ArrayList<>();\n\n for (int i = 0; i < k; i++) {\n maxHeap.offer(new int[]{arr.get(i), i});\n }\n ans.add(maxHeap.peek()[0]);\n\n for (int i = k; i < arr.size(); i++) {\n maxHeap.offer(new int[]{arr.get(i), i});\n while (maxHeap.peek()[1] <= i - k) {\n maxHeap.poll();\n }\n ans.add(maxHeap.peek()[0]);\n }\n for (int num : ans) {\n System.out.print(num + \" \");\n }\n System.out.println();\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n ArrayList arr = new ArrayList<>();\n while (scanner.hasNextInt()) {\n arr.add(scanner.nextInt());\n if (scanner.hasNextLine()) {\n String nextLine = scanner.nextLine();\n if (nextLine.isEmpty()) break;\n }\n }\n int k = scanner.nextInt();\n solve(arr, k);\n optimalSolution(arr, k);\n }\n}\n" }, { "path": "29 APRIL 2024 Shift - 1/Maximum element of subarray/code.py", "content": "import heapq\ndef solve(arr, k):\n ans = []\n for i in range(len(arr) - k + 1):\n maxi = arr[i]\n for j in range(i, i+k):\n maxi = max(maxi, arr[j])\n ans.append(maxi)\n print(*ans)\n\ndef optimalSolution(arr, k):\n heap = []\n ans = []\n\n for i in range(k):\n heapq.heappush(heap, (-arr[i], i))\n ans.append(-heap[0][0])\n\n for i in range(k, len(arr)):\n heapq.heappush(heap, (-arr[i], i))\n while heap[0][1] <= i - k:\n heapq.heappop(heap)\n ans.append(-heap[0][0])\n print(*ans)\n \n\n\narr = list(map(int, input().split()))\nk = int(input())\nsolve(arr, k)\noptimalSolution(arr, k)" }, { "path": "29 APRIL 2024 Shift - 1/Maximum element of subarray/tempCodeRunnerFile.py", "content": "\n" }, { "path": "29 APRIL 2024 Shift - 1/Multiplication table/code.cpp", "content": "#include \n\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n int mSum = 0;\n for (int i = 1; i <= n; i++) {\n mSum += n * i;\n }\n cout << mSum << endl;\n return 0;\n}\n" }, { "path": "29 APRIL 2024 Shift - 1/Multiplication table/code.java", "content": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n int mSum = 0;\n for (int i = 1; i <= n; i++) {\n mSum += n * i;\n }\n System.out.println(mSum);\n }\n}\n" }, { "path": "29 APRIL 2024 Shift - 1/Multiplication table/code.py", "content": "n = int(input())\nmSum = 0\nfor i in range(1, n+1):\n mSum += n * i \nprint(mSum)" }, { "path": "29 APRIL SHIFT 2/Bit OR Sum/code.cpp", "content": "#include \n#include \n#include \nusing namespace std;\n\nint subarrayBitwiseORs(vector& arr) {\n vector res;\n int left = 0;\n for (int num : arr) {\n int right = res.size();\n res.push_back(num);\n for (int i = left; i < right; ++i) {\n int value = res[i] | num;\n if (res.back() != value) {\n res.push_back(value);\n }\n }\n left = right;\n }\n return unordered_set(res.begin(), res.end()).size();\n}\n\nint main() {\n int n;\n cin >> n;\n vector arr(n);\n for (int i = 0; i < n; ++i) {\n cin >> arr[i];\n }\n cout << subarrayBitwiseORs(arr) << endl;\n return 0;\n}\n" }, { "path": "29 APRIL SHIFT 2/Bit OR Sum/code.java", "content": "import java.util.*;\n\npublic class SubarrayBitwiseORs {\n public static int subarrayBitwiseORs(int[] arr) {\n List res = new ArrayList<>();\n int left = 0;\n for (int num : arr) {\n int right = res.size();\n res.add(num);\n for (int i = left; i < right; ++i) {\n int value = res.get(i) | num;\n if (res.get(res.size() - 1) != value) {\n res.add(value);\n }\n }\n left = right;\n }\n Set resultSet = new HashSet<>(res);\n return resultSet.size();\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n int[] arr = new int[n];\n for (int i = 0; i < n; ++i) {\n arr[i] = scanner.nextInt();\n }\n System.out.println(subarrayBitwiseORs(arr));\n scanner.close();\n }\n}\n" }, { "path": "29 APRIL SHIFT 2/Bit OR Sum/code.py", "content": "def subarrayBitwiseORs(arr):\n res = []\n left = 0\n for num in arr:\n right = len(res)\n res.append(num)\n for i in range(left, right):\n value = res[i] | num\n if (res[-1] != value):\n res.append(value)\n left = right\n return len(set(res))\n\narr = list(map(int, input().split()))\nprint(subarrayBitwiseORs(arr))" }, { "path": "29 APRIL SHIFT 2/FIbonacci/code.cpp", "content": "#include \nusing namespace std;\n\nint fibonacci(int n) {\n int a = 0, b = 1, sum=1;\n if (n < 0) {\n cout << \"Incorrect input\" << endl;\n return -1; // or any error code you prefer\n } else if (n == 0) {\n return a;\n } else if (n == 1) {\n return b;\n } else {\n for (int i = 2; i < n; ++i) {\n int c = a + b;\n sum += c;\n a = b;\n b = c;\n }\n return sum;\n }\n}\n\nint main() {\n int n;\n cin >> n;\n cout << fibonacci(n) << endl;\n return 0;\n}\n" }, { "path": "29 APRIL SHIFT 2/FIbonacci/code.java", "content": "import java.util.Scanner;\n\npublic class Fibonacci {\n public static int fibonacci(int n) {\n int a = 0, b = 1;\n if (n < 0) {\n System.out.println(\"Incorrect input\");\n return -1; // or any error code you prefer\n } else if (n == 0) {\n return a;\n } else if (n == 1) {\n return b;\n } else {\n for (int i = 2; i <= n; ++i) {\n int c = a + b;\n a = b;\n b = c;\n }\n return b;\n }\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n System.out.println(fibonacci(n));\n scanner.close();\n }\n}\n" }, { "path": "29 APRIL SHIFT 2/FIbonacci/code.py", "content": "def fibonacci(n):\n prev2, prev = 0, 1\n if n == 0:\n return prev2 \n if n == 1:\n return prev \n fibSum = 1\n for i in range(2, n):\n cur = prev2 + prev \n fibSum += cur\n print(\"FibSum: \", fibSum)\n prev2, prev = prev, cur\n return fibSum\n\nn = int(input())\nprint(fibonacci(n))" }, { "path": "3 May SHIFT 2/Maximum Efficiency/code.cpp", "content": "#include \n#include \n#include \nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector arr(N);\n for (int i = 0; i < N; ++i) {\n cin >> arr[i];\n }\n sort(arr.begin(), arr.end());\n\n // Max values\n int emp1 = arr[N - 1];\n int emp2 = arr[N - 2];\n int emp3 = arr[N - 3];\n\n // Negative case\n int neg1 = arr[0];\n int neg2 = arr[1];\n\n cout << max(emp1 * emp2 * emp3, neg1 * neg2 * emp1) << endl;\n\n return 0;\n}\n" }, { "path": "3 May SHIFT 2/Maximum Efficiency/code.java", "content": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int N = scanner.nextInt();\n int[] arr = new int[N];\n for (int i = 0; i < N; ++i) {\n arr[i] = scanner.nextInt();\n }\n Arrays.sort(arr);\n\n // Max values\n int emp1 = arr[N - 1];\n int emp2 = arr[N - 2];\n int emp3 = arr[N - 3];\n\n // Negative case\n int neg1 = arr[0];\n int neg2 = arr[1];\n\n System.out.println(Math.max(emp1 * emp2 * emp3, neg1 * neg2 * emp1));\n }\n}\n" }, { "path": "3 May SHIFT 2/Maximum Efficiency/code.py", "content": "N = int(input())\narr = list(map(int, input().split()))\narr.sort()\n\n#Max values\nemp1 = arr[N-1]\nemp2 = arr[N-2]\nemp3 = arr[N-3]\n\n#negative case\nneg1 = arr[0]\nneg2 = arr[1]\n\nprint(max(emp1 * emp2 * emp3, neg1 * neg2 * emp1))\n" }, { "path": "3 May SHIFT 2/Pairs of shoes/code.cpp", "content": "#include \n#include \n#include \nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n unordered_map store;\n\n for (int i = 0; i < N; ++i) {\n string shoeSize;\n cin >> shoeSize;\n if (store.find(shoeSize) != store.end()) {\n store[shoeSize]++;\n } else {\n store[shoeSize] = 1;\n }\n }\n\n int pairs = 0;\n for (auto& it : store) {\n string key = it.first;\n int val = it.second;\n string opposite;\n if (key[key.size() - 1] == 'L') {\n opposite = key.substr(0, key.size() - 1) + 'R';\n } else {\n opposite = key.substr(0, key.size() - 1) + 'L';\n }\n if (store.find(opposite) != store.end()) {\n pairs += min(val, store[opposite]);\n }\n }\n\n cout << pairs / 2 << endl; \n\n return 0;\n}\n" }, { "path": "3 May SHIFT 2/Pairs of shoes/code.java", "content": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int N = scanner.nextInt();\n Map store = new HashMap<>();\n\n for (int i = 0; i < N; i++) {\n String shoeSize = scanner.next();\n store.put(shoeSize, store.getOrDefault(shoeSize, 0) + 1);\n }\n\n int pairs = 0;\n for (Map.Entry entry : store.entrySet()) {\n String key = entry.getKey();\n int val = entry.getValue();\n String opposite;\n if (key.charAt(key.length() - 1) == 'L') {\n opposite = key.substring(0, key.length() - 1) + 'R';\n } else {\n opposite = key.substring(0, key.length() - 1) + 'L';\n }\n if (store.containsKey(opposite)) {\n pairs += Math.min(val, store.get(opposite));\n }\n }\n\n System.out.println(pairs / 2); // Dividing by 2 as we are counting pairs\n }\n}\n" }, { "path": "3 May SHIFT 2/Pairs of shoes/code.py", "content": "N = int(input())\nl = list(map(str, input().split()))\nstore = {}\nfor shoeSize in l:\n if shoeSize in store:\n store[shoeSize] += 1 \n else:\n store[shoeSize] = 1\n\npairs = 0\nfor key, val in store.items():\n if key[-1] == 'L':\n val = key[:-1] + 'R'\n if val in store:\n pairs += min(store[key], store[val])\n else:\n val = key[:-1] + 'L'\n if val in store:\n pairs += min(store[key], store[val])\nprint(pairs // 2) \n" }, { "path": "3 May Shift 1/Number Divisible/code.cpp", "content": "#include \n\nbool isDivisibleByNine(int number) {\n return number % 9 == 0;\n}\n\nint main() {\n int number;\n std::cin >> number;\n if (number >= 100 && number <= 999) {\n if (isDivisibleByNine(number)) {\n std::cout << \"Number \" << number << \" is divisible by 9\" << std::endl;\n } else {\n std::cout << \"Number \" << number << \" is not divisible by 9\" << std::endl;\n }\n }\n\n return 0;\n}\n" }, { "path": "3 May Shift 1/Number Divisible/code.java", "content": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int number = scanner.nextInt();\n if (number >= 100 && number <= 999) {\n if (number % 9 == 0) {\n System.out.println(\"Number \" + number + \" is divisible by 9\");\n } else {\n System.out.println(\"Number \" + number + \" is not divisible by 9\");\n }\n }\n }\n}\n" }, { "path": "3 May Shift 1/Number Divisible/code.py", "content": "def check_divisibility(number):\n if 100 <= number <= 999:\n if number % 9 == 0:\n print(f\"Number {number} is divisible by 9\")\n else:\n print(f\"Number {number} is not divisible by 9\")\n\n# Input a three-digit integer\nnumber = int(input())\ncheck_divisibility(number)\n" }, { "path": "3 May Shift 1/maximum difference between smallest and largest/code.cpp", "content": "#include \n\nusing namespace std;\n\nint solve(vector& arr) {\n int largest = INT_MIN;\n int maxDiff = INT_MIN;\n for (int i = arr.size() - 1; i >= 0; --i) {\n try {\n int num = stoi(arr[i]);\n largest = max(largest, num);\n maxDiff = max(maxDiff, largest - num);\n } catch (const std::invalid_argument& e) {\n // Handle invalid input\n std::cerr << \"Invalid input: \" << arr[i] << std::endl;\n }\n }\n return maxDiff;\n}\n\nint solveInt(vector& arr) {\n int largest = INT_MIN;\n int maxDiff = INT_MIN;\n for (int i = arr.size() - 1; i >= 0; --i) {\n int num = arr[i];\n largest = max(largest, num);\n maxDiff = max(maxDiff, largest - num);\n }\n return maxDiff;\n}\n\nint main() {\n // Input array format\n cout << \"Enter elements separated by commas within square brackets like [element1,element2,...]: \";\n string input;\n getline(cin, input);\n input.erase(remove(input.begin(), input.end(), '['), input.end()); // Remove '['\n input.erase(remove(input.begin(), input.end(), ']'), input.end()); // Remove ']'\n stringstream ss(input);\n vector arr1;\n string element;\n while (getline(ss, element, ',')) {\n arr1.push_back(element);\n }\n cout << \"Case 1 - [-3,-5,1,6,-7,8,11], maxdiff: \" << solve(arr1) << endl;\n\n // Input space separated\n cout << \"Enter elements separated by spaces: \";\n string spaceSeparatedInput;\n getline(cin, spaceSeparatedInput);\n vector arr2;\n int num;\n stringstream ss2(spaceSeparatedInput);\n while (ss2 >> num) {\n arr2.push_back(num);\n }\n cout << \"Case 2: -3 -5 1 6 -7 8 11, maxdiff: \" << solveInt(arr2) << endl;\n\n return 0;\n}\n" }, { "path": "3 May Shift 1/maximum difference between smallest and largest/code.java", "content": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n public static int solve(List arr) {\n int largest = Integer.MIN_VALUE;\n int maxDiff = Integer.MIN_VALUE;\n for (int i = arr.size() - 1; i >= 0; i--) {\n try {\n int num = Integer.parseInt(arr.get(i));\n largest = Math.max(largest, num);\n maxDiff = Math.max(maxDiff, largest - num);\n } catch (NumberFormatException e) {\n // Handle invalid input\n System.err.println(\"Invalid input: \" + arr.get(i));\n }\n }\n return maxDiff;\n }\n\n public static int solveInt(List arr) {\n int largest = Integer.MIN_VALUE;\n int maxDiff = Integer.MIN_VALUE;\n for (int i = arr.size() - 1; i >= 0; i--) {\n int num = arr.get(i);\n largest = Math.max(largest, num);\n maxDiff = Math.max(maxDiff, largest - num);\n }\n return maxDiff;\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n // Input array format\n System.out.print(\"Enter elements separated by commas within square brackets like [element1,element2,...]: \");\n String input = scanner.nextLine().trim();\n input = input.substring(1, input.length() - 1); // Remove square brackets\n String[] arr1 = input.split(\",\");\n List list1 = new ArrayList<>();\n for (String s : arr1) {\n list1.add(s.trim());\n }\n System.out.println(\"Case 1 - [-3,-5,1,6,-7,8,11], maxdiff: \" + solve(list1));\n\n // Input space separated\n System.out.print(\"Enter elements separated by spaces: \");\n String spaceSeparatedInput = scanner.nextLine().trim();\n String[] arr2 = spaceSeparatedInput.split(\" \");\n List list2 = new ArrayList<>();\n for (String s : arr2) {\n list2.add(Integer.parseInt(s));\n }\n System.out.println(\"Case 2: -3 -5 1 6 -7 8 11, maxdiff: SS\" + solveInt(list2));\n\n scanner.close();\n }\n}\n" }, { "path": "3 May Shift 1/maximum difference between smallest and largest/code.py", "content": "def solve(arr):\n largest, maxDiff = float('-inf'), float('-inf')\n for i in range(len(arr) - 1, -1, -1):\n num = int(arr[i])\n largest = max(largest, num)\n maxDiff = max(maxDiff, largest - num)\n return maxDiff\n\ndef solveInt(arr):\n largest, maxDiff = float('-inf'), float('-inf')\n for i in range(len(arr) - 1, -1, -1):\n num = arr[i]\n largest = max(largest, num)\n maxDiff = max(maxDiff, largest - num)\n return maxDiff\n\ndef input_array_format():\n arr = list(map(str, input().strip(\"[]\").split(',')))\n print(\"\\nCase 1 - [-3,-5,1,6,-7,8,11], maxdiff: \", solve(arr))\n\ndef input_space_separated():\n arr = list(map(int, input().split()))\n print(\"\\nCase 2: -3 -5 1 6 -7 8 11, maxdiff: \", solveInt(arr))\n\n\ninput_array_format()\ninput_space_separated()" }, { "path": "30 APRIL SHIFT 1/GRADE Problem/code.cpp", "content": "#include \nusing namespace std;\n\nint main() {\n int n;\n vector ans;\n int totalFemale = 0, totalGrade = 0;\n while(n--) {\n string name, gender;\n char grade;\n int age;\n cin >> name >> age >> grade >> gender;\n\n if(age > 20)\n cout << name << endl;\n \n if (gender == \"Female\") {\n totalFemale++;\n totalGrade += grade; \n }\n }\n double avg = (double) (totalGrade / totalFemale);\n cout << avg << endl;\n \n}" }, { "path": "30 APRIL SHIFT 1/GRADE Problem/code.java", "content": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n int n = scanner.nextInt();\n scanner.nextLine(); // Consume newline character\n\n List ans = new ArrayList<>();\n int totalFemale = 0;\n int totalGrade = 0;\n\n while (n-- > 0) {\n String name, gender;\n char grade;\n int age;\n\n name = scanner.next();\n age = scanner.nextInt();\n grade = scanner.next().charAt(0);\n gender = scanner.next();\n\n if (age > 20) {\n ans.add(name);\n }\n\n if (gender.equals(\"Female\")) {\n totalFemale++;\n totalGrade += grade;\n }\n }\n\n for (String name : ans) {\n System.out.println(name);\n }\n\n double avg = totalFemale == 0 ? 0 : (double) totalGrade / totalFemale;\n System.out.println(avg);\n }\n}\n" }, { "path": "30 APRIL SHIFT 1/GRADE Problem/code.py", "content": "gradeTotal, totalFemale = 0, 0\nans = []\nfor _ in range(int(input())):\n # name = input()\n # age = int(input())\n # grade = input()\n # gender = input()\n \n s = input()\n l = s.split(\" \")\n name, age, grade, gender = l[0], int(l[1]), l[2], l[3]\n if age > 20:\n ans.append(name)\n if gender == \"Female\":\n gradeTotal += ord(grade)\n totalFemale += 1\n avg = gradeTotal / totalFemale\nprint(*ans)\nprint(avg)\n\n" }, { "path": "30 APRIL SHIFT 1/GRADE Problem/tempCodeRunnerFile.py", "content": "3 \nAAA 21 A Female \nBBB 24 B Male\nCCC 26 C Female" }, { "path": "30 APRIL SHIFT 1/MAJORITY ELEMENT/code.cpp", "content": "#include \nusing namespace std;\n\nvoid findMajorityElement(vector& arr, int N) {\n unordered_map freq;\n for (int num : arr) {\n freq[num]++;\n }\n for (auto& pair : freq) {\n if (pair.second >= N / 2) {\n cout << pair.first << \" \";\n }\n }\n}\n\nint main() {\n int N;\n cin >> N;\n vector array(N);\n for (int i = 0; i < N; ++i) {\n cin >> array[i];\n }\n findMajorityElement(array, N);\n return 0;\n}\n" }, { "path": "30 APRIL SHIFT 1/MAJORITY ELEMENT/code.java", "content": "import java.util.HashMap;\nimport java.util.Scanner;\n\npublic class Main {\n public static void findMajorityElement(int[] arr, int N) {\n HashMap freq = new HashMap<>();\n for (int num : arr) {\n freq.put(num, freq.getOrDefault(num, 0) + 1);\n }\n for (int key : freq.keySet()) {\n if (freq.get(key) >= N / 2) {\n System.out.print(key + \" \");\n }\n }\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int N = scanner.nextInt();\n int[] array = new int[N];\n for (int i = 0; i < N; ++i) {\n array[i] = scanner.nextInt();\n }\n findMajorityElement(array, N);\n }\n}\n" }, { "path": "30 APRIL SHIFT 1/MAJORITY ELEMENT/code.py", "content": "def findMajorityElement(arr, N):\n freq = {}\n for num in arr:\n if num in freq:\n freq[num] += 1 \n else:\n freq[num] = 1\n for key, val in freq.items():\n if val >= N // 2:\n print(key, end = \" \")\n \n\nN = int(input())\narray = list(map(int, input().split()))\nfindMajorityElement(array, N)" }, { "path": "8 MAY SHIFT 1/Nearest divisible/code.cpp", "content": "#include \nusing namespace std;\n\nint customRound(double number) {\n int integerPart = (int) number;\n double decimalPart = number - integerPart;\n\n if (decimalPart >= 0.5) {\n return integerPart + 1;\n } else {\n return integerPart;\n }\n}\n\nint main() {\n int x, y;\n cin >> x;\n cin >> y;\n\n double nearest = (double) x / y;\n int roundedNumber = customRound(nearest);\n cout << roundedNumber * y << endl;\n\n return 0;\n}\n" }, { "path": "8 MAY SHIFT 1/Nearest divisible/code.java", "content": "import java.util.Scanner;\n\npublic class CustomRound {\n public static int customRound(double number) {\n int integerPart = (int) number;\n double decimalPart = number - integerPart;\n\n if (decimalPart >= 0.5) {\n return integerPart + 1;\n } else {\n return integerPart;\n }\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int x = scanner.nextInt();\n int y = scanner.nextInt();\n\n double nearest = (double) x / y;\n int roundedNumber = customRound(nearest);\n System.out.println(roundedNumber * y);\n }\n}\n" }, { "path": "8 MAY SHIFT 1/Nearest divisible/code.py", "content": "def custom_round(number):\n integer_part = int(number)\n decimal_part = number - integer_part\n\n if decimal_part >= 0.5:\n return integer_part + 1\n else:\n return integer_part\n\n\nx = int(input())\ny = int(input())\nnearest = x / y\nrounded_number = custom_round(nearest)\nprint(rounded_number * y) \n" }, { "path": "8 MAY SHIFT 1/Password creations/code.cpp", "content": "#include \nusing namespace std;\n\nstring addValueToChars(string inputStr, int value) {\n string result = \"\";\n for (char ch : inputStr) {\n if (isalpha(ch)) {\n if (islower(ch)) {\n result += ((ch - 'a' + value) % 26) + 'a';\n } else {\n result += ((ch - 'A' + value) % 26) + 'A';\n }\n } else if (isdigit(ch)) {\n result += ((ch - '0' + value) % 10) + '0';\n } else {\n if (ch == '@') {\n result += '#';\n } else {\n result += '@';\n }\n }\n }\n return result;\n}\n\nint main() {\n string inputStr;\n int value;\n\n cout << \"Enter input string: \";\n cin >> inputStr;\n cout << \"Enter value: \";\n cin >> value;\n\n string outputStr = addValueToChars(inputStr, value);\n cout << \"Output: \" << outputStr << endl;\n\n return 0;\n}\n" }, { "path": "8 MAY SHIFT 1/Password creations/code.java", "content": "import java.util.Scanner;\n\npublic class Main {\n public static String addValueToChars(String inputStr, int value) {\n StringBuilder result = new StringBuilder();\n for (char ch : inputStr.toCharArray()) {\n if (Character.isLetter(ch)) {\n if (Character.isLowerCase(ch)) {\n result.append((char) (((ch - 'a' + value) % 26) + 'a'));\n } else {\n result.append((char) (((ch - 'A' + value) % 26) + 'A'));\n }\n } else if (Character.isDigit(ch)) {\n result.append((char) (((ch - '0' + value) % 10) + '0'));\n } else {\n if (ch == '@') {\n result.append('#');\n } else {\n result.append('@');\n }\n }\n }\n return result.toString();\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n System.out.print(\"Enter input string: \");\n String inputStr = scanner.next();\n System.out.print(\"Enter value: \");\n int value = scanner.nextInt();\n\n String outputStr = addValueToChars(inputStr, value);\n System.out.println(\"Output: \" + outputStr);\n }\n}\n" }, { "path": "8 MAY SHIFT 1/Password creations/code.py", "content": "def add_value_to_chars(input_str, value):\n result = \"\"\n for char in input_str:\n if char.isalpha():\n if char.islower():\n result += chr(((ord(char) - ord('a') + value) % 26) + ord('a'))\n else:\n result += chr(((ord(char) - ord('A') + value) % 26) + ord('A'))\n elif char.isdigit():\n result += str((int(char) + value) % 10)\n else:\n if char == '@':\n result += '#'\n else: \n result += '@'\n return result\n\ninput_str = input()\nvalue = int(input())\n\noutput_str = add_value_to_chars(input_str, value)\nprint(\"Output:\", output_str)\n" }, { "path": "9 May 2024 Shift - 2/Print All combinations/code.cpp", "content": "#include \n#include \n#include \n\nint main() {\n std::string input;\n std::getline(std::cin, input);\n std::istringstream iss(input);\n \n int n;\n iss >> n;\n \n std::vector arr;\n int temp;\n while (iss >> temp) {\n arr.push_back(temp);\n }\n \n for (int i = 0; i < n; ++i) {\n for (int j = i; j < n; ++j) {\n for (int q = i; q <= j; ++q) {\n std::cout << arr[q];\n if (q != j)\n std::cout << \" \";\n }\n if (i != n - 1)\n std::cout << \",\";\n }\n }\n\n return 0;\n}\n" }, { "path": "9 May 2024 Shift - 2/Print All combinations/code.java", "content": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String in = sc.nextLine();\n String[] arr = in.split(\" \");\n int n = Integer.parseInt(arr[0]);\n StringBuilder sb = new StringBuilder();\n for (int i = 1; i < arr.length; i++) {\n sb.append(arr[i]);\n }\n for (int i = 0; i < n; i++) {\n for (int j = i; j < n; j++) {\n for (int q = i; q <= j; q++) {\n if (q != j) {\n System.out.print(sb.charAt(q) + \" \");\n } else {\n System.out.print(sb.charAt(q));\n }\n }\n if (i != n - 1)\n System.out.print(\",\");\n }\n }\n }\n}\n\n" }, { "path": "9 May 2024 Shift - 2/Print All combinations/code.py", "content": "def main():\n in_str = input()\n arr = in_str.split(\" \")\n n = int(arr[0])\n sb = \"\".join(arr[1:])\n \n for i in range(n):\n for j in range(i, n):\n for q in range(i, j + 1):\n if q != j:\n print(sb[q], end=\" \")\n else:\n print(sb[q], end=\"\")\n if i != n - 1:\n print(\",\", end=\"\")\n print()\n\nif __name__ == \"__main__\":\n main()\n" }, { "path": "9 May 2024 Shift - 2/Sort the given array asc and desc/code.cpp", "content": "#include \n\nusing namespace std;\n\nvoid printDictSorted(const map& mydict, bool reverse = false) {\n vector sorted_keys;\n for (const auto& entry : mydict) {\n sorted_keys.push_back(entry.first);\n }\n if (reverse) {\n sort(sorted_keys.rbegin(), sorted_keys.rend());\n } else {\n sort(sorted_keys.begin(), sorted_keys.end());\n }\n for (const string& key : sorted_keys) {\n cout << key << \" \";\n }\n cout << endl;\n}\n\nint main() {\n string input;\n getline(cin, input);\n istringstream iss(input);\n vector arr{istream_iterator{iss}, istream_iterator{}};\n\n map d;\n for (const string& fruit : arr) {\n d[fruit]++;\n }\n\n printDictSorted(d);\n printDictSorted(d, true);\n\n return 0;\n}\n" }, { "path": "9 May 2024 Shift - 2/Sort the given array asc and desc/code.java", "content": "import java.util.Scanner;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.ArrayList;\nimport java.util.Collections;\n\npublic class Main {\n public static void printDictSorted(Map mydict, boolean reverse) {\n ArrayList sortedKeys = new ArrayList<>(mydict.keySet());\n if (reverse) {\n Collections.sort(sortedKeys, Collections.reverseOrder());\n } else {\n Collections.sort(sortedKeys);\n }\n for (String key : sortedKeys) {\n System.out.print(key + \" \");\n }\n System.out.println();\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String input = scanner.nextLine();\n String[] arr = input.split(\"\\\\s+\");\n Map d = new HashMap<>();\n for (String fruit : arr) {\n d.put(fruit, d.getOrDefault(fruit, 0) + 1);\n }\n\n printDictSorted(d, false);\n printDictSorted(d, true);\n }\n}\n\n" }, { "path": "9 May 2024 Shift - 2/Sort the given array asc and desc/code.py", "content": "from collections import defaultdict\n\ndef printDictSorted(mydict, reverse=False):\n sorted_keys = sorted(mydict.keys(), reverse=reverse)\n for key in sorted_keys:\n print(key, end=\" \")\n print()\n\narr = input().split()\n\nd = defaultdict(int)\nfor fruit in arr:\n d[fruit] += 1\n\nprintDictSorted(d)\nprintDictSorted(d, reverse=True)\n" }, { "path": "TCS NQT ALL INPUT scenario/Arrays 1D/code.cpp", "content": "#include \n#include \n#include \nusing namespace std;\n\nvector input_array_format() {\n vector arr;\n string input;\n getline(cin, input);\n stringstream ss(input);\n char c;\n while (ss >> c) {\n if (c != ',' || c != '[' or c != ']') {\n int num;\n ss >> num;\n arr.push_back(num);\n }\n }\n return arr;\n}\n\nvector input_space_separated() {\n vector arr;\n string input;\n getline(cin, input);\n stringstream ss(input);\n int num;\n while (ss >> num) {\n arr.push_back(num);\n }\n return arr;\n}\n\nvector input_comma_separated() {\n vector arr;\n string input;\n getline(cin, input);\n stringstream ss(input);\n int num;\n char c;\n while (ss >> num) {\n arr.push_back(num);\n ss >> c; // Skip the comma\n }\n return arr;\n}\n\nvector input_array_size_not_given() {\n vector arr;\n string input;\n getline(cin, input);\n stringstream ss(input);\n int num;\n while (ss >> num) {\n arr.push_back(num);\n }\n return arr;\n}\n\nint main() {\n // Case 1: [1,2,3,4,5]\n vector arr1 = input_array_format();\n cout << \"Case 1: [1,2,3,4,5]\" << endl;\n for (int num : arr1) {\n cout << num << \" \";\n }\n cout << endl;\n\n // Case 2: 1 2 3 4 5\n vector arr2 = input_space_separated();\n cout << \"Case 2: 1 2 3 4 5\" << endl;\n for (int num : arr2) {\n cout << num << \" \";\n }\n cout << endl;\n\n // Case 3: 1,2,3,4,5\n vector arr3 = input_comma_separated();\n cout << \"Case 3: 1,2,3,4,5\" << endl;\n for (int num : arr3) {\n cout << num << \" \";\n }\n cout << endl;\n\n // Case with size not given\n vector arr4 = input_array_size_not_given();\n cout << \"Case with size not given\" << endl;\n for (int num : arr4) {\n cout << num << \" \";\n }\n cout << endl;\n\n return 0;\n}\n" }, { "path": "TCS NQT ALL INPUT scenario/Arrays 1D/code.java", "content": "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class InputExample {\n public static ArrayList inputArrayFormat() {\n ArrayList arr = new ArrayList<>();\n Scanner scanner = new Scanner(System.in);\n String input = scanner.nextLine();\n for (char c : input.toCharArray()) {\n if (Character.isDigit(c)) {\n int num = Character.getNumericValue(c);\n arr.add(num);\n }\n }\n return arr;\n }\n\n public static ArrayList inputSpaceSeparated() {\n ArrayList arr = new ArrayList<>();\n Scanner scanner = new Scanner(System.in);\n String input = scanner.nextLine();\n Scanner ss = new Scanner(input);\n while (ss.hasNextInt()) {\n arr.add(ss.nextInt());\n }\n return arr;\n }\n\n public static ArrayList inputCommaSeparated() {\n ArrayList arr = new ArrayList<>();\n Scanner scanner = new Scanner(System.in);\n String input = scanner.nextLine();\n Scanner ss = new Scanner(input).useDelimiter(\",\");\n while (ss.hasNextInt()) {\n arr.add(ss.nextInt());\n }\n return arr;\n }\n\n public static ArrayList inputArraySizeNotGiven() {\n ArrayList arr = new ArrayList<>();\n Scanner scanner = new Scanner(System.in);\n String input = scanner.nextLine();\n Scanner ss = new Scanner(input);\n while (ss.hasNextInt()) {\n arr.add(ss.nextInt());\n }\n return arr;\n }\n\n public static void main(String[] args) {\n // Case 1: [1,2,3,4,5]\n ArrayList arr1 = inputArrayFormat();\n System.out.println(\"Case 1: [1,2,3,4,5]\");\n for (int num : arr1) {\n System.out.print(num + \" \");\n }\n System.out.println();\n\n // Case 2: 1 2 3 4 5\n ArrayList arr2 = inputSpaceSeparated();\n System.out.println(\"Case 2: 1 2 3 4 5\");\n for (int num : arr2) {\n System.out.print(num + \" \");\n }\n System.out.println();\n\n // Case 3: 1,2,3,4,5\n ArrayList arr3 = inputCommaSeparated();\n System.out.println(\"Case 3: 1,2,3,4,5\");\n for (int num : arr3) {\n System.out.print(num + \" \");\n }\n System.out.println();\n\n // Case with size not given\n ArrayList arr4 = inputArraySizeNotGiven();\n System.out.println(\"Case with size not given\");\n for (int num : arr4) {\n System.out.print(num + \" \");\n }\n System.out.println();\n }\n}\n" }, { "path": "TCS NQT ALL INPUT scenario/Arrays 1D/code.py", "content": "# Case 1: [1,2,3,4,5]\ndef input_array_format():\n arr = list(map(int, input().strip(\"[]\").split(',')))\n return arr\n\n# Case 2: 1 2 3 4 5\ndef input_space_separated():\n arr = list(map(int, input().split()))\n return arr\n\n# Case 3: 1,2,3,4,5\ndef input_comma_separated():\n arr = list(map(int, input().split(',')))\n return arr\n\n# Case with size not given\ndef input_array_size_not_given():\n arr = []\n while True:\n try:\n num = input().strip()\n if num == \"\":\n break\n arr.extend(map(int, num.split()))\n except ValueError:\n print(\"Please enter valid integers separated by space.\")\n return arr\n\ndef input_array_size_not_given2():\n arr = list(map(int, input().split()))\n return arr\n\n\nprint(input_array_format())\nprint(input_space_separated())\nprint(input_comma_separated())\nprint(input_array_size_not_given2())" }, { "path": "TCS NQT ALL INPUT scenario/Strings/code.cpp", "content": "#include \n#include \n#include \nusing namespace std;\n\nvector input_array_format() {\n vector arr;\n string input;\n getline(cin, input);\n stringstream ss(input);\n char c;\n while (ss >> c) {\n if (isalpha(c)) {\n string element;\n ss >> element;\n arr.push_back(element);\n }\n }\n return arr;\n}\n\nvector input_space_separated() {\n vector arr;\n string input;\n getline(cin, input);\n stringstream ss(input);\n string element;\n while (ss >> element) {\n arr.push_back(element);\n }\n return arr;\n}\n\nvector input_array_size_not_given() {\n vector arr;\n string input;\n cout << \"Enter array elements (press Enter after each element, press Enter twice to stop):\" << endl;\n while (true) {\n string element;\n getline(cin, element);\n if (element.empty()) {\n break;\n }\n arr.push_back(element);\n }\n return arr;\n}\n\nint main() {\n // Case 1: ['A', 'B', 'C', 'D']\n cout << \"Case 1: ['A', 'B', 'C', 'D']\" << endl;\n vector arr1 = input_array_format();\n for (const string& element : arr1) {\n cout << element << \" \";\n }\n cout << endl;\n\n // Case 2: A B C D\n cout << \"Case 2: A B C D\" << endl;\n vector arr2 = input_space_separated();\n for (const string& element : arr2) {\n cout << element << \" \";\n }\n cout << endl;\n\n // Case with size not given\n cout << \"Case with size not given\" << endl;\n vector arr3 = input_array_size_not_given();\n for (const string& element : arr3) {\n cout << element << \" \";\n }\n cout << endl;\n\n return 0;\n}\n" }, { "path": "TCS NQT ALL INPUT scenario/Strings/code.java", "content": "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class InputExample {\n public static ArrayList inputArrayFormat() {\n ArrayList arr = new ArrayList<>();\n Scanner scanner = new Scanner(System.in);\n String input = scanner.nextLine();\n for (char c : input.toCharArray()) {\n if (Character.isLetter(c)) {\n arr.add(Character.toString(c));\n }\n }\n return arr;\n }\n\n public static ArrayList inputSpaceSeparated() {\n ArrayList arr = new ArrayList<>();\n Scanner scanner = new Scanner(System.in);\n String input = scanner.nextLine();\n Scanner ss = new Scanner(input);\n while (ss.hasNext()) {\n arr.add(ss.next());\n }\n return arr;\n }\n\n public static ArrayList inputArraySizeNotGiven() {\n ArrayList arr = new ArrayList<>();\n Scanner scanner = new Scanner(System.in);\n System.out.println(\"Enter array elements (press Enter after each element, press Enter twice to stop):\");\n while (true) {\n String element = scanner.nextLine().trim();\n if (element.isEmpty()) {\n break;\n }\n arr.add(element);\n }\n return arr;\n }\n\n public static void main(String[] args) {\n // Case 1: ['A', 'B', 'C', 'D']\n System.out.println(\"Case 1: ['A', 'B', 'C', 'D']\");\n System.out.println(inputArrayFormat());\n\n // Case 2: A B C D\n System.out.println(\"Case 2: A B C D\");\n System.out.println(inputSpaceSeparated());\n\n // Case with size not given\n System.out.println(\"Case with size not given\");\n System.out.println(inputArraySizeNotGiven());\n }\n}\n" }, { "path": "TCS NQT ALL INPUT scenario/Strings/code.py", "content": "def input_array_format():\n arr = list(map(str, input().strip(\"[]\").split(',')))\n return arr\n\ndef input_space_separated():\n arr = list(map(str, input().split()))\n return arr\n\ndef input_array_size_not_given():\n arr = []\n while True:\n element = input().strip()\n if not element:\n break\n arr.append(element)\n return arr\n\ndef main():\n # Case 1: ['A', 'B', 'C', 'D']\n print(\"Case 1: ['A', 'B', 'C', 'D']\")\n print(input_array_format())\n\n # Case 2: A B C D, Case with size not given\n print(\"Case 2: A B C D, Case with size not given\")\n print(input_space_separated())\n\nif __name__ == \"__main__\":\n main()\n" } ]