🎯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

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

Telegram:-  @allcoding1_official

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

Q) Encryption by digits

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

getMinlength(vector<int>a,int k)

{

int ans=1;

long long mul=1;

for(int i=0;i<a.size();i++){

if(mul*a[i]>k){

ans++;

mul=a[i];

}

else{

mul*=a[i];

}

}

return ans;

}

L&T

@allcoding1_official

Q) compressing array

def helper(reward):

nums = []

for i in reward:

heappush(nums, -i)

ans = -heappop(nums)

i = 1

while nums:

temp = -heappop(nums)

if temp - i <= 0: break

ans += temp - i

i += 1

return ans

@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

🎯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

🎯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

🎯SAS Off Campus Drive 2024 – Associate Software Engineer – Freshers | Rs 4-8 LPA

Job Role : Associate Software Developer
Qualification : B.E/B/Tech/M.E. / M.Tech
Experience : Freshers
Job Location : Pune
Package : Rs 4-8 LPA

Apply Now:- https://www.allcoding1.com/2024/02/sas-off-campus-drive-2024-associate_9.html?m=1

Telegram:- @allcoding1_official

BST code
IBM

Telegram:- @allcoding1_official

Circle
IBM

Telegram:- @allcoding1_official

Minimum Moves code
IBM

Telegram:- @allcoding1_official

Virtual Machine
Wissen

Telegram:- @allcoding1_official

Minimum moves
Wissen

Telegram:- @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