python3 ✅

Python 3✅

Ask a question to Priyanka directly:
https://bit.ly/4bAwc61

NOTE: FREE

#include <iostream>
#include <vector>

using namespace std;

long makePowerNondecreasing(vector<int>& power) {
    int n = power.size();
    long adjustments = 0;

    for (int i = 1; i < n; ++i) {
        if (power[i] < power[i - 1]) {
            adjustments += power[i - 1] - power[i];
        }
    }

    return adjustments;
} :)

Amazon✅

void solve(int m, vector<string>& db, int q, vector<string>& qs) {
    unordered_map<string, pair<string, int>> um;
    unordered_map<string, int> uc;
    for(string& d : db) {
        stringstream ss(d);
        string u, s, a;
        ss >> u >> s >> a;
        um[s] = {a, 0};
        uc[u] = 0;
    }

    for(string& q : qs) {
        if(um.find(q) != um.end()) {
            um[q].second++;
            for(auto& d : db) {
                stringstream ss(d);
                string u, s, a;
                ss >> u >> s >> a;
                if(s == q) {
                    uc[u]++;
                }
            }
            cout << um[q].first << " ";
            for(auto& d : db) {
                stringstream ss(d);
                string u, s, a;
                ss >> u >> s >> a;
                if(s == q) {
                    cout << uc[u] << endl;
                }
            }
        }
    }
}

URL Shortener ✅

#include <iostream>
#include <vector>
using namespace std;

class SinglyLinkedListNode {
public:
    string data;
    SinglyLinkedListNode* next;

    SinglyLinkedListNode(string value) {
        data = value;
        next = nullptr;
    }
};

SinglyLinkedListNode* getShoppingCart(SinglyLinkedListNode* head, vector<vector<string>> queries) {
    for (auto& query : queries) {
        string action = query[0];
        string item_name = query[1];

        if (action == "PUSH_HEAD") {
            SinglyLinkedListNode* new_node = new SinglyLinkedListNode(item_name);
            new_node->next = head;
            head = new_node;
        } else if (action == "PUSH_TAIL") {
            SinglyLinkedListNode* new_node = new SinglyLinkedListNode(item_name);
            if (head == nullptr) {
                head = new_node;
            } else {
                SinglyLinkedListNode* current = head;
                while (current->next != nullptr) {
                    current = current->next;
                }
                current->next = new_node;
            }
        } else if (action == "POP_HEAD") {
            if (head != nullptr) {
                SinglyLinkedListNode* temp = head;
                head = head->next;
                delete temp;
            }
        }
    }

    return head;
}

Amazon ✅

import java.util.*;

class Main {
  public static void main (String[] args) {
    Scanner sc=new Scanner(System.in);
    List<Integer> arr=new ArrayList<>();
    int n=sc.nextInt(),i;
    for(i=0;i<n;i++){
        arr.add(sc.nextInt());
    }
    int m=sc.nextInt();
    long ans=solution(arr,m);
    System.out.println(ans);
  }
  public static long solution(List<Integer> arr,int m){
      PriorityQueue<Integer> pq=new PriorityQueue<>(Collections.reverseOrder());
      for(int i=0;i<arr.size();i++) pq.add(arr.get(i));
      long ans=0;
      for(int i=0;i<m;i++){
        int top=pq.poll();
        ans+=top/2;
        pq.add(top-top/2);
    }
    return ans;
  }
}

Candyman ✅

Company Name: Harman

Role: Intern

Batch eligible: 2024 and 2025 passouts

Apply: https://jobs.harman.com/en_US/careers/JobDetail/Intern/19245

Company Name: Monotype

Role: Software Engineer Trainee

Role: 2023 and 2024 passouts

Apply: https://monotype.wd1.myworkdayjobs.com/en-US/Monotype/job/Noida/Software-Engineer-Trainee_R0003348

hiring freshers . | Role - Software Engineer Trainee
Qualification - BTech/MCA/Bsc
Salary - 3.6 LPA
Location - #Hyderabad
Mail I'd - hrm@indianhires.com

Company: Future Domain

Position: Solutions Consultant (Freshers)
Experience: 0-1 Years
Skills Required: Communication skills, problem-solving attitude
Location: Pimple Saudagar, Pune
Mail ID: niraj.thakur@technoedgels.com