Webkul is Hiring Salesforce Freshers!

𝐏𝐨𝐬𝐢𝐭𝐢𝐨𝐧: Salesforce Consultant

𝐋𝐨𝐜𝐚𝐭𝐢𝐨𝐧: Noida (#Shift timing- 3 pm to 12:30 am)

𝐀𝐩𝐩𝐥𝐲: Mail at damini.hr673@webkul.in

Position- Salesforce Developer Locations- Bangalore Qualifications: MCA / BE (IT) / BE (CS) with an impressive aggregate score of 70% or above.

Hey all ,

Intuit is hiring for summer software engineering interns (2months) and 2025 batch passout students are eligible.

and current interns at Intuit are eligible to give referrals for it.

Go ahead and take referrals and apply.

For Referral

https://www.linkedin.com/feed/update/urn:li:activity:7155441260726562816?updateEntityUrn=urn%3Ali%3Afs_feedUpdate%3A%28V2%2Curn%3Ali%3Aactivity%3A7155441260726562816%29

IBM✅

Company Name : Jindal Steel and Power
Batch : 2023 passouts - Core Branches
Role : Graduate Engineering Trainee

Link : https://docs.google.com/forms/d/e/1FAIpQLScyu82EZy3RyUFHI8wxpRANbGGwGtObNDSSmisCbkWq8dX0FQ/viewform

Batch : 2024/2025

https://jobs.lever.co/fampay/eae15a84-15d3-42d2-a228-5c0064de4dbe/

Company Name : MakeMyTrip

Role : UX Design - 6 Months Internship

Batch : 2023/2024 passouts

Link : https://www.proelevate.in/job/makemytrip-ux-design

Last date to apply : 5th February 2024

INDMoney is looking for web intern role

Batch eligible: 2024 passouts only


https://docs.google.com/forms/d/e/1FAIpQLSerXmlfS7hOpg6UuKW6OU-AWT17U76eRbcnP9yyiq-4XDIFdQ/viewform

Juntran Technologies..!!!
We are looking for DFT & PD Trained Freshers (2021 or earlier passed out graduate) candidates for Hyderabad/Bangalore locations. Interested candidates can drop their resumes to hameed@juntrantech.com

Thanks and Regards,
Syed Hameed
Add Expiry: 31/01/2024

def circles(info):
   result = []

   for circle in info:
       details = [float(data) for data in circle.split()]
       sumRadius = details[2] + details[5]
       diffRadius = abs(details[2] - details[5])
       distance = 0
       if details[0] == details[3] and details[0] == 0:
           distance = abs(details[1] - details[4])
       elif details[1] == details[4] and details[1] == 0:
           distance = abs(details[0] - details[3])

       if distance == sumRadius or distance == diffRadius:
           result.append('Touching')
       elif distance == 0:
           result.append('Concentric')
       elif distance > sumRadius:
           result.append('Disjoint-Outside')
       elif distance < sumRadius and distance > diffRadius:
           result.append('Intersecting')
       elif distance < diffRadius:
           result.append('Disjoint-Inside')
       else:
           print("Operation Failed! data couldn't be handled")
   return result

Company: Ciena

Role: Software Engineer

Location: Gurugram, India

Batch eligible: 2024 passouts

Apply Link: https://careers.ciena.com/us/en/job/CIENUSR023021ENUS/Software-Engineer-NewGrad

SELECT
  id,
  title,
  s.quantity AS total_stock,
  r.quantity AS total_returns
  FROM
    products p
      LEFT JOIN stocks s
        ON p.id = s.product_id
      LEFT JOIN ( SELECT product_id, COUNT( * ) AS quantity FROM returns WHERE MONTHNAME( dt ) = 'July' GROUP BY product_id ) r
        ON p.id = r.product_id
  ORDER BY
    id

E-commerce Warehouse stock and Return Report ✅

Company Name: Upstox

Role: SDE Intern

Batch eligible: 2024 grads only

Apply: https://jobs.lever.co/upstox/e15b9350-848e-4840-808b-94d557e35d3b

int solve(vector<int>& nums) {
    vector<int> s(nums);
    sort(s.begin(), s.end());
    int i = 0, j = nums.size() - 1;
    while (i < nums.size() && nums[i] == s[i]) {
        i++;
    }
    while (j > i && nums[j] == s[j]) {
        j--;
    }
    return j - i + 1;
}

Arrange the heights
Apple ✅

void solve(string x){
    ll n = x.size();
vector<vector<ll>> dp(n,vector<ll>(n,0));
for(ll i=0;i<n;i++){
    dp[i][i] = 1;
}
for(ll k=1;k<n;k++){
for(ll i=0;i<n-k;i++){
        ll j = i + k;
            if(x[i]==x[j]){
                dp[i][j] = 2 + dp[i+1][j-1];
            } else{
                dp[i][j] = max(dp[i][j-1],dp[i+1][j]);
            }
   }
}
ll ans = 0;
for(ll i=0;i<n;i++){
    for(ll j=0;j<n-1;j++){
        ans = max(ans,dp[i][j]*dp[j+1][n-1]);
      }
   }
cout<<ans;
}

Type According to write function

Game of subsequence reverse

Apple✅

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

void dfs(int node, vector<int>& vis, vector<vector<int>>& adj) {
    vis[node] = 1;
    for(auto it : adj[node]) {
        if(!vis[it]) {
            dfs(it, vis, adj);
        }
    }
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> adj(n);
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            int x;
            cin >> x;
            if(x == 1) {
                adj[i].push_back(j);
                adj[j].push_back(i);
            }
        }
    }
    vector<int> vis(n, 0);
    int cc = 0;
    for(int i = 0; i < n; i++) {
        if(!vis[i]) {
            dfs(i, vis, adj);
            cc++;
        }
    }
    cout << cc << endl;
    return 0;
}