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

🔔TCS Digital Hiring for 2022 Batch with Salary : 7 Lakhs/Year

* Job Role : TCS Digital
* Qualification : B.E/B.Tech/M.E/M.Tech/MCA/M.Sc
Experience : Freshers
* Salary : 7.0 LPA (UG) & 7.3 LPA (PG)

https://fresherearth.blogspot.com/2022/03/TCS-Digital-Hiring-for-2022-Batch-with-Salary-7-LakhsYear-TCS-Off-campus-Recruitment-Drive-2022.html

✅ Share with your friends

FresherEarth - Get All Latest Jobs Here

TCS Digital Hiring for 2022 Batch with Salary : 7 Lakhs/Year | TCS Off campus Recruitment Drive 2022

fresher jobs, freshers jobs, off campus jobs, latest fresher jobs, fresher jobs bangalore, fresher jobs hyderabad, latest walk in drive

👍1

965 viewsサンケットクマール, 06:00

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

Amazon SDE Challenge - April/ May 2022
SDE 1 and SDE 2
Experience: 1 years+
Compensation: Best in industry
Job Location: Bangalore, Delhi, & Hyderabad

https://assessment.hackerearth.com/challenges/hiring/amazon-software-development-engineer-challenge/?utm_source=email&utm_medium=registration&utm_campaign=AmazonSDEChallengeAprilMay2022

HackerEarth

Amazon SDE Challenge - April/ May 2022

All shortlisted candidate profiles have been shared with the Amazon team, and they will contact candidates as per Scores and job fit.

Do you want to build products used every single day by your friends and family? Are you passionate about building products…

955 viewsDushyant, 15:20

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

🔔 Infosys Off Campus Drive | Digital Hiring | 9.5 LPA

* Job Role : Specialist Programmer(9.5 LPA) & Digital Specialist Engineer (6.25 LPA)
* Education : BE, B.Tech, ME, M.Tech, MCA, MSc
* Branch : All Branches Eligible
* Batch : 2019, 2020, 2021, 2022
* CTC : 6.25 LPA To 9.5 LPA

https://fresherearth.blogspot.com/2022/03/Infosys-Off-Campus-Drive-Digital-Hiring-9.5-LPA.html

✅ Share with your friends

924 viewsサンケットクマール, 17:08

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

📌 WIPRO INTERVIEW EXPERIENCE (IT) :

Intro
How to handle team members complaint conflict
How to handle clients complain
Relocation
Bond
How do handle disagreement with higher authority
How to handle your mistake
Any questions
Why Wipro

861 viewsDushyant, 06:13

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

You have IBM Coding Exam on 1st April ?

Anonymous Quiz

40%

Yes

60%

70 voters859 viewsDushyant, 06:26

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

🔔 IBM Recruitment 2022 : Hiring Freshers as Associate Systems Engineer With 4.2 LPA

* Job Role : Associate Systems Engineer
* Qualification : B.E/B.Tech/M.E/M.Tech/MCA/M.Sc
* Batch : 2019/2020/2021/2022
* Salary : upto Rs 4.2 LPA

https://fresherearth.blogspot.com/2022/03/IBM-Recruitment-2022-Hiring-Freshers-as-Associate-Systems-Engineer-With-4.2-LPA.html

✅ Share with your friends

👍1

890 viewsサンケットクマール, 07:25

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

📌 WIPRO INTERVIEW EXPERIENCE (CSE) :

Introduction
Why Wipro
Team management questions
Leadership Abilities
Social works
Family Background
Explain Project
What technology you use currently
Internship technical role
Different b/w C C++
Pointer
What is JVM JRE JDK
What is Inheritance
and Oops questions
ready to sign bond

👍2

826 viewsDushyant, 11:10

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

Goldman Sachs Analyst Internship

2022 Batch - Click Here
2023 Batch - Click Here

751 viewsサンケットクマール, 14:44

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

✅✅✅#HackerEarth Call duration - SQL Questions - HackEarth Solutions

715 viewsサンケットクマール, 14:47

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

✅✅✅#HackerEarth The Abandoned City - C++ Solution

#include<bits/stdc++.h>
using namespace std;

    #define ll long long

    int main(){
        ll n;
        cin>>n;
        ll arr[100005];
        for(ll i=1;i<=n;i++){
            cin>>arr[i];
        }
        ll k;
        cin>>k;
        ll pre[100005];
        pre[0]=0;
        
        for(ll i=1;i<=n;i++){
            pre[i] = pre[i-1]+arr[i];
        }
        if(pre[n]<k){
            cout<<-1<<"\n";
        }
        else{
        ll ans = INT_MAX;
        for(ll i=1;i<=n;i++){
            ll l=i;
            ll r=n;
            ll mid;
            while(l<=r){
                //cout<<l<<" "<<r<<"\n";
                mid = (l+r)/2;
                if(pre[mid]-pre[i-1]>=k){
                    //cout<<mid<<"\n";
                    ans = min(ans,mid-i+1);
                    r=mid-1;
                }
                else
                    l=mid+1;
            }
                    
        }
        cout<<ans<<"\n";
        }
        return 0;
    }

802 viewsサンケットクマール, 14:48

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

✅✅✅#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 Count Binary Substrings - Java Code Solution

Code 1-

int getSubstrings(string s) {     
        int n = s.size();
        int count =0, ans=0;
        vector<int> groups;
        for(int i=0;i<n-1;i++){
            if (s[i] !=s[i+1]){
                groups.push_back(count+1);
                count=0;
            }
            else{
                count++;
            }
        }
        for(int i=0;i<groups.size()-1; i++){
            ans += min(groups[i], groups[i+1]);
        }
        return ans;
    }

Code 2 -

import java.util.regex.*;
class Solution {
    static Pattern p = Pattern.compile("((0(?<=0))+|(1(?<=1))+)");
    public int countBinarySubstrings(String s) {
        Matcher m = p.matcher(s);
        int last = 0;
        int cnt = 0;
        while (m.find()) {
            int now = m.end()-m.start();
            cnt += Math.min(last, now);
            last = now;
        }
        return cnt;
    }
}

715 viewsサンケットクマール, 14:57

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

✅✅✅#HackerRank Examination Data - SQL Solution

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

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

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

✅✅✅#HackerEarth Closest to Zero - Java Solutions

import java.util.*;
import java.lang.*;
import java.io.*;
class Main
{
    public static void main (String[] args) throws java.lang.Exception
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i=0;i<n;i++)
        a[i]=sc.nextInt();
        int curr = 0;
        int ans = a[0];
        Arrays.sort(a);
        for (int i=0; i < a.length; i++){
            curr = a[i] * a[i];
            if ( curr <= (ans*ans) )  {
                ans = a[i];
            }
        }
        System.out.println(ans);
    }
}

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

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

✅✅✅#Mettl Nth Character in Decrypted String - Python Solutions

def dString(s,n):
    result=""
    for i in range(len(s)):
        if s[i].isdigit():
            c=s[i-1]
            for j in range(int(s[i])-1):
                result+=c
        else:
            result+=s[i]
  
    if(n-1<len(result)):
        return result[n-1]
    else:
        return -1

n=input("enter string")
m=int(input())
print(dString(n,m))

648 viewsサンケットクマール, 14:59

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

✅✅✅#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

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

✅✅✅ Uber Sums Divisible By K - C++ Solutions

#include <bits/stdc++.h>
using namespace std;

int sumsDivisibleByK(int A[], int n, int K)
{
  int freq[K] = { 0 };
  for (int i = 0; i < n; i++)
    ++freq[A[i] % K];
  int sum = freq[0] * (freq[0] - 1) / 2;
  for (int i = 1; i <= K / 2 && i != (K - i); i++)
    sum += freq[i] * freq[K - i];
  if (K % 2 == 0)
    sum += (freq[K / 2] * (freq[K / 2] - 1) / 2);
  return sum;
}
int main()
{

  int A[] = { 1,2,3,4,5 };
  int n = sizeof(A) / sizeof(A[0]);
  int K = 3;
  cout << sumsDivisibleByK(A, n, K);
  return 0;
}

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

About

Blog

Apps

Platform