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

✅✅✅#HackerRank EV Positive Prefixes - HackerRank Python Solutions

https://stupidtechy.me/threads/ev-positive-prefixes-hackerrank-python-solutions.261/

807 viewsサンケットクマール, 17:05

✅✅✅#HackerRank EV Longest Work Slot - Python HackerRank Solutions

https://stupidtechy.me/threads/ev-longest-work-slot-python-hackerrank-solutions.260/

✅✅✅#HackerRank EV Longest Work Slot - Python HackerRank Solutions

https://stupidtechy.me/threads/ev-longest-work-slot-python-hackerrank-solutions.260/

StupidTechy.Me

HackerRank - EV Longest Work Slot - Python HackerRank Solutions

EV Longest Work Slot - Python HackerRank Solutions
Python 3 - Solutions
(Hidden text: Visit the forum thread!)
EV Longest Work Slot - Python HackerRank Solutions

771 viewsサンケットクマール, 08:36

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

✅✅✅#HackerRank Coding Friends HackerRank Java Solutions

https://stupidtechy.me/threads/coding-friends-hackerrank-java-solutions.262/

StupidTechy.Me

HackerRank - Coding Friends HackerRank Java Solutions

Coding Friends HackerRank Java Solutions
Java - Code
(Hidden text: Visit the forum thread!)
Coding Friends HackerRank Java Solutions

655 viewsサンケットクマール, 09:02

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

✅✅✅#HackerRank Paths in a Warehouse - HackerRank Python Solution

def numPaths(warehouse):
paths = [[0]*len(warehouse[0]) for i in warehouse]
if warehouse[0][0] == 1:
paths[0][0] = 1
for i in range(1, len(warehouse)):
if warehouse[i][0] == 1:
paths[i][0] = paths[i-1][0]
for j in range(1, len(warehouse[0])):
if warehouse[0][j] == 1:
paths[0][j] = paths[0][j-1]

for i in range(1, len(warehouse)):
for j in range(1, len(warehouse[0])):
if warehouse[i][j] == 1:
paths[i][j] = paths[i-1][j] + paths[i][j-1]
return paths[-1][-1]%(10**9+7)

warehouse = [[1,1,1,1], [1,1,1,1],[1,1,1,1]]
print(numPaths(warehouse))

782 viewsサンケットクマール, 16:57

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

✅✅✅#HackerRank Football Scores - Python Solutions

def counts(teamA, teamB):
    ans = []
    teamA.sort()
    for score in teamB:
        lo, hi = 0, len(teamA) - 1
        while lo <= hi:
            mid = (lo + hi) // 2
            if teamA[mid] > score:
                hi = mid - 1
            else:
                lo = mid + 1
        ans.append(lo)
    return ans

657 viewsサンケットクマール, 14:49

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

✅✅✅#HackerRank First Unique Character - C++ Solutions - HackerRank Solutions

# include <iostream>
using namespace std;
int printDistinct(string str)
{
    int count[256];
    int ans;
    int i=-1;
    for (i = 0;i< str.length(); i++)
        if(str[i]!=' ')          
            count[str[i]]++;
    for (i = 0; i <str.length(); i++)
        if (count[str[i]] == 1){
            ans=i+1;
            break;
        }
 
    return ans;
}
int main()
{
    string str;
    cin>>str;
    int res=printDistinct(str);
    cout<<res;          
    return 0;            
}

🔰Telegram - t.me/sup777exams

672 viewsサンケットクマール, edited 14:52

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

✅✅✅#HackerRank Paths in a Warehouse - HackerRank Python Solution

def numPaths(warehouse):
    paths = [[0]*len(warehouse[0]) for i in warehouse]
    if warehouse[0][0] == 1:
        paths[0][0] = 1
    for i in range(1, len(warehouse)):
        if warehouse[i][0] == 1:
            paths[i][0] = paths[i-1][0]
    for j in range(1, len(warehouse[0])):
        if warehouse[0][j] == 1:
            paths[0][j] = paths[0][j-1]
           
    for i in range(1, len(warehouse)):
        for j in range(1, len(warehouse[0])):
            if warehouse[i][j] == 1:
                paths[i][j] = paths[i-1][j] + paths[i][j-1]
    return paths[-1][-1]%(10**9+7)
   
warehouse = [[1,1,1,1], [1,1,1,1],[1,1,1,1]]
print(numPaths(warehouse))

🔰Telegram - t.me/sup777exams

667 viewsサンケットクマール, 14:53

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

✅✅✅#HackerRank Circular Array - C++ Solution

https://i.ibb.co/5hbxdJY/circular-array-test-problem-description.jpg

Code - https://pastebin.com/vzrsQerd

668 viewsサンケットクマール, edited 14:55

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

✅✅✅#HackerRank Examination Data - SQL Solution

Select UPPER(Name),Marks from exam
where marks%2=0
order by name;

643 viewsサンケットクマール, 14:58

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

