Maximum Phone Number (Consultadd)

Minimum Moves To Sort Binary Array
IBM✅

#include <bits/stdc++.h>
#define MOD 1000000007

using namespace std;

int memo(int n,vector<int> &dp){
        if(n <= 1) return 1;
        else if(n==2) return 2;
        else if(n==3) return 4;
       
        if(dp[n] != -1) return dp[n];
       
        return dp[n] = (memo(n-1,dp) + memo(n-2,dp) + memo(n-3,dp))%MOD;
}

int climbStairs(int n) {
    vector<int> dp(n+1,-1);
    return memo(n,dp);
}

int main()
{
    cout<<climbStairs(4);

    return 0;
}

Stair
C++

class SuperMarket {
    private Map<Integer, Customer> customers = new HashMap<>();
    private Map<Integer, Queue<Customer>> lines = new HashMap<>();

    public void OnCustomerEnter(int customerId, int lineNumber, int numItems) {
        Customer customer = new Customer(customerId, lineNumber, numItems);
        customers.put(customerId, customer);
        if (!lines.containsKey(lineNumber)) {
            lines.put(lineNumber, new LinkedList<>());
        }
        lines.get(lineNumber).add(customer);
    }

    public void OnBasketChange(int customerId, int newNumItems) {
        Customer customer = customers.get(customerId);
        int oldNumItems = customer.getNumItems();
        customer.setNumItems(newNumItems);
        if (oldNumItems > newNumItems) {
            return;
        }
        Queue<Customer> line = lines.get(customer.getLineNumber());
        line.remove(customer);
        line.add(customer);
    }

    public void OnLineService(int lineNumber, int numProcessedItems) {
        Queue<Customer> line = lines.get(lineNumber);
        if (line.isEmpty()) {
            return;
        }
        Customer customer = line.peek();
        int numItems = customer.getNumItems();
        if (numItems <= numProcessedItems) {
            line.remove();
            customers.remove(customer.getCustomerId());
            System.out.println(customer.getCustomerId());
        } else {
            customer.setNumItems(numItems - numProcessedItems);
        }
    }

    public void OnLinesService() {
        for (int lineNumber : lines.keySet()) {
            OnLineService(lineNumber, Integer.MAX_VALUE);
        }
    }
}

class Customer {
    private int customerId;
    private int lineNumber;
    private int numItems;

    public Customer(int customerId, int lineNumber, int numItems) {
        this.customerId = customerId;
        this.lineNumber = lineNumber;
        this.numItems = numItems;
    }

    public int getCustomerId() {
        return customerId;
    }

    public int getLineNumber() {
        return lineNumber;
    }

    public int getNumItems() {
        return numItems;
    }

    public void setNumItems(int numItems) {
        this.numItems = numItems;
    }
}

Supermarket Checkout ✅

Company : Mobileum

Role : Software Engineer

Batch : 2023 passouts

Apply : https://lnkd.in/dymg4xdH

Minimum Additiona (S&P)✅

Stairs (S&P)

Rotating Twins (S&P)✅

Best Sum Any Tree Path (Citadel) ✅

Common Values (Equinix)✅

Sum Of Xor (Equinix)✅

Strong Password Flipkart ✅

Chat Application (Flipkart)✅

SAP Global ✅

Anyone Give Exam?

include <iostream>
#include <vector>
#include <string>
using namespace std;
vector<int> minimalOperations(vector<string> words) {
    vector<int> result;
    for (const auto& word : words) {
        int changes = 0;
        for (int i = 1; i < word.size(); ++i) {
            if (word[i] == word[i - 1]) {
                ++changes;
                ++i; 
            }
        }
        result.push_back(changes);
    }
    return result;
}

No Pairs Allowed ✅