function ArithGeoll(arr) { let arith = true; let d = Math.abs(arr[0]-
arr[1]);
for (let i = 2; i < arr.length; i++)
{ if (Math.abs(arr[i] - arr[i -
1]) !== d) {
arith = false;
}
}
if (arith) {
return "Arithmetic"; }
let geo = true; d = arr[1]/ arr[0];
for (let i = 2; i < arr.length; i++)
if (Math.abs(arr[i] / arr[i-
{
1]) !== d) {
geo = false;
}
}
if (geo) { return "Geometric";
}
if (larith && !geo) { return "-1";
}
}
@allcoding1_official
arr[1]);
for (let i = 2; i < arr.length; i++)
{ if (Math.abs(arr[i] - arr[i -
1]) !== d) {
arith = false;
}
}
if (arith) {
return "Arithmetic"; }
let geo = true; d = arr[1]/ arr[0];
for (let i = 2; i < arr.length; i++)
if (Math.abs(arr[i] / arr[i-
{
1]) !== d) {
geo = false;
}
}
if (geo) { return "Geometric";
}
if (larith && !geo) { return "-1";
}
}
@allcoding1_official
👍3
Nvidia answer
1)011
2)16
3)64 4)i) 100W
ii)OW iii)20W
iv)0.357
5)8 and 16
6)z=0
7)2:1
8)9
9)0.44
10)200
@allcoding1_official
11)40
12)3.0
13)16
14)750 and 50
15)500
16)60
17)5
18)657
19)250 and 96
20)24
@allcoding1_official
1)011
2)16
3)64 4)i) 100W
ii)OW iii)20W
iv)0.357
5)8 and 16
6)z=0
7)2:1
8)9
9)0.44
10)200
@allcoding1_official
11)40
12)3.0
13)16
14)750 and 50
15)500
16)60
17)5
18)657
19)250 and 96
20)24
@allcoding1_official
🔥3👍2👎2❤1
Company Name: Upstox
Role: SDE Intern
Batch eligible: 2023 and 2024 passouts
Apply: https://docs.google.com/forms/d/e/1FAIpQLSebiXUKhTEoHvCnZFPDCGPqart5Qt3X48ToLgHBY7caw2CFLA/viewform
@allcoding1_official
Role: SDE Intern
Batch eligible: 2023 and 2024 passouts
Apply: https://docs.google.com/forms/d/e/1FAIpQLSebiXUKhTEoHvCnZFPDCGPqart5Qt3X48ToLgHBY7caw2CFLA/viewform
@allcoding1_official
Company Name : Freshworks INC
Role : 1. Application Developer
2. Software Developer
Package Freshers: 5LPA
Package Experience (1-2 yrs) : 7.5 LPA
Skills Needed : Java , Python , HTML, CSS, Java Script, SQL and DBMS.
Location: Bangalore and Chennai (currently remote)
Passed out : 2021 - 2025
Round 1 : Coding Assessment Live in Google meet with interviewer (30 mins)
Round 2 : Technical Interview (30 mins)
Round 3 : HR Interview (20 mins)
https://docs.google.com/forms/d/e/1FAIpQLScSh9qPFBce3XvlCUbm4ZpIKuqTcN6IIsdTLPh2WXhAC4XRfQ/viewform?usp=sf_link
@allcoding1_official
Role : 1. Application Developer
2. Software Developer
Package Freshers: 5LPA
Package Experience (1-2 yrs) : 7.5 LPA
Skills Needed : Java , Python , HTML, CSS, Java Script, SQL and DBMS.
Location: Bangalore and Chennai (currently remote)
Passed out : 2021 - 2025
Round 1 : Coding Assessment Live in Google meet with interviewer (30 mins)
Round 2 : Technical Interview (30 mins)
Round 3 : HR Interview (20 mins)
https://docs.google.com/forms/d/e/1FAIpQLScSh9qPFBce3XvlCUbm4ZpIKuqTcN6IIsdTLPh2WXhAC4XRfQ/viewform?usp=sf_link
@allcoding1_official
👍8❤🔥2
Genpact Hiring
Role: Business Analyst
Apply Link:
https://genpact.taleo.net/careersection/sgy_external_career_section/jobdetail.ftl?job=BFS033345
@allcoding1_official
Role: Business Analyst
Apply Link:
https://genpact.taleo.net/careersection/sgy_external_career_section/jobdetail.ftl?job=BFS033345
@allcoding1_official
👍6❤1
Guys❤
👉 I am doing promotions (real Or fake) I don't know
👉I'm not forcing you. Your decision
👉I am not a responsible to you and money
👉 I need money that why I'm doing promotions try understand
👉 I am doing promotions (real Or fake) I don't know
👉I'm not forcing you. Your decision
👉I am not a responsible to you and money
👉 I need money that why I'm doing promotions try understand
👍11👎8⚡2❤1
🎯Revolut Off Campus Drive 2024 | Support Specialist | Work from home | 4-8 LPA
Job Role : Support Specialist
Qualification : Any Graduate
Location : Remote
Salary : 4-8 LPA
Apply Now:-
https://www.revolut.com/en-IN/careers/position/support-specialist-identity-and-verification-analyst-35ee6d79-acf3-4dcc-8544-19d8115f2ed6/
Telegram:- @allcoding1_official
Job Role : Support Specialist
Qualification : Any Graduate
Location : Remote
Salary : 4-8 LPA
Apply Now:-
https://www.revolut.com/en-IN/careers/position/support-specialist-identity-and-verification-analyst-35ee6d79-acf3-4dcc-8544-19d8115f2ed6/
Telegram:- @allcoding1_official
👍1
def check_first_and_last_char(Str):
if Str[0].isdigit() and not Str[-1].isdigit():
print("Yes")
elif Str[-1].isdigit() and not Str[0].isdigit():
print("No")
else:
print("Invalid input")
Str = input()
check_first_and_last_char(Str)
Python
@allcoding1_official
if Str[0].isdigit() and not Str[-1].isdigit():
print("Yes")
elif Str[-1].isdigit() and not Str[0].isdigit():
print("No")
else:
print("Invalid input")
Str = input()
check_first_and_last_char(Str)
Python
@allcoding1_official
❤1👍1
def check_digit_position(s):
if s[0].isdigit() and not s[-1].isdigit():
return "Yes"
elif not s[0].isdigit() and s[-1].isdigit():
return "No"
else:
return "Invalid input"
input_str = input().strip()
print(check_digit_position(input_str))
Python
@allcoding1_official
if s[0].isdigit() and not s[-1].isdigit():
return "Yes"
elif not s[0].isdigit() and s[-1].isdigit():
return "No"
else:
return "Invalid input"
input_str = input().strip()
print(check_digit_position(input_str))
Python
@allcoding1_official
👍3
🎯Qualcomm Off Campus Recruitment
Job Position:- IT Software Developer (UX/UI/Fullstack)
Job ID: 3058496
Qualification:- B.Tech
Batch:- 2019/2020/2021
Job Location:- Hyderabad, India
Department: Software Engineering
Salary Package:- As per Company Standards
Job Type:- Full-time
Last Date:- ASAP
Apply Now:- https://www.allcoding1.com/2024/02/qualcomm-off-campus-recruitment-2024.html?m=1
Telegram:- @allcoding1_official
Job Position:- IT Software Developer (UX/UI/Fullstack)
Job ID: 3058496
Qualification:- B.Tech
Batch:- 2019/2020/2021
Job Location:- Hyderabad, India
Department: Software Engineering
Salary Package:- As per Company Standards
Job Type:- Full-time
Last Date:- ASAP
Apply Now:- https://www.allcoding1.com/2024/02/qualcomm-off-campus-recruitment-2024.html?m=1
Telegram:- @allcoding1_official
Apply now:- https://www.allcoding1.com/2024/02/hcl-tech-off-campus-drive-for-multiple.html?m=1
Telegram:- @allcoding1_official
Telegram:- @allcoding1_official
👍5
int solve(vector<int>& arr) { int n = arr.size(); if (n == 0) return 0;
int maxLen = 1; int currLen = 1; bool f = true;
for (int i = 1; i < n; ++i) { if ((arr[i] > arr[i-1] && f) II (arr[i] < arr[i-1] && !f)) { ++currLen; } else {
maxLen = max(maxLen, currLen); currLen = 2; f = arr[i] > arr[i-1]; }
maxLen = max(maxLen, currLen); return maxLen; }
C++
Telegram:- @allcoding1_official
L&T
int maxLen = 1; int currLen = 1; bool f = true;
for (int i = 1; i < n; ++i) { if ((arr[i] > arr[i-1] && f) II (arr[i] < arr[i-1] && !f)) { ++currLen; } else {
maxLen = max(maxLen, currLen); currLen = 2; f = arr[i] > arr[i-1]; }
maxLen = max(maxLen, currLen); return maxLen; }
C++
Telegram:- @allcoding1_official
L&T
👍2
int solve(vector<int>& arr) { int narr.size(); if (n == 0) return 0;
int maxLen = 1;
int currLen = 1;
bool f = true;
for (int i = 1; i < n; ++i) { if ((arr[i] > arr[i-1] && f) || (arr[i] < arr[i-1] && !f)) { ++currLen; } else { maxLen = max(maxLen, currLen); currLen = 2;
f = arr[i] > arr[i-1]
}
}
maxLen = max(maxLen, currLen); return maxLen;
}
C++
Telegram:- @allcoding1_official
L&t
Q) Ever - increasing & ever decreasing array segments
int maxLen = 1;
int currLen = 1;
bool f = true;
for (int i = 1; i < n; ++i) { if ((arr[i] > arr[i-1] && f) || (arr[i] < arr[i-1] && !f)) { ++currLen; } else { maxLen = max(maxLen, currLen); currLen = 2;
f = arr[i] > arr[i-1]
}
}
maxLen = max(maxLen, currLen); return maxLen;
}
C++
Telegram:- @allcoding1_official
L&t
Q) Ever - increasing & ever decreasing array segments
👍1