IBM Exam Coding Solutions Help

Apply link: https://app.joinsuperset.com/join/#/signup/student?jp=38d74885-556d-43a9-b493-4dcbd0f4af73

TCS BPS Fresher - Walkin Drive at Hyderabad - Telangana.

Eligiblity criteria:

Venue: TCS Deccan Park - Hyderabad Telangana
Date: 06th January 2024 (Saturday).

Registeration Time: 9:00 am to 11:00 am

Qualification - Full time graduation with BCom, BA, BSC CS/IT, BSC General, BBA, BBM, BMS, BAF, BBI as specialization with Year of passing as 2023.

IBM Hiring Freshers

Role: Software Developer

Eligibility: All graduates

Apply link: https://krb-sjobs.brassring.com/TGnewUI/Search/home/HomeWithPreLoad?partnerid=26059&siteid=5016&PageType=JobDetails&jobid=702950#jobDetails=702950_5016

Note: You will exam link in an hour, so apply asap

Apply link: https://forms.office.com/pages/responsepage.aspx?id=G5DqmG3d6Ua0iwbPtjtV6f0Awx5hHv9HvThaIPBW15FURE9ORzNRTUs2NUc1NFVCWE5VUVJCVEEwMC4u&origin=QRCode&qrcodeorigin=presentation


#contact
Email: [email protected]

Exam: IBM OA
Code: Python
Status: Passed

#include <bits/stdc++.h>

using namespace std;

int
main ()
{
  string s1;
  cin >> s1;
  int n, x, z;
  cin >> n >> x;
  int arr[x];

  for (int i = 0; i < x; i++)
    {
      cin >> arr[i];
    }

  sort (arr, arr + x);

  for (int i = 0; i < x; i++)
    {
      if (arr[i] >= n)
  {
    z = i;
    break;
  }
    }

  if (s1 == "UP" || s1 == "DN")
    {
      if (s1 == "UP")
  {
    for (int i = z; i < x; i++)
      {
        cout << arr[i] << endl;
      }
    for (int i = z - 1; i >= 0; i--)
      {
        cout << arr[i] << endl;
      }


  }
      else if (s1 == "DN")
  {

    for (int i = z - 1; i >= 0; i--)
      {
        cout << arr[i] << endl;
      }
    for (int i = z; i < x; i++)
      {
        cout << arr[i] << endl;
      }


  }
    }
  else
    cout << "Invalid input";




  return 0;
}


Exam name: IBM
Code language: C++
Status: Passed

Exam name: Oracle
Ques : Difference between two json objects

Help by Tg: @codinginfo

Question: Max energy sum


def max_energy_sum(ener):
max_sum = float('-inf')

for i in range(len(ener) - 1):
for j in range(i + 1, len(ener)):
current_sum = ener[i] + ener[j]
max_sum = max(max_sum, current_sum)

return max_sum


Language: Python
Exam: Tech Mahindra
Tg: @prephints

to reverse the data before transmitting Question


s = input()
res = 0
left,right =0,len(s)-1
while left < right:
if s[left] == s[right]:
res += 2
left += 1
right -= 1

print(res)


#Language: python 3
Exam : Tech Mahindra

Today Accenture Coding Solutions
All test cases passed

@prep.hints

def assess_progress(N, data):
    for week in range(N):
        week_data = data[week]
        if week == 0:
            print("Healthy" if week_data[-1] <= week_data[0] else "Unhealthy")
        else:
            previous_week_data = data[week - 1]
            if week_data[0] <= previous_week_data[-1]:
                print("Healthy")
            else:
                print("Unhealthy")

N = int(input())
data = []
for _ in range(N):
    week_count = input().strip()
    data.append([int(digit) for digit in week_count])


assess_progress(N, data)

---------------------------------------------------

#Health Status Code Python

Deloitte Coding Solution