Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company: Jio hoster
Role: Business Development Associate
Expected CTC: 12 LPA
Batch Eligible: Any
Website: https://jiohoster.com/jobs/business-development-associate/
Role: Business Development Associate
Expected CTC: 12 LPA
Batch Eligible: Any
Website: https://jiohoster.com/jobs/business-development-associate/
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Zomato is hiring android developers
Do apply at
mailto:asheesh.a@zomato.com
Do apply at
mailto:asheesh.a@zomato.com
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Fresh2Home Hiring
Role: Software Developer
Eligibility: Any graduate
https://careers.fresh2home.com/#!/job-view/software-developer-bangalore-2024061213575155?source=linkedin
Role: Software Developer
Eligibility: Any graduate
https://careers.fresh2home.com/#!/job-view/software-developer-bangalore-2024061213575155?source=linkedin
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Tutero is hiring Backend Engineer
For 2022, 2021 grads
Location - Remote (Australia)
Apply - https://www.linkedin.com/jobs/view/3961938743
For 2022, 2021 grads
Location - Remote (Australia)
Apply - https://www.linkedin.com/jobs/view/3961938743
Linkedin
Tutero hiring Backend Software Engineer in India | LinkedIn
Posted 11:21:54 PM. We are Tutero, one of Australiaโs fastest-growing AI EdTech companies. Our software engineeringโฆSee this and similar jobs on LinkedIn.
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
SmartBear is hiring for Associate Software Engineer Intern
Expected Stipend: Competitive
Apply here:
https://boards.greenhouse.io/smartbear/jobs/5967744003
Expected Stipend: Competitive
Apply here:
https://boards.greenhouse.io/smartbear/jobs/5967744003
boards.greenhouse.io
Developers' Academy โ Associate Software Engineer Intern
Bengaluru, Karnataka, India
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Indium Software
Indium Software - Test Engineer in Bengaluru
Indium Software Title: Test Engineer Education Qualification: Bachelorโs degree in computer science, Information Technology, or a related field Work E
๐1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Zensar
FRESHER
JD : We are looking to hire fresh Engineering graduates (BE /BTech) with IT (Information Technology /Computer Science) background. Successful candidates have to work in one or more technology, which may include Windows and Virtualization, Network, Data baseโฆ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
NCS Off Campus Drive 2024 Details:
Job Role: Freshers
Qualification: B.E/B.Tech/B.Sc/BCA
Batch: 2023 & 2024
Experience: Freshers
Job Location: Pune
https://forms.office.com/pages/responsepage.aspx?id=9diQymOJbku8qZrEaLzHqNxQYEspi3tPmcHfMEubmiVUQ0tQTk1TMVNEM0Q4Tk1ET0NBRE1RTzlVMy4u&web=1&wdLOR=c0595B219-58D3-4DF7-AC2D-DC19256255CB
Job Role: Freshers
Qualification: B.E/B.Tech/B.Sc/BCA
Batch: 2023 & 2024
Experience: Freshers
Job Location: Pune
https://forms.office.com/pages/responsepage.aspx?id=9diQymOJbku8qZrEaLzHqNxQYEspi3tPmcHfMEubmiVUQ0tQTk1TMVNEM0Q4Tk1ET0NBRE1RTzlVMy4u&web=1&wdLOR=c0595B219-58D3-4DF7-AC2D-DC19256255CB
๐2
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company: Samagra Governance
Location: N/A
Role: Devops Intern
For Graduates: 2023, 2024, 2025, 2026
https://www.linkedin.com/posts/singhalkarun_hiringnow-activity-7214113392364593152-5bha
Location: N/A
Role: Devops Intern
For Graduates: 2023, 2024, 2025, 2026
https://www.linkedin.com/posts/singhalkarun_hiringnow-activity-7214113392364593152-5bha
Linkedin
Karun Agarwal on LinkedIn: Weโre still welcoming applications, so if you missed the initial postโฆ
Weโre still welcoming applications, so if you missed the initial post, thereโs still time to join our dynamic team. Donโt miss out on this fantasticโฆ
โค1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name : Swiggy
Role : ASDE, SDE 1 and SDET
Batch : 2024,2023,2022,2021 passouts
Link : https://docs.google.com/forms/d/e/1FAIpQLSdPtswFrJv8T1aa2Fn1wkOI369w1ACHtL048WQuLYLk04LddA/viewform?pli=1
Role : ASDE, SDE 1 and SDET
Batch : 2024,2023,2022,2021 passouts
Link : https://docs.google.com/forms/d/e/1FAIpQLSdPtswFrJv8T1aa2Fn1wkOI369w1ACHtL048WQuLYLk04LddA/viewform?pli=1
๐1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
๐NxtJob.ai is hiring for Frontend Developer (Internship)
Apply here:
https://linkedin.com/jobs/view/3962976884/?alternateChannel=search
Apply here:
https://linkedin.com/jobs/view/3962976884/?alternateChannel=search
Linkedin
NxtJob.ai hiring Frontend Developer (Internship) in Bengaluru, Karnataka, India | LinkedIn
Posted 4:52:29 PM. Job descriptionWe are seeking a highly skilled Frontend Developer Intern to join us at NxtJob.aiโฆSee this and similar jobs on LinkedIn.
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
๐Avua is hiring for Junior Software Engineer Remote
Apply here:
https://linkedin.com/jobs/view/3965021918/
Apply here:
https://linkedin.com/jobs/view/3965021918/
Linkedin
avua hiring Junior Software Engineer in APAC | LinkedIn
Posted 1:28:09 AM. Note: This is for one of our clients, not avua directly
Responsibilities:Collaborate with clientsโฆSee this and similar jobs on LinkedIn.
Responsibilities:Collaborate with clientsโฆSee this and similar jobs on LinkedIn.
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Snoodify is hiring Backend Interns
For 2024, 2025, 2026 Grads
Location - Delhi
Stipend - 18k/month
Potential FT comp - 9-12 LPA
https://www.linkedin.com/posts/dheekshithkumar_backend-developer-hiring-post-ugcPost-7211374996999262208-km92
For 2024, 2025, 2026 Grads
Location - Delhi
Stipend - 18k/month
Potential FT comp - 9-12 LPA
https://www.linkedin.com/posts/dheekshithkumar_backend-developer-hiring-post-ugcPost-7211374996999262208-km92
Linkedin
we're hiring backend developers! | Dheekshith Kumar
we're hiring backend developers!
โ โ โ do share this amongst your connections, โ โ โ
โ โ โ comment or repost. โ โ โ
โ โ โ this would help them as well as us! โ โ โ
backend developer
location: saket, south delhi (offline)
stipend: starting from 18K INR per month
potentialโฆ
โ โ โ do share this amongst your connections, โ โ โ
โ โ โ comment or repost. โ โ โ
โ โ โ this would help them as well as us! โ โ โ
backend developer
location: saket, south delhi (offline)
stipend: starting from 18K INR per month
potentialโฆ
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
vector<int> getNumStrings(int k, vector<vector<int>>& queries) {
int max_length = 0;
for (const auto& query : queries) {
max_length = max(max_length, query[1]);
}
vector<int> dp(max_length + 1, 0);
dp[0] = 1;
for (int i = 1; i <= max_length; ++i) {
dp[i] = dp[i - 1];
if (i >= k) {
dp[i] = (dp[i] + dp[i - k]) % MOD;
}
}
vector<int> prefix_sum(max_length + 1, 0);
for (int i = 1; i <= max_length; ++i) {
prefix_sum[i] = (prefix_sum[i - 1] + dp[i]) % MOD;
}
vector<int> results;
for (const auto& query : queries) {
int L = query[0];
int R = query[1];
int result = (prefix_sum[R] - prefix_sum[L - 1] + MOD) % MOD;
results.push_back(result);
}
return results;
}
DE Shaw โ
using namespace std;
const int MOD = 1e9 + 7;
vector<int> getNumStrings(int k, vector<vector<int>>& queries) {
int max_length = 0;
for (const auto& query : queries) {
max_length = max(max_length, query[1]);
}
vector<int> dp(max_length + 1, 0);
dp[0] = 1;
for (int i = 1; i <= max_length; ++i) {
dp[i] = dp[i - 1];
if (i >= k) {
dp[i] = (dp[i] + dp[i - k]) % MOD;
}
}
vector<int> prefix_sum(max_length + 1, 0);
for (int i = 1; i <= max_length; ++i) {
prefix_sum[i] = (prefix_sum[i - 1] + dp[i]) % MOD;
}
vector<int> results;
for (const auto& query : queries) {
int L = query[0];
int R = query[1];
int result = (prefix_sum[R] - prefix_sum[L - 1] + MOD) % MOD;
results.push_back(result);
}
return results;
}
DE Shaw โ
๐1
long getMaxScore(int n, vector<vector<int>> score) {
vector<vector<long long>> maxs(n+1,vector<long long>(11,0LL)) , d(n+1,vector<long long>(11,0LL));
for(int i=0;i<=9;i++) maxs[0][i]=score[i][0];
vector<long long> v1(11,0) ,v2(11,0);
for(int i=1;i<n;++i){
vector<long long> v3(11,0LL);
v2=v3;
for(int j=0;j<=9;j++){
long long cur=-1,val=-1e12;
for(int k=0;k<=9;k++){
if(maxs[i-1][k]+score[k][j]>val){
val=maxs[i-1][k]+score[k][j];
cur=k;
}
v2[k]=max(v2[k],v1[j]+score[j][k]);
}
d[i][j]=cur;
maxs[i][j]=val;
}
v1=v2;
}
long long res=0;
for(int i=0;i<=9;i++) res=max(res,v1[i]);
return res;
}
DE Shaw โ
vector<vector<long long>> maxs(n+1,vector<long long>(11,0LL)) , d(n+1,vector<long long>(11,0LL));
for(int i=0;i<=9;i++) maxs[0][i]=score[i][0];
vector<long long> v1(11,0) ,v2(11,0);
for(int i=1;i<n;++i){
vector<long long> v3(11,0LL);
v2=v3;
for(int j=0;j<=9;j++){
long long cur=-1,val=-1e12;
for(int k=0;k<=9;k++){
if(maxs[i-1][k]+score[k][j]>val){
val=maxs[i-1][k]+score[k][j];
cur=k;
}
v2[k]=max(v2[k],v1[j]+score[j][k]);
}
d[i][j]=cur;
maxs[i][j]=val;
}
v1=v2;
}
long long res=0;
for(int i=0;i<=9;i++) res=max(res,v1[i]);
return res;
}
DE Shaw โ
vector<int> assignTasks(int n, vector<int>& s, vector<int>& e, int k, vector<int>& t) {
vector<int> wt(k, -1);
vector<pair<int, int>> srv;
for (int i = 0; i < n; ++i) {
srv.push_back({s[i], e[i]});
}
sort(srv.begin(), srv.end());
auto findSrv = [&](int tt) -> int {
int lo = 0, hi = n - 1;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
if (srv[mid].first <= tt && tt < srv[mid].second) {
return 0;
} else if (tt < srv[mid].first) {
if (mid == 0 || tt >= srv[mid - 1].second) {
return srv[mid].first - tt;
}
hi = mid - 1;
} else {
lo = mid + 1;
}
}
return -1;
};
for (int i = 0; i < k; ++i) {
wt[i] = findSrv(t[i]);
}
return wt;
}
// getwaitingtime
DE Shaw โ
vector<int> wt(k, -1);
vector<pair<int, int>> srv;
for (int i = 0; i < n; ++i) {
srv.push_back({s[i], e[i]});
}
sort(srv.begin(), srv.end());
auto findSrv = [&](int tt) -> int {
int lo = 0, hi = n - 1;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
if (srv[mid].first <= tt && tt < srv[mid].second) {
return 0;
} else if (tt < srv[mid].first) {
if (mid == 0 || tt >= srv[mid - 1].second) {
return srv[mid].first - tt;
}
hi = mid - 1;
} else {
lo = mid + 1;
}
}
return -1;
};
for (int i = 0; i < k; ++i) {
wt[i] = findSrv(t[i]);
}
return wt;
}
// getwaitingtime
DE Shaw โ
Transaction.java
TransactionManager.java
package src.main.java;
public class Transaction implements Comparable<Transaction> {
private int transactionId;
private double amount;
public Transaction(int transactionId, double amount) {
this.transactionId = transactionId;
this.amount = amount;
}
public int getTransactionId() {
return transactionId;
}
public double getAmount() {
return amount;
}
@Override
public int compareTo(Transaction other) {
return Integer.compare(this.transactionId, other.transactionId);
}
@Override
public String toString() {
return "Transaction{" +
"transactionId=" + transactionId +
", amount=" + amount +
'}';
}
}
TransactionManager.java
package src.main.java;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;
import java.util.List;
public class TransactionManager {
private List<Transaction> transactions;
public TransactionManager() {
this.transactions = new ArrayList<>();
}
public void addTransaction(Transaction transaction) {
transactions.add(transaction);
}
public void removeTransactionById(int transactionId) {
Iterator<Transaction> iterator = transactions.iterator();
while (iterator.hasNext()) {
Transaction transaction = iterator.next();
if (transaction.getTransactionId() == transactionId) {
iterator.remove();
break;
}
}
}
public void sortTransactionsById() {
Collections.sort(transactions);
}
public void sortTransactionsByAmount() {
transactions.sort((t1, t2) -> Double.compare(t1.getAmount(), t2.getAmount()));
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
for (Transaction transaction : transactions) {
sb.append(transaction.toString()).append("\n");
}
return sb.toString();
}
public static void main(String[] args) {
TransactionManager manager = new TransactionManager();
manager.addTransaction(new Transaction(1, 100.50));
manager.addTransaction(new Transaction(2, 200.75));
manager.addTransaction(new Transaction(3, 50.25));
System.out.println("Transactions:");
System.out.println(manager);
manager.removeTransactionById(2);
System.out.println("After removing transaction with ID 2:");
System.out.println(manager);
manager.sortTransactionsById();
System.out.println("After sorting by transaction ID:");
System.out.println(manager);
manager.sortTransactionsByAmount();
System.out.println("After sorting by amount:");
System.out.println(manager);
}
}