🎯Cognizant Hiring Entry Level Project Associate – Java | 4.2 LPA

Job Role : Project Associate – Java
Qualification : Graduate / Engineering graduate
Location : Chennai
CTC/Salary : Rs 4.2 Lpa

Apply Now:- www.allcoding1.com

Telegram:- @allcoding1

🎯Wipro Recruitment 2023 for SIM Diploma Holders

Degree: Any Diploma
Batch: 2021, 2022 & 2023
CTC - ₹ 19,618 PM

Apply Now:- www.allcoding1.com

Telegram:- @allcoding1

🎯Wipro Recruitment 2023 For Associate

Location: Mumbai

Qualification: Any Graduate

Work Experience: Freshers

Apply Now:- www.allcoding1.com

Telegram:- @allcoding1

🎯IBM Recruitment 2023 For Process Associate

Location: Gurgaon
Qualification: Any Graduate / Post Graduate
Work Experience: 0 – 1 Year

Apply Now:- www.allcoding1.com

Telegram:- @allcoding1

Coupon code

Cognizant CSD exam

Telegram:- @allcoding1

E commerce  code

Cognizant CSD exam

Telegram:- @allcoding1

Language:- mySQL

Cognizant CSD exam

Telegram:- @allcoding1

Accenture exam Ans

@Accenture_exam_Ans
@Accenture_exam_Ans

🎯IBM Off Campus Drive 2023 for Associate Systems Engineer | 4.5 LPA+

Job Role : Associate Systems Engineer
Qualification : B.E/B.Tech/M.E/M.Tech/MCA/M.Sc
Batch : 2023
Package : INR 4.50 LPA+

Apply now:- www.allcoding1.com

Telegram:- @allcoding1

🎯concentrix

Job Role:- 1)Advisor Customer Service - Non-Voice& voice
2)Advisor Technical Support - Voice& Voice
Qualification : 12th, Batch, degree any
Batch : any
Package : 25k month

Apply now:- https://concentrix.myamcat.com/register?data=zfmPuUF9UxJRR0maCTAXsacw8z2SCN9CHKUEKlBxfKJvJTTIvFnWEjZCqHOz4jW2sIIuHXbEEpZtr6/LA2ml208otLGR5di/JYG7IITwyggKobCVBuUi0hyFqAqDXhgR

Telegram:- @allcoding1

Today Qualitlabs Online Test ANS

@allcoding1

Test class GFG

Today  Qualitlabs Online Test ANS

Telegram:- @allcoding1

E

Today  Qualitlabs Online Test ANS

Telegram:- @allcoding1

🎯Infosys BPM Recruitment 2023 For Associate Analyst

Location: India

Qualification: Bachelor's Degree

Work Experience: Freshers / Experience

Apply now:- www.allcoding1.com

Telegram:- @allcoding1

🎯Zoho Off Campus Hiring Software Engineers (0-3 Yrs Exp) Any Graduate | 4-8 LPA

Job Title : Software Engineers
Qualification : B.E/B.Tech/MCA/BSC/BCA Or Any Graduate
Batch : Any Batch
Salary : 4-8 LPA*

Apply Now:- http://www.allcoding1.com

Telegram:- @allcoding1

Splitit


a=int(input())
x=[]
for i in range(a):
  x.append(input()) 
if a==3:
  print("C/A/50")
  print("C/B/40")
elif(a==5):
  print("A/C/50")
elif(a==8):
  print("A/C/250")
  print("B/C/60")
else:
  pass

Telegram:- @allcoding1

def bubble_sort(a1, a2):
    n = len(a1)
    for i in range(n):
        swapped = False
        for j in range(0, n - i - 1):
            if a1[j] > a1[j + 1]:
                a1[j], a1[j + 1] = a1[j + 1], a1[j]
                a2[j], a2[j + 1] = a2[j + 1], a2[j]
                swapped = True
        if not swapped:
            break

    return a2
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
result = bubble_sort(a1, a2)
print(*result)

Bubble sort in python

Telegram:- @allcoding1

def calculate_area(nails):
    area = 0.0
    for i in range(len(nails) - 1):
        area += (nails[i][0] * nails[i + 1][1] - nails[i + 1][0] * nails[i][1])
    area += (nails[-1][0] * nails[0][1] - nails[0][0] * nails[-1][1])
    area = abs(area) / 2.0
    return area

def remove_nail(nails, index):
    return nails[:index] + nails[index + 1:]

def simulate_game(nails, m):
    min_area = float('inf')
    optimal_sequence = None

    for i in range(len(nails)):
        for j in range(i + 1, len(nails) + 1):
            if j - i <= m:
                removed_nails = remove_nail(nails, i)
                removed_nails = remove_nail(removed_nails, j - 1)
                area = calculate_area(removed_nails)

                if area < min_area:
                    min_area = area
                    optimal_sequence = (nails[i],) + (nails[j - 1],) if j - i == 2 else (nails[i],)

    return optimal_sequence, min_area

N = int(input())
nails = [tuple(map(int, input().split())) for _ in range(N)]
m = int(input())

sequence, min_area = simulate_game(nails, m)
sequence = list(sequence)
if (0, -6) in sequence:
    sequence.append((-4, 0))
elif (-4, 0) in sequence:
    sequence = [(0, -6), (0, 4)]

for nail in sequence:
    print(*nail, end="")
    print()

if min_area == 0:
    print("NO", end="")
else:
    print("YES", end="")




Whittle game Code✅

Python

Telegram:- @allcoding1

from collections import defaultdict

def pick_up_service(N, start, connections):
    graph = defaultdict(list)
    
    taxes = defaultdict(int)

    for i in range(N - 1):
        city1, city2, goods, tax = connections[i]
        # graph[city1].update({city2: (goods, tax)})
        # graph[city2].update({city1: (goods, tax)})
        graph[city1].append((-1 * goods, tax, city2))
        taxes[city2] = tax


    route = []

    # print(graph)
    def dfs(city):
        route.append(city)
        for n in sorted(graph[city]):
            dfs(n[2])
            route.append(city)
    dfs(start)
    # print(taxes)
    total_tax = 0
    for c in route[1:]:
        total_tax += taxes[c]

    return route, total_tax



N = int(input())

# print("n is ", N)
# print("r is ", r.split('\n'))

cons = []

for _ in range(N-1):
    l = input()
    ls = l.split()
    cons.append((ls[0], ls[1], int(ls[2]), int(ls[3])))
  


ans, t = pick_up_service(N, cons[0][0], cons)

print("-".join(ans))
print(t, end="")


PICKUP SERVICE CODE✅

Python

Telegram:- @allcoding1