✅✅✅#HackerRank Amazon Fresh Deliveries - Java Solutions - HackerRank Solutions

import java.util.*;
public class Main
{
 public static int[][] closestKLocations(int[][] allLocations, int k) {
    PriorityQueue<int[]> pq = new PriorityQueue<>(k+1, new Comparator<int[]>() {
      public int compare(int[] a1, int[] a2) {
        int x1 = a1[0];
        int y1 = a1[1];
        int x2 = a2[0];
        int y2 = a2[1];
        int distance1 = x1*x1 + y1*y1;
        int distance2 = x2*x2 + y2*y2;
        if (distance1 == distance2) return x2 - x1;
        return distance2 - distance1;
      }
    });
    for (int[] location : allLocations) {
      pq.add(location);
      if (pq.size() > k) pq.poll();
    }
 
    int[][] result = new int[k][2];
    pq.toArray(result);
    return result;
  }

  public static void main(String[] args) {
    int[][] test1 = new int[][] {
      {1, 2},
      {1, -1},
      {3, 4}
    };

    int[][] result = closestKLocations(test1, 2);

    for (int[] each_elt : result) {
      System.out.println(String.format("[%d,%d]", each_elt[0], each_elt[1]));
    }
  }
}

🪄🪄🪄🪄🪄🪄🪄🪄🪄🪄🪄🪄🪄🪄🪄🪄🪄🪄🪄🪄

import java.util.ArrayList;
 import java.util.List;
 import java.util.PriorityQueue;
 
 public class Main {
     List<List<Integer>> ClosestXdestinations(int numDestinations, List<List<Integer>> allLocations,
                                              int numDeliveries) {
        //  CORNER CASE
        if (allLocations == null || allLocations.size() == 0 || allLocations.size() < numDeliveries) {
             return new ArrayList<>();
         }
 
         List<List<Integer>> result = new ArrayList<>();
         PriorityQueue<Position> minHeap = new PriorityQueue<>((o1, o2) -> o1.distance - o2.distance);
         /*
            PART1: add each position into minHeap
          */
         for (int i = 0; i < allLocations.size(); i++) {
             List<Integer> list = allLocations.get(i);
//              Pythagorean Theorem
             int distance = list.get(0) * list.get(0) + list.get(1) * list.get(1);
             Position p = new Position(list, distance);
             minHeap.add(p);
         }
         /*
            PART2: grab the number of numDeliveries from minHeap
          */
         for (int i = 0; i < numDestinations && i < numDeliveries; i++) {
             result.add(minHeap.poll().list);
         }
         return result;
     }

     class Position {
         List<Integer> list;
         int distance;
 
         public Position(List<Integer> list, int distance) {
             this.list = list;
             this.distance = distance;
         }
     }
    
     /*
        TEST CASE
      */
     public static void main(String[] args) {
         Main test = new Main();
         int numDestinations = 3;
         int numDeliveries = 2;
         List<Integer> list1 = new ArrayList<>();
         List<Integer> list2 = new ArrayList<>();
         List<Integer> list3 = new ArrayList<>();
         List<List<Integer>> allLocations = new ArrayList<>();
         list1.add(1);
         list1.add(2);
         list2.add(3);
         list2.add(4);
         list3.add(1);
         list3.add(-1);
         allLocations.add(list1);
         allLocations.add(list2);
         allLocations.add(list3);
         List<List<Integer>> result = test.ClosestXdestinations(numDestinations, allLocations, numDeliveries);
         for (int i = 0; i < result.size() ; i++) {
             System.out.println("[" + result.get(i).get(0) + "," +  result.get(i).get(1) + "]");
         }
     }
 }

647 viewsサンケットクマール, 15:00

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

✅✅✅#HackerRank Largest Number of Orders - SQL Solutions

select z
from (select x.customer_ID as z,
                    count(x.customer_ID) as l
from Orders x, Orders y
where x.ID = y.ID
group by x.customer_ID
order by l desc)
where rownum = 1;

577 viewsサンケットクマール, 15:01

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

✅✅✅#HackerRank Metro Land Festival - C++ HackerRank Solution

int cost(x, y, a, b) {
   return (abs(x-a)+abs(y-b));
}
int minimizeCost(vector<int> numpeople, vector<int> x, vector<int> y){
    vector<int> xx, yy;
    int ans = 0;
    for(int i = 0 ; i < numpeople.size();i++){
        int count = numpeople[i];
        while(count--){
            xx.push_back(x[i]);
            yy.push_back(y[i]);
        }
    }

    sort(xx.begin(), xx.end());
    sort(yy.begin(), yy.end());
    int mx, my;

    mx = xx[xx.size() / 2];
    my = yy[yy.size() / 2];

    for(int i = 0; i < numpeople.size();  i++){
        ans += numpeople[i] * cost(mx, my, x[i], y[i]);
    }
    return ans;
}

👍2

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

About

Blog

Apps

Platform