Job related update

2022-07-30 13:18:39 #include

using namespace std;


int maxProfit(vector& Arr, int n)
{

vector> ahead(2,vector (3,0));

vector> cur(2,vector (3,0));


for(int ind = n-1; ind>=0; ind--){
for(int buy = 0; buy<=1; buy++){
for(int cap=1; cap<=2; cap++){

if(buy==0){
cur[buy][cap] = max(0+ahead[0][cap],
-Arr[ind] + ahead[1][cap]);
}

if(buy==1){
cur[buy][cap] = max(0+ahead[1][cap],
Arr[ind] + ahead[0][cap-1]);
}
}
}
ahead = cur;
}

return ahead[0][2];

}

int main() {

int n;
cin>>n;
vector prices;
for(int i=0;i{
int temp;
cin>>temp;
prices.push_back(temp);
}
cout<}

C++
Maximum profit trader Code
Telegram - @coding231

289 views10:18

Open / Comment

2022-07-30 13:10:00 All test cases are passed

C++ language

@coding231 Open / Comment

2022-07-30 13:09:48 Open / Comment

2022-07-30 13:01:16 #include
using namespace std;
#define ll long long int
ll solve(ll n)
{


ll position = 1;
ll m = 1;

while (!(n & m)) {


m = m << 1;
position++;
}
return position;
}
int main() {
// your code goes here
ll n,p;
cin>>n;
vector ans(n);
for(int i=0;i {
cin>>p;

ans[i] = solve(p+1);

}
for(int i=0;i cout< return 0;
}

C++

Telegram:- @coding231

154 views10:01

Open / Comment

2022-07-30 12:54:40 class Solution
{
public:
vector frequncey(string s)
{
vector freq(26, 0);
for (int i = 0; i < s.length(); i++)
freq[s[i] - 'a']++;
return freq;
}
vector wordSubsets(vector &words1, vector &words2)
{
vector ans;
vector Freq(26, 0);
for (auto &x : words2)
{
vector freq1 = frequncey(x);
for (int i = 0; i < 26; i++)
Freq[i] = max(freq1[i], Freq[i]);
}

for (auto &x : words1)
{
vector freq1 = frequncey(x);
bool flag = true;
for (int i = 0; i < 26; i++)
{
if (freq1[i] < Freq[i])
{
flag = false;
break;
}
}
if (flag)
ans.push_back(x);
}
return ans;
}
};

C++
Word Subsets
Telegram:- @coding231

348 views09:54

Open / Comment

2022-07-09 10:51:49 #include
#define n 3
using namespace std;

int findLongestFromACell(int i, int j, int mat[n][n], int dp[n][n])
{
if (i < 0 i >= n j < 0 || j >= n)
return 0;
if (dp[i][j] != -1)
return dp[i][j];
int x = INT_MIN, y = INT_MIN, z = INT_MIN, w = INT_MIN;
if (j < n - 1 && ((mat[i][j] + 1) == mat[i][j + 1]))
x = 1 + findLongestFromACell(i, j + 1, mat, dp);
if (j > 0 && (mat[i][j] + 1 == mat[i][j - 1]))
y = 1 + findLongestFromACell(i, j - 1, mat, dp);
if (i > 0 && (mat[i][j] + 1 == mat[i - 1][j]))
z = 1 + findLongestFromACell(i - 1, j, mat, dp);

if (i < n - 1 && (mat[i][j] + 1 == mat[i + 1][j]))
w = 1 + findLongestFromACell(i + 1, j, mat, dp);
return dp[i][j] = max({x, y, z, w, 1});
}
int LongestPath(int mat[n][n])
{
int result = 1;
int dp[n][n];
memset(dp, -1, sizeof dp);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (dp[i][j] == -1)
findLongestFromACell(i, j, mat, dp);
result = max(result, dp[i][j]);
}
}
return result;
}

int main()
{
int mat[n][n] = {{1, 2, 9}, {5, 3, 8}, {4, 6, 7}};
cout << "Length of the longest path is "
<< LongestPath(mat);
return 0;
}

239 views07:51

Open / Comment

2022-07-09 10:51:40 Open / Comment

2022-07-03 12:29:57 Verbal

1.are typical above

Is typically above fees plural

2. But even video games

3. Shortened then contracted to

5. Enticement



6-Put their heads together

Sit on the fence

Telegram -@coding231 Open / Comment

2022-06-05 09:33:35 EV_Positive Prefixes
Language C++14 Open / Comment

2022-06-05 09:20:58 All 3 codes all test cases are passed Open / Comment