Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Viyaan Technosoft is looking for UI/UX and web developer.
Job location:Kothrud,Pune
Experience:Interns/6 months of experience.
Please send your resume on mention email id
nishant@viyaantechnosoft.com
Job location:Kothrud,Pune
Experience:Interns/6 months of experience.
Please send your resume on mention email id
nishant@viyaantechnosoft.com
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
๐ MTS Software Engineer
Netapp
Freshers Can Try
https://careers.netapp.com/job/-/-/27600/56393705120?jobPipeline=RD_Programmatic&p_sid=HmFmRyb&p_uid=dxcJjjNjlV&ss=paid&utm_campaign=india&utm_content=pj_board&utm_medium=jobad&utm_source=indeed&dclid=CjgKEAjwhfipBhD3t9LclYmU3wsSJADzve54zZPosx0Ivg9L27YYdjKKEnEXR7G6ojZBtE7Twb_z0PD_BwE
Netapp
Freshers Can Try
https://careers.netapp.com/job/-/-/27600/56393705120?jobPipeline=RD_Programmatic&p_sid=HmFmRyb&p_uid=dxcJjjNjlV&ss=paid&utm_campaign=india&utm_content=pj_board&utm_medium=jobad&utm_source=indeed&dclid=CjgKEAjwhfipBhD3t9LclYmU3wsSJADzve54zZPosx0Ivg9L27YYdjKKEnEXR7G6ojZBtE7Twb_z0PD_BwE
Chat bot โ
Cognizant CSD
Cognizant CSD
Array answer โ
Cognizant CSD
Cognizant CSD
SELECT
DATE_FORMAT(date_field, '%Y-%m') AS month_year,
'Jobs' AS source,
COUNT(*) AS total_number
FROM
jobs
GROUP BY
month_year
UNION ALL
SELECT
DATE_FORMAT(date_field, '%Y-%m') AS month_year,
'Freelancers' AS source,
COUNT(*) AS total_number
FROM
freelancers
GROUP BY
month_year
ORDER BY
month_year ASC,
source ASC;
Freelancer โ
DATE_FORMAT(date_field, '%Y-%m') AS month_year,
'Jobs' AS source,
COUNT(*) AS total_number
FROM
jobs
GROUP BY
month_year
UNION ALL
SELECT
DATE_FORMAT(date_field, '%Y-%m') AS month_year,
'Freelancers' AS source,
COUNT(*) AS total_number
FROM
freelancers
GROUP BY
month_year
ORDER BY
month_year ASC,
source ASC;
Freelancer โ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
2023 female passouts , go apply for SDE-1 role at Flipkart.
This is applicable through referrals only.
This is applicable through referrals only.
Python 3โ
๐1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
CodeRush Hiring Challenge (Tomorrow at 9 PM)
Rewards:
1)Free Access to Coding Courses
2) Cash Prize worth Rs. 30,000
Registration is totally free!!
Link to register: https://bit.ly/CODERUSH_CHALLENGE
Rewards:
1)Free Access to Coding Courses
2) Cash Prize worth Rs. 30,000
Registration is totally free!!
Link to register: https://bit.ly/CODERUSH_CHALLENGE
#include <vector>
using namespace std;
long long minimumSplits(vector<int> arr) {
long long totalSplits = 0;
long long prevVal = arr.back();
for (int idx = arr.size() - 2; idx >= 0; idx--) {
totalSplits += (arr[idx] - 1) / prevVal;
long long numGroups = ((arr[idx] - 1) / prevVal + 1);
prevVal = arr[idx] / numGroups;
}
return totalSplits;
}
Break Sort
PayPal โ
using namespace std;
long long minimumSplits(vector<int> arr) {
long long totalSplits = 0;
long long prevVal = arr.back();
for (int idx = arr.size() - 2; idx >= 0; idx--) {
totalSplits += (arr[idx] - 1) / prevVal;
long long numGroups = ((arr[idx] - 1) / prevVal + 1);
prevVal = arr[idx] / numGroups;
}
return totalSplits;
}
Break Sort
PayPal โ
#include<bits/stdc++.h>
using namespace std;
string getLargestNumber(string num)
{
string ans ="",s="";
for(int i=0;i<(int)num.size()-1;i++)
{
if((num[i]-'0')%2==(num[i+1]-'0')%2)
s+=num[i];
else
{
s+=num[i];
sort(s.rbegin(),s.rend());
ans+=s;
s="";
}
}
s+=num[(int)num.size()-1];
sort(s.rbegin(),s.rend());
ans+=s;
return ans;
}
int main(){
string s;
cin>>s;
cout<<getLargestNumber(s);
}
Swap Parity โ
using namespace std;
string getLargestNumber(string num)
{
string ans ="",s="";
for(int i=0;i<(int)num.size()-1;i++)
{
if((num[i]-'0')%2==(num[i+1]-'0')%2)
s+=num[i];
else
{
s+=num[i];
sort(s.rbegin(),s.rend());
ans+=s;
s="";
}
}
s+=num[(int)num.size()-1];
sort(s.rbegin(),s.rend());
ans+=s;
return ans;
}
int main(){
string s;
cin>>s;
cout<<getLargestNumber(s);
}
Swap Parity โ