allcoding1_official

🎯Atos Is Hiring Degree:- Any Graduate Batch:- 2019, 2020, 2021, 2022, 2023 & 2024 Apply Now:- https://www.allcoding1.com/2024/02/atos-off-campus-drive-for-any-graduate.html Telegram:- @allcoding1_official

🎯IBM off campus recruitment https://careers.ibm.com/job/19856316/mobile-developer-intern-mumbai-in/?codes=Appcast_Indeed_O&ccuid=51541315202&_ccid=1707306517128osrvsiuxq&ittk=FESUCW14AW

public class Solution {     public static int longestArraySegment(int array_length, List<Integer> arr) {         int maxLength = 1;         int currentLength = 1;         for (int i = 1; i < array_length; i++) {             if (arr.get(i) > arr.get(i - 1)) {                 currentLength++;             } else {                 currentLength = 1;             }             maxLength = Math.max(maxLength, currentLength);         }         currentLength = 1;         for (int i = 1; i < array_length; i++) {             if (arr.get(i) < arr.get(i - 1)) {                 currentLength++;             } else {                 currentLength = 1;             }             maxLength = Math.max(maxLength, currentLength);         }         return maxLength;     } Ever increasing and ever decreasing - L&T Java Telegram:- @allcoding1_official

int solve(vector<int>& A) { int s = 0; for (const auto&n: A) { string sn = to_string(n); char md = *max_element(sn.begin(). sn.end()); s += md-'0'; } return s; } C++ Telegram:- @allcoding1_official L&t Encryption by digits

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 solve(vector& 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++

any paid promotion DM :- @Priya_i

Cognizant is hiring❤️ Apply link: https://t.me/itjoblinks Join our group for daily job posts #paid promotion

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

🎯Position: Accountant Trainee Location: Coimbatore Experience: Fresher Qualification: B.Com. 2023 passed out https://careers.banfico.com/jobs/Careers/31483000015926001/Accountant-Trainee?source=CareerSite&t=807

any paid promotion DM :- @Priya_i

Cognizant is hiring❤️ Apply link: https://t.me/itjoblinks Join our group for daily job posts #paid promotion

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

Cognizant is hiring❤️ Apply link: https://t.me/itjoblinks Join our group for daily job posts #paid promotion

Cognizant is hiring❤️ Apply link: https://t.me/itjoblinks Join our group for daily job posts #paid promotion

any paid promotion DM :- @Priya_i

Apply now:- https://www.allcoding1.com/2024/02/hcl-tech-off-campus-drive-for-multiple.html?m=1 Telegram:-  @allcoding1_official

🎯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

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))