All generations.

generate functionMon, 02 Jan 2023

how to reverse array?

void reverse(int a[], int n) { for(int i = 0; i < n / 2; i++) { int temp = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = temp; } } int a[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; reverse(a, 10); for(int i = 0; i < 10; i++) { printf("%d ", a[i]); }

C++
View
generate functionSat, 07 Jan 2023

how to generate sub-arrays from an array?

#include <iostream> #include <vector> using namespace std; int main() { int n = 5; int m = 3; vector<int> arr = {1, 2, 3, 4, 5}; int count = 0; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { for (int k = j + 1; k < n; k++) { if (arr[i] + arr[j] + arr[k] < m) { count++; } } } } cout << count << endl; return 0; }

C++
View
generate functionMon, 23 Jan 2023

how to replace a string

string replacestring(string str, string old, string new){ while (str.find(old) != string::npos){ str.replace(str.find(old), old.size(), new); } return str; } string str("I will replace every 'o' with 'a'."); replacestring(str, "o", "a");

C++
View
generate functionMon, 23 Jan 2023

how to replace a string

#include<iostream> #include<string> using namespace std; void replaceword(string str, string s1,string s2) { size_t n=0; while((n=str.find(s1,n))!=string::npos) { str.replace(n,s1.size(),s2); n+=s2.size(); } cout<<str<<endl; } int main() { string str,s1,s2; getline(cin,str); getline(cin,s1); getline(cin,s2); replaceword(str,s1,s2); return 0; }

C++
View
generate functionSun, 15 Jan 2023

how to find the subsequences of an array

vector<vector<int>> findSubsequences(vector<int>& nums) { vector<vector<int>> res; vector<int> sub; subsequence(nums, res, sub, 0); return res; } void subsequence(vector<int>& nums, vector<vector<int>>& res, vector<int>& sub, int pos) { if(sub.size()>=2){ res.push_back(sub); } unordered_set<int> hash; for(int i=pos; i<nums.size(); i++) { if((sub.size() == 0 || nums[i] >= sub.back()) && hash.find(nums[i]) == hash.end()) { sub.push_back(nums[i]); subsequence(nums, res, sub, i+1); sub.pop_back(); hash.insert(nums[i]); } } }

C++
View
generate functionSun, 15 Jan 2023

how to find the subsequences of an array

vector<vector<int>> subsequences(vector<int> a) { vector<vector<int>> sol; // base case if (a.empty()){ sol.push_back({}); return sol; } int n = a.size(); int last = a[n - 1]; a.pop_back(); vector<vector<int>> smaller = subsequences(a); for (auto i : smaller) { sol.push_back(i); } for (auto i : smaller) { vector<int> temp = i; temp.push_back(last); sol.push_back(temp); } return sol; } int main() { vector<int> a = {1, 2, 3, 4}; vector<vector<int>> sol = subsequences(a); for (auto i : sol) { for (auto j : i) { cout << j << " "; } cout << end

C++
View
generate functionMon, 23 Jan 2023

how to replace a string

#include <iostream> void replace(char s[], char oldChar, char newChar) { for (int i = 0; s[i] != '\0'; i++) { if (s[i] == oldChar) { s[i] = newChar; } } } int main(int argc, char const *argv[]) { char s[] = "hello"; replace(s, 'l', 'z'); std::cout << s << std::endl; return 0; }

C++
View
generate functionSun, 15 Jan 2023

how to find the subsequences of an array

void subsequence(char *in, char *out, int i, int j) { // Base Case if (in[i] == '\0') { out[j] = '\0'; cout << out << endl; return; } // Recursive Case // include the ith character out[j] = in[i]; subsequence(in, out, i + 1, j + 1); subsequence(in, out, i + 1, j); }

C++
View
generate functionMon, 23 Jan 2023

how to sort a string

string sort (string s) { int n = s.length(); for (int i = 0; i < n-1; i++) { for (int j = i+1; j < n; j++) { if (s[i] > s[j]) { char temp = s[i]; s[i] = s[j]; s[j] = temp; } } } return s; }

C++
View
generate functionTue, 24 Jan 2023

how to shift an array to the right

class Solution { public: void rotate(vector<int>& nums, int k) { int n = nums.size(); k = k % n; reverse(nums.begin(), nums.end()); reverse(nums.begin(), nums.begin() + k); reverse(nums.begin() + k, nums.end()); } };

C++
View
generate functionSun, 15 Jan 2023

how to find the subsequences of an array

vector<vector<int>> subsequences(vector<int> arr, int index){ if(index == 0){ return {{}, {arr[0]}}; } vector<vector<int>> smallAns = subsequences(arr, index - 1); int n = smallAns.size(); for(int i = 0; i < n; i++){ vector<int> v = smallAns[i]; v.push_back(arr[index]); smallAns.push_back(v); } return smallAns; }

C++
View
generate functionMon, 02 Jan 2023

generate irt model

def generate_irt( n_students: int, n_questions: int, a: float = 1, b: float = 1, c: float = 0.5, a_values: np.ndarray = None, b_values: np.ndarray = None, c_values: np.ndarray = None, seed: int = 1 ) -> (np.ndarray, np.ndarray, np.ndarray, np.ndarray): np.random.seed(seed) if a_values is None: a_values = np.random.uniform(low=0, high=a, size=n_questions) else: assert a_values.shape == (n_questions,) if b_values is None: b_values = np.random.uniform(low=0, high=b, size=n_questions) else: assert b_values.shape == (n_questions,) if c_values is None

Python
View
generate functionWed, 25 Jan 2023

The number that has the maximum number of divisors inside an array

int solution(vector<int> &A) { int answer = 0; int max_cnt = 0; vector<int>::size_type i = 0; vector<int>::size_type len = A.size(); while(i < len) { int num = A[i]; vector<int>::size_type j = i + 1; int cnt = 1; while(j < len) { if (A[j] == num) { cnt += 1; A.erase(A.begin() + j); len = A.size(); } else { j++; } } if(max_cnt < cnt) { max_cnt = cnt; answer = num; } i++; } return answer; }

C++
View
generate functionMon, 02 Jan 2023

how to reverse array?

int[] reverse(int[] arr) { for (int i = 0; i < arr.length / 2; i++) { int tmp = arr[i]; arr[i] = arr[length - i - 1]; arr[length - i - 1] = tmp; } return arr; }

C++
View
generate functionThu, 26 Jan 2023

how to convert the last 3 characters on a string into an int

const char* get_substring(const char* str) { char* res = new char[4]; strncpy(res, str + strlen(str) - 3, 3); return res; } int convert_substring_to_int(const char* str) { int result = 0; for (int i = 0; i < 3; i++) { result = result * 10 + (str[i] - '0'); } return result; } int process(const char* str) { return convert_substring_to_int(get_substring(str)); }

C++
View
generate functionSun, 15 Jan 2023

how to find the subsequences of an array

void printPowerSet(int *set, int set_size) { /*set_size of power set of a set with set_size n is (2**n -1)*/ unsigned int pow_set_size = pow(2, set_size); int counter, j; /*Run from counter 000..0 to 111..1*/ for(counter = 0; counter < pow_set_size; counter++) { for(j = 0; j < set_size; j++) { /* Check if jth bit in the counter is set If set then pront jth element from set */ if(counter & (1<<j)) printf("%d", set[j]); } printf("\n"); } } /*Driver program to test printPowerSet*/ int main() { int set[] = {1,2,3}; printPowerSet(set, 3); getchar(); return 0; }

C++
View

Questions about programming?Chat with your personal AI assistant