COGNIZANT EXAM HELP GROUP

public int[] exponentialSeries(int input1, int input2, int input3) {
    List<Integer> r = new ArrayList<>();
    
    for (int ss = input1; ss <= input3; ss *= input2) {
        r.add(ss);
    }
    
    int[] a = r.stream().mapToInt(i -> i).toArray();
    
    for (int i = 0; i < 1000; i++) {}
    
    return a;
}

ExponentialSeries// CTS 📱

Please open Telegram to view this post

VIEW IN TELEGRAM

318 viewsMr September, edited 09:46

COGNIZANT EXAM HELP GROUP

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Todo List</title>
    <script src="https://code.jquery.com/jquery-3.6.0.min.js"></script>
    <style>
        button {
            cursor: pointer;
        }
    </style>
</head>
<body>
    <h1>Todo List</h1>
    
    <input type="text" id="todo-input" placeholder="Enter task">
    <button id="add-btn">Add</button>

    <ul id="todo-list"></ul>

    <script>
        $(document).ready(function() {
            $('#add-btn').click(function() {
                let task = $('#todo-input').val();
                if (task) {
                    $('#todo-list').append(`<li>${task} <button class="delete-btn">Delete</button></li>`);
                    $('#todo-input').val('');
                }
            });

            $('#todo-list').on('click', '.delete-btn', function() {
                $(this).parent().remove();
            });
        });
    </script>
</body>
</html>

Todo // cts

👍1

367 viewsMr September, edited 10:04

COGNIZANT EXAM HELP GROUP

0:07

This media is not supported in your browser

VIEW IN TELEGRAM

📣

😁

Todo // Cognizant 👍

Please open Telegram to view this post

VIEW IN TELEGRAM

427 viewsMr September, edited 10:12

COGNIZANT EXAM HELP GROUP

Cognizant technical {27 || 2pm}

Cluster 1 { java ,SQL, simulator} are done 💯▶️

Test accomplished 📱

DM for test clearance

@mrtrueliving_ix 👍

@mrtrueliving_ix 👍

Test accomplished ❤️

Prev:https://t.me/code_alphix/2554

#Cognizant #Technical #Cluster1

Please open Telegram to view this post

VIEW IN TELEGRAM

🎉1👌1🍾1

456 viewsMr September, edited 10:16

COGNIZANT EXAM HELP GROUP

final slot.......📱

Please open Telegram to view this post

VIEW IN TELEGRAM

🔥1🍾1

466 viewsMr September, 12:20

COGNIZANT EXAM HELP GROUP

Done 👍

Please open Telegram to view this post

VIEW IN TELEGRAM

🔥1

505 viewsMr September, 12:37

COGNIZANT EXAM HELP GROUP

done.....

👍2

461 viewsMr September, 13:08

COGNIZANT EXAM HELP GROUP

public class MariaMathTeacher {
    public static int sumDivisibleByX(int N, int X) {
        int[] A = new int[N];
        for (int i = 0; i < N; i++) {
            A[i] = i + 1;
        }
        
        int[] B = new int[N];
        for (int i = 0; i < N - 1; i++) {
            B[i] = A[i] + A[i + 1];
        }
        B[N - 1] = A[N - 1] + A[0];
        
        int sum = 0;
        for (int i = 0; i < N; i++) {
            if (B[i] % X == 0) {
                sum += B[i];
            }
        }
        
        return sum;
    }
    
    }

511 viewsMr September, 13:29

COGNIZANT EXAM HELP GROUP

All placement help available

💯 Test Clearance 🤗

DM @mrtrueliving_ix

@mrtrueliving_ix

494 viewsMr September, 02:15

COGNIZANT EXAM HELP GROUP

Wipro Elite successfully cleared ▶️

Prev :
https://t.me/code_alphix/2761?single

All placement help available

DM for test clearance ❤️

@mrtrueliving_ix

@mrtrueliving_ix

#Wipro #Elite #Round1 #SVAR

618 viewsMr September, edited 02:58

COGNIZANT EXAM HELP GROUP

Active now ...▶️

All placement help available

@mrtrueliving_ix

@mrtrueliving_ix

@mrtrueliving_ix

Please open Telegram to view this post

VIEW IN TELEGRAM

477 viewsMr September, 12:12

COGNIZANT EXAM HELP GROUP

def finalState(operations):
    if not operations:
        return 0
    
    max_index = 0
    for left, right in operations:
        max_index = max(max_index, right)
    
    states = [False] * (max_index + 1)
    toggles = [0] * (max_index + 2)  
    
    for left, right in operations:
        toggles[left] += 1
        if right + 1 <= max_index:
            toggles[right + 1] -= 1
    
    toggle_count = 0
    for i in range(max_index + 1):
        toggle_count += toggles[i]
        if toggle_count % 2 == 1:
            states[i] = not states[i]
    
    sum_indices = 0
    for i in range(max_index + 1):
        if states[i]:
            sum_indices += i
    
    return sum_indices

501 viewsMr September, 13:40

COGNIZANT EXAM HELP GROUP

Do they belongs// Oracle 👍❤️

Please open Telegram to view this post

VIEW IN TELEGRAM

459 viewsMr September, 13:45

COGNIZANT EXAM HELP GROUP

def getLargestSubsequence(s):
    n = len(s)
    ans = []
    for length in range(1, n + 1):
        k = n - length
        curr = []
        for ch in s:
            while curr and curr[-1] < ch and k > 0:
                curr.pop()
                k -= 1
            curr.append(ch)
        while curr and k > 0:
            curr.pop()
            k -= 1
        ans.append(''.join(curr))
    return ans

getLargestSubsequence // Oracle 👍

Please open Telegram to view this post

VIEW IN TELEGRAM

478 viewsMr September, edited 13:46

COGNIZANT EXAM HELP GROUP

IBM
Role DevOps

Test accomplished 👍

Both coding are done 👍📱

All placement help available

DM for Test Clearance

@mrtrueliving_ix

@mrtrueliving_ix

Please open Telegram to view this post

VIEW IN TELEGRAM

436 viewsMr September, 14:32

COGNIZANT EXAM HELP GROUP

 def getMaxEfficiency(arrivalTime):
    arrivalTime.sort()
    n = len(arrivalTime)
    max_efficiency = float('-inf')
    
    i = 0
    for j in range(n):
        tested_cases = j - i + 1
        active_time = arrivalTime[j] - arrivalTime[i]
        efficiency = tested_cases - active_time
        
        max_efficiency = max(max_efficiency, efficiency)

        while active_time >= tested_cases:
            i += 1
            active_time = arrivalTime[j] - arrivalTime[i]
            tested_cases = j - i + 1

    return max_efficiency

IBM