CodingHuman #Coding_Help , All exam codes, Coding solutions, accenture TCS Wipro Nagarro Persistent Cisco
590 subscribers
136 photos
310 links
We Provide free material, Coding stuff, Placement material, Handwritten Notes, previous year company questions, Job updates and many more.
Conding help.
Download Telegram
#include<stdio.h>
int childern candies (int inputi, int input2, int input3)
{

int i, j, temp;

for (1-8; 1<input1; i++)//better to use quick sort.

for(j=i+1; j<input1; j++)
if(input3[i]<input3[1])

{

temp=input3[1];
input3[1]-input3[j];
input3[j]-temp;

if(i+1==input2)
break;

return input3[1];

}

Children day code
Java

Join : https://t.me/Coding_human
ACCENTURE Interview Experience

1) First introduced HerSelf.
2) Self introduction
3) what are projects are u done?
4) And explain about it?
5) Recently are you learned courses(She
    said Azure devops)
6) what is CICD?
7) And difference between them?
8) Any questions for me?
Hey guys 💡 Whether you're a student, professional, or lifelong learner, optimizing your learning journey can unlock incredible opportunities for success. Here are some proven tips to supercharge your learning process:

🎯 Set Clear Goals
Prioritize Consistency
🧠 Stay Actively Engaged
🌈 Embrace Diverse Resources
🗣️ Teach What You Learn
📱 Harness Tech Tools
💡 Practice with Purpose
🔄 Review and Reflect
🌱 Cultivate Curiosity
💪 Mind and Body Care

Telegram: @Coding_human
Please read guys 🙏🙏

Don't give money to anyone.
We are providing free help.

Stay away from rippers.
Stay alert stay safe.


Kisi ko bhi koi paisa/rs dene ki koi zaroorat nahi h,
Hum free material provide karte hai.
Aap Rippers se door the.🙏

If you are ripped by someone, we are not responsible at all.

Thank you
@Coding_human
Wishing All Publishers & Members

Happy Independence Day 🇮🇳
Many companies like Wipro, TCS, Accenture are sending Onboarding dates , so check your mail

Telegram:
https://t.me/Coding_human
def cardinalitySort(nums):
    return sorted(nums, key=lambda num: [bin(num).count('1'), num])

Cardinality sorting Code

Telegram : https://t.me/Coding_human
def gameWinner(colors):
    currPlayer = "wendy"
    prevPlayer = ""
    winner = ""

    while True:
        moveMade = False
        if currPlayer == "wendy":
            whiteIndex = colors.find("www")
            if whiteIndex = -1:
                # 3 consecutive whites found, remove the middle one
                colorsBuilder = list(colors)
                colorsBuilder.pop(whiteIndex + 1)
                colors = "".join(colorsBuilder)
                moveMade = True
                prevPlayer = currPlayer
                currPlayer = "bob"
        else:
            blackIndex = colors.find("bbb")
            if blackIndex != -1:
                # 3 consecutive blacks found, remove the middle one
                colorsBuilder = list(colors)
                colorsBuilder.pop(blackIndex + 1)
                colors = "".join(colorsBuilder)
                moveMade = True
                prevPlayer = currPlayer
                currPlayer = "wendy"

        # if no moves possible break
        if not moveMade:
            winner = prevPlayer
            break

    return winner
print(gameWinner("wwwbb"))

Python 3
Game Winner
JP Morgan

Telegram:- https://t.me/Coding_human
Camel case code
KPIT EXAM

C++ language

Easy code to understand

Share with your family and friends : https://t.me/Coding_human
Please read guys 🙏🙏

Don't give money to anyone.
We are providing free help.

Stay away from rippers.
Stay alert stay safe.


Kisi ko bhi koi paisa/rs dene ki koi zaroorat nahi h,
Hum free material provide karte hai.
Aap Rippers se door the.🙏

If you are ripped by someone, we are not responsible at all.

Thank you
@Coding_human
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
@Coding_human

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:- @Coding_human
String ans = "";
  for(int i = 0; i < str.length(); i++)
  {
      if(str.charAt(i) != ch)
          ans += str.charAt(i);
  }
  return ans;

Telegram:- @Coding_human
🎯Tech Mahindra off Campus Hiring As Associate Software Engineer | Rs.3.25 LPA & 5.5LPA

Designation : Associate Software Engineer
Eligibility : Engineering / MCA
Salary CTC : Rs.3.25 LPA & 5.5LPA (for super coders)

Apply Now:- https://registration.techmahindra.com/Candidate/RegDefault.aspx
long long OneBlock(int N, vector<int> Arr) {
    vector<int> one_indices;
    for (int i = 0; i < N; ++i) {
        if (Arr[i] == 1) {
            one_indices.push_back(i);
        }
    }

    if (one_indices.size() <= 1) {
        return 1;
    }

    long long ways = 1;
    for (int i = 1; i < one_indices.size(); ++i) {
        int zeros_between_ones = one_indices[i] - one_indices[i - 1] - 1;
        ways *= (zeros_between_ones + 1);
    }

    return ways;
}
//one block

C++

Telegram:- @Coding_human