APURV CHUDASAMA

Technical Coordinator

CSPIT•  May 2023 - Present

Led multiple events including hackathons, expert talks, and the tech fest "Cognizance 2024".

Secretary

IEEE CSPIT SB•  September 2024 - Present

Organized and coordinated IEEE chapter activities, ensuring smooth operations and member engagement.

Data Science Intern

NullClass•  May 2024 - July 2024

Worked on a real-world computer vision project as part of a 4-member team.

Charusat

Computer Science, B.Tech•  February 2024 - Present•  CGPA: 5.5

Code 1: string isomers #include <iostream> #include <vector> using namespace std; bool areIsomorphic(string s, string t) { if (s.length() != t.length()) { return false; } vector<int> mapS(256, -1); // Hashtable for mapping characters from s to t vector<int> mapT(256, -1); // Hashtable for mapping characters from t to s for (int i = 0; i < s.length(); i++) { char charS = s[i]; char charT = t[i]; if (mapS[charS] == -1 && mapT[charT] == -1) { // Create the mapping mapS[charS] = charT; mapT[charT] = charS; } else if (mapS[charS] != charT || mapT[charT] != charS) { // Check if the existing mapping is consistent return false; } } return true; } int main() { string s = "foo"; string t = "bar"; if (areIsomorphic(s, t)) { cout << "Isomorphic (Yes)" << endl; } else { cout << "Not Isomorphic (No)" << endl; } return 0; } Code 2: range sum #include <iostream> #include <vector> using namespace std; int rangeSum(const vector<int>& arr, int l, int r) { int sum = 0; for (int i = l; i <= r; i++) { sum += arr[i]; } return sum; } int main() { vector<int> arr = {3, 2, 5, 1, 6, 4, 2}; int l = 2, r = 5; cout << "Sum of elements from index " << l << " to " << r << " is: " << rangeSum(arr, l, r) << endl; return 0; } code 3 : virus spred #include <iostream> #include <vector> #include <algorithm> using namespace std; pair<int, int> virusSpread(const vector<int>& positions, int n) { vector<bool> infected(n, false); // Largest spread scenario for (int pos : positions) { for (int i = max(0, pos - 2); i <= min(n - 1, pos + 2); i++) { infected[i] = true; } } int maxSpread = count(infected.begin(), infected.end(), true); // Smallest spread scenario vector<bool> visited(n, false); int minSpread = 0; for (int pos : positions) { if (!visited[pos]) { minSpread++; for (int i = max(0, pos - 2); i <= min(n - 1, pos + 2); i++) { visited[i] = true; } } } return {minSpread, maxSpread}; } int main() { int n = 10; // Total number of people vector<int> infectedPositions = {2, 6}; // Initial infected positions (0-based indexing) pair<int, int> result = virusSpread(infectedPositions, n); cout << "Smallest number of infected people: " << result.first << endl; cout << "Largest number of infected people: " << result.second << endl; return 0; } code4: make it anno #include <iostream> #include <vector> #include <algorithm> using namespace std; int countInversions(const vector<int>& arr) { int n = arr.size(); int inversions = 0; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (arr[i] > arr[j]) { inversions++; } } } return inversions; } int maximizeAngriness(vector<int>& arr, int k) { int n = arr.size(); for (int swaps = 0; swaps < k; swaps++) { int maxIncrease = 0; int bestI = -1, bestJ = -1; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { swap(arr[i], arr[j]); int newInversions = countInversions(arr); swap(arr[i], arr[j]); if (newInversions > maxIncrease) { maxIncrease = newInversions; bestI = i; bestJ = j; } } } if (bestI != -1 && bestJ != -1) { swap(arr[bestI], arr[bestJ]); } else { break; } } return countInversions(arr); } int main() { vector<int> arr = {3, 2, 1}; // Initial arrangement int k = 2; // Number of swaps allowed int maxAngriness = maximizeAngriness(arr, k); cout << "Maximum angriness (inversions): " << maxAngriness << endl; return 0; }