𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerRank Highly Profitable Months - HackerRank C++ Solutions

int countHighlyProfitableMonths(vector<int> stockPrices,int k){
    int n=stockPrices.size(),count=1;
    vector<int> a;
    for(int i=0;i+1<n;i++){
        if(stockPrices[i+1]>stockPrices[i])
            count+=1;
        else{
            a.push_back(count);
            count=1;
        }
    }
    a.push_back(count);
    int ans=0;
    for(auto x:a){
        if(x>=k)
            ans+=(x-k+1);
    }
    return ans;
}

657 viewsサンケットクマール, 15:03

✅✅✅#HackerRank Last and Second-Last - Python HackerRank Solutions

def lastLetters(word):
    return word[-1]+" "+word[-2]
    
word="APPLE"
print(lastLetters(word))

805 viewsサンケットクマール, 14:19

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerRank Product of the Maximum and Minimum in a Dataset - Java HackerRank Solution

    public static List<Long> maxMin(List<String> operations, List<Integer> x) {
    List<Long> productArray = new ArrayList<Long>();
    List<Long> a=new ArrayList<Long>();
    int opsize=operations.size();
    for(int y=0;y<opsize;y++)
    {
        if(operations.get(y).equals("push"))
        {
            a.add((long)x.get(y));
            Collections.sort(a);
            productArray.add(a.get(0)*a.get(a.size()-1));
        }
        else
        {
            a.remove((long)x.get(y));
            Collections.sort(a);
            productArray.add(a.get(0)*a.get(a.size()-1));
        }
    }
    return productArray;
    }

876 viewsサンケットクマール, 14:21

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerRank Reverse Array Queries - Python HackerRank Solutions

def performOperations(arr, operations):
    for i in operations:
        arr[i[0]:i[1]+1]=reversed(arr[i[0]:i[1]+1])
    return arr

809 viewsサンケットクマール, 14:23

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerRank Department Summary - SQL HackerRank Solution

select d.name, count(unique(e.id)) as c
from department d, employee e
where d.id = e.dept_id
group by d.name
order by c desc, d.name;

select d.name, 0
from department d
left outer join employee e on d.id = e.dept_id
where e.id is null
group by d.name
order by d.name;

✅ Share in ur College WhatsApp Groups

748 viewsSage, 08:57

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

⚠️⚠️⚠️#HackerRank Rest API: Country Code - HackerRank Python Solutions

import urllib.request
import json
import re

def getPhoneNumbers(country,phoneNumber):
  api="https://jsonmock.hackerrank.com/api/countries?name="
  url = api+country
  with urllib.request.urlopen(url) as response:
     html = response.read()
  html = json.loads(html)
  code = html["data"][0]["callingCodes"][0]
  phoneNumber="+"+str(code)+" "+str(phoneNumber)
  return phoneNumber

👍1

1.36K viewsSage, 15:56