Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

int countNecklaces(int maxPearls, int startMagnificence, int endMagnificence) {     int count = 0;     for (int pearls = 1; pearls <= maxPearls; pearls++) {         for (int magnificence = startMagnificence; magnificence <= endMagnificence; magnificence++) {             if (pearls == 1) {                 count++; // count necklaces with one pearl             } else {                 int prevCount = count; // remember count before adding necklaces with pearls-1                 for (int prevMagnificence = startMagnificence; prevMagnificence <= magnificence; prevMagnificence++) {                     count += prevCount; // add count for each magnificence power                 }             }         }     }     return count; }

Social network

charles and necklace code ✅

Guys...don`t msg..me..i will send codes here.. pls wait...

DOCUMENTS CODE All testcases passed ✅✔️👍✅ share @Coding_000❤️

No one is sharing my channel 🥺🥺

import java.text.*; import java.util.*; public class MonthDirefence {   public static int getMonthDiffence(String d1, String d2) throws ParseException {     SimpleDateFormat sdf = new SimpleDateFormat("dd-mm-yyyy");     Date start = sdf.parse(d1);     Date end = sdf.parse(d2);     Calendar startC = new GregorianCalendar();     startC.setTime(start);     Calendar endC = new GregorianCalendar();     endC.setTime(end);     int diffYear = endC.get(Calendar.YEAR) - startC.get(Calendar.YEAR);       return diffYear;   }   public static void main(String[] args) throws ParseException {     Scanner sc = new Scanner(System.in);     String d1 = sc.nextLine();     String d2 = sc.nextLine();     System.out.println(getMonthDiffence(d1, d2));   } } Documents code @Coding_000

✅❤️💯

this is full Code...guys.. pls check and type ✅

Give reactions guys..and share our channel...to get more solutions...❤️✅😁

Documents code ✅

def construct_graph(n):     graph = [[] for _ in range(n+1)]     for i in range(2, n+1):         for j in range(2*i, n+1, i):             graph[i].append(j)             graph[j].append(i)     return graph def dfs(node, graph, visited):     visited.add(node)     for neighbor in graph[node]:         if neighbor not in visited:             dfs(neighbor, graph, visited) def count_groups(n):     graph = construct_graph(n)     visited = set()     groups = 0     for i in range(2, n+1):         if i not in visited:             groups += 1             dfs(i, graph, visited)     return groups Social Network- Python Code

int result=0;   Arrays.sort(input3);     int i=0;   int k=input3.length-1;   while(input2>0) {    result=result+input3[k];    i++;    k--;    input2--;   }     return result; Coding marathon Java8 share @Coding_000❤️✅

Coding marathon code ✅

Now i am doing coding 😍😍😍 Stay connect here and wait.. i will post all test cases passed code in few minutes Make this group 5k immediately.....i will post Coding