Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Swipe
๐ Job Title: SDE Intern
โ๐ป YOE: 2025 and 2026 grads
โก๏ธ Apply: https://www.ycombinator.com/companies/swipe-2/jobs/G3KCJ88-sde-intern
Please do share in your college grps and in case you are applying please react on this post:) ๐โค๏ธ
๐ Job Title: SDE Intern
โ๐ป YOE: 2025 and 2026 grads
โก๏ธ Apply: https://www.ycombinator.com/companies/swipe-2/jobs/G3KCJ88-sde-intern
Please do share in your college grps and in case you are applying please react on this post:) ๐โค๏ธ
Y Combinator
SDE, Intern at Swipe
Weโre looking for passionate engineers to join our team and assist with developing and maintaining our software products. The ideal candidate should have a passion for programming, be eager to learn, and be able to work in a team environment.
Roles & โฆ
Roles & โฆ
SELECT
ROUND(
(COUNT(CASE WHEN polygon_name = 'Adarsh Palm Retreat' THEN 1 END) * 100.0) /
COUNT(*),
2
) AS order_share
FROM
POLYGON
WHERE
order_date = '2020-12-31';
Swiggy Order share โ
SELECT
'within 100' AS BUCKET,
COUNT(*) AS Orders
FROM cuisine_orders
WHERE item_total <= 100
UNION ALL
SELECT
'within 150' AS BUCKET,
COUNT(*) AS Orders
FROM cuisine_orders
WHERE item_total <= 150
UNION ALL
SELECT
'within 200' AS BUCKET,
COUNT(*) AS Orders
FROM cuisine_orders
WHERE item_total <= 200
ORDER BY BUCKET;
Swiggy Bucket wise order โ
๐1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Diligent hiring for Software Engineer l
Bangalore
2024/2023/2022 passouts eligible
https://boards.greenhouse.io/diligentcorporation/jobs/5233594004?s=08
Bangalore
2024/2023/2022 passouts eligible
https://boards.greenhouse.io/diligentcorporation/jobs/5233594004?s=08
job-boards.greenhouse.io
Diligent Corporation
๐1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company: Dupont
Role: Frontend Developer
For Graduates: 2023, 2024
https://careers.dupont.com/us/en/job/239966W/Frontend-Developer-Trainee-IT-Fresher-Graduates-2024-23-Batch-only?s=08
Role: Frontend Developer
For Graduates: 2023, 2024
https://careers.dupont.com/us/en/job/239966W/Frontend-Developer-Trainee-IT-Fresher-Graduates-2024-23-Batch-only?s=08
๐1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Linkedin
25-July-2024 Update: No longer accepting the applications.
ADP is hiringโฆ | Sindhu Vegi | 61 comments
ADP is hiringโฆ | Sindhu Vegi | 61 comments
25-July-2024 Update: No longer accepting the applications.
ADP is hiring freshers who graduated in 2023 or 2024. DM me your resume for referral.
Engineering Graduates โ Associate Functional Consultant | Hyderabad | UK & US Shifts
Required Skills and Qualifications: โฆ
ADP is hiring freshers who graduated in 2023 or 2024. DM me your resume for referral.
Engineering Graduates โ Associate Functional Consultant | Hyderabad | UK & US Shifts
Required Skills and Qualifications: โฆ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
We're looking for an intern to work on a vision project at Mercedes Benz R&D India (MBRDI). The candidate should be available for 6 months (on site preferred) and should have some prior research experience and knowhow of latest vision trends like NeRF, SAM, CLIP, etc. Please DM a detailed paragraph of your research experience along with your CV or drop me an email at : vasudev.singh@mercedes-benz.com
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Parspec hiring for ML l
2023 and before batches eligible
https://jobs.lever.co/parspec/f2d3897d-3aee-42f1-937f-0861e93e95c7
2023 and before batches eligible
https://jobs.lever.co/parspec/f2d3897d-3aee-42f1-937f-0861e93e95c7
๐๐ฆ ๐๐น๐ด๐ผ ๐ป ๐ ใ๐๐ผ๐บ๐ฝ๐ฒ๐๐ถ๐๐ถ๐๐ฒ ๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ๐บ๐ถ๐ป๐ดใ
Photo
def calculate_prefix_sums(arr):
prefix_sums = [0] * len(arr)
prefix_sums[0] = arr[0]
for i in range(1, len(arr)):
prefix_sums[i] = prefix_sums[i - 1] + arr[i]
return prefix_sums
def count_balanced_partitions(prefix_sums):
total_sum = prefix_sums[-1]
count = 0
for i in range(len(prefix_sums) - 1):
if prefix_sums[i] == (total_sum - prefix_sums[i]):
count += 1
return count
def max_balanced_partitions(arr, k):
n = len(arr)
if n < 2:
return 0
prefix_sums = calculate_prefix_sums(arr)
original_count = count_balanced_partitions(prefix_sums)
max_count = original_count
for i in range(n):
new_arr = arr[:]
new_arr[i] = k
new_prefix_sums = calculate_prefix_sums(new_arr)
new_count = count_balanced_partitions(new_prefix_sums)
max_count = max(max_count, new_count)
return max_count
The dice roll challenge โ
prefix_sums = [0] * len(arr)
prefix_sums[0] = arr[0]
for i in range(1, len(arr)):
prefix_sums[i] = prefix_sums[i - 1] + arr[i]
return prefix_sums
def count_balanced_partitions(prefix_sums):
total_sum = prefix_sums[-1]
count = 0
for i in range(len(prefix_sums) - 1):
if prefix_sums[i] == (total_sum - prefix_sums[i]):
count += 1
return count
def max_balanced_partitions(arr, k):
n = len(arr)
if n < 2:
return 0
prefix_sums = calculate_prefix_sums(arr)
original_count = count_balanced_partitions(prefix_sums)
max_count = original_count
for i in range(n):
new_arr = arr[:]
new_arr[i] = k
new_prefix_sums = calculate_prefix_sums(new_arr)
new_count = count_balanced_partitions(new_prefix_sums)
max_count = max(max_count, new_count)
return max_count
The dice roll challenge โ
def maxPerformance(self, n: int, speed: List[int], efficiency: List[int], k: int) -> int:
cur_sum, h = 0, []
ans = -float('inf')
for i, j in sorted(zip(efficiency, speed),reverse=True):
while len(h) > k-1:
cur_sum -= heappop(h)
heappush(h, j)
cur_sum += j
ans = max(ans, cur_sum * i)
return ans % (10**9+7)
Tasty Dishes โ
cur_sum, h = 0, []
ans = -float('inf')
for i, j in sorted(zip(efficiency, speed),reverse=True):
while len(h) > k-1:
cur_sum -= heappop(h)
heappush(h, j)
cur_sum += j
ans = max(ans, cur_sum * i)
return ans % (10**9+7)
Tasty Dishes โ
๐1
ll cmp(const void *a, const void *b) {
return (*(ll*)a - *(ll*)b);
}
ll solve(vector<ll> a, ll k) {
ll n = a.size();
if (k < 2 || n < 2 * k - 1) return -1;
vector<ll> s = a;
qsort(s.data(), n, sizeof(ll), cmp);
for (ll t = k - 1; t < n; ++t) {
ll i = -1;
while (a[++i] != s[t]);
ll sz = 1;
ll li = i;
for (ll u = i; u >= 0; --u) {
if (u < li - 1 && a[u] <= s[t]) {
++sz;
li = u;
}
if (sz >= k) return s[t];
}
li = i;
for (ll u = i; u < n; ++u) {
if (u > li + 1 && a[u] <= s[t]) {
++sz;
li = u;
}
if (sz >= k) return s[t];
}
}
return -1;
}
//vulnerability
return (*(ll*)a - *(ll*)b);
}
ll solve(vector<ll> a, ll k) {
ll n = a.size();
if (k < 2 || n < 2 * k - 1) return -1;
vector<ll> s = a;
qsort(s.data(), n, sizeof(ll), cmp);
for (ll t = k - 1; t < n; ++t) {
ll i = -1;
while (a[++i] != s[t]);
ll sz = 1;
ll li = i;
for (ll u = i; u >= 0; --u) {
if (u < li - 1 && a[u] <= s[t]) {
++sz;
li = u;
}
if (sz >= k) return s[t];
}
li = i;
for (ll u = i; u < n; ++u) {
if (u > li + 1 && a[u] <= s[t]) {
++sz;
li = u;
}
if (sz >= k) return s[t];
}
}
return -1;
}
//vulnerability
def solution(menu, order):
t_cost = 0
for item in order:
pizza = next(p for p in menu if p.name == item.name)
price = getattr(pizza, f'price_{item.size[0]}')
total_cost += price * item.quantity
total_pizzas = sum(item.quantity for item in order)
if total_pizzas >= 3:
cheapest_price = min(getattr(next(p for p in menu if p.name == item.name), f'price_{item.size[0]}')
for item in order)
discounted_cost = t_cost - cheapest_price
return min(t_cost, discounted_cost)
return t_cost
def findMaxLength(str1, str2, str3):
m, n = len(str1), len(str2)
dp = [[0] * (n + 1) for _ in range(m + 1)]
for i in range(1, m + 1):
for j in range(1, n + 1):
if str1[i-1] == str2[j-1]:
if not has_common_substring(str1[:i], str2[:j], str3):
dp[i][j] = dp[i-1][j-1] + 1
else:
dp[i][j] = max(dp[i-1][j], dp[i][j-1])
else:
dp[i][j] = max(dp[i-1][j], dp[i][j-1])
return dp[m][n]
def has_common_substring(s1, s2, s3):
if len(s1) >= 2 and len(s2) >= 2:
last_two = s1[-2:]
if last_two in s3 and last_two == s2[-2:]:
return True
return False
DE Shaw โ
m, n = len(str1), len(str2)
dp = [[0] * (n + 1) for _ in range(m + 1)]
for i in range(1, m + 1):
for j in range(1, n + 1):
if str1[i-1] == str2[j-1]:
if not has_common_substring(str1[:i], str2[:j], str3):
dp[i][j] = dp[i-1][j-1] + 1
else:
dp[i][j] = max(dp[i-1][j], dp[i][j-1])
else:
dp[i][j] = max(dp[i-1][j], dp[i][j-1])
return dp[m][n]
def has_common_substring(s1, s2, s3):
if len(s1) >= 2 and len(s2) >= 2:
last_two = s1[-2:]
if last_two in s3 and last_two == s2[-2:]:
return True
return False
DE Shaw โ
๐1