Hi Dushyant and all,

Zs is Again back with BTSA hiring.

BTech/Mtech/Mca - 2024,2023,2022,2021 are eligible.

Link for Referral : https://forms.gle/j6vinuhvLxgSU6ycA

Walk-in drive at AXA XL, Gurgaon for the role mentioned below, details of which are provided:

Date & Day - 21st & 24th (Tuesday & Friday)
Timings - 10.00 AM to 2.00 PM
Address - 14th Floor, World Tech Park, Block B2, (“SEZ Unit-1”) DLF
IT/ITES SEZ, Sector 30, Silokhera, Gurgaon
Docs to Carry - 1 Updated Resume, Passport Size Photo, Aadhar Card.
Contact Person: Aich, Amarjit & Hina Karmarkar,

DISCOVER your opportunity -
Executive (with 1-3 years of experience) & Sr Associate (with 3-5 years of experience).
Preparation of Indirect tax returns for Insurance Premium Taxes (IPT), Value Added Tax (VAT) and GST returns, and other para-fiscal tax returns.
Preparation of reconciliations for tax accounts.
Support the team in ad-hoc project requests.
Misc other projects/assignments as needed including tax research.
Great MS Excel knowledge. Good written and verbal communication skills. Preparation of reconciliation for tax accounts.
This is an excellent opportunity to work in Tax team. Over time, the candidate will get understanding of an Insurance/Reinsurance Industry and preparation of tax returns, tax payments, journal posting and filing of returns.

FIND your future!
AXA XL, the P&C and specialty risk division of AXA, is known for solving complex risks. For mid-sized companies, multinationals and even some inspirational individuals we don’t just provide re/insurance, we reinvent it.

NOTE: A 6-month cooling period applies for re-application. If you've participated in our recruitment process in the last 6 months, we appreciate your interest but kindly refrain from re-applying. Thank you for your understanding.

🔗 *Click Here* To register for the Walk in Drive, simply use the QR code provided in the post.

https://forms.office.com/pages/responsepage.aspx?id=x8q3U74U1Ea-Q_KtkkTZAU7Ov0Fjy8VHrCsLRf2bpmRUMEw2TElNTVVVVTBVSVc5UEhLRkw2UVkxVi4u

FresherOpportunityAlert

Signals And Systems hiring Engineer Trainee - Walk in Interview (Fresher)

Strictly Candidate from BE -EC/EEE/IE only can WalkIn.

Walk-in: Time and Venue
17th May - 19th May , 10.00 AM - 12.30 PM
Signals & Systems (India) Pvt.Ltd. 15 / D19, IIIrd Main Road, SIPCOT IT Park, Siruseri, OMR, Chennai - 603 103, India.
Contact - Venkaatesh S V ( 9500097803 )

Company Name: Servicenow

🛄 Job Title: Software Engineer
✍🏻 YOE: 0-2 years (2024 grads can also apply)


➡️ Apply: https://careers.servicenow.com/en/jobs/743999987927691/software-engineer/

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

Company Name : KukuFM
Role : Product Interns
Stipend : 30k/month

Duration : 6 months

Batch : 2024,25 passouts

Link : https://docs.google.com/forms/d/e/1FAIpQLSf6TuFqxcXJm4K7p08pTc1ljZlJp-FjBIFfgm8gWqS1dsNW3w/viewform

Expedia is hiring SDE

For 2024, 2023, 2022 grads

Check out this job at Expedia Group: https://www.linkedin.com/jobs/view/3928703205

Data Analyst Internship Opportunity at SpareProvider.com
Note : Only College Students can apply
No of Vacancies: 5
Location: Remote
Send your Resume: kapil@spareprovider.com

Requirements: Bachelor's degree in a related field, proficiency in Excel, SQL, and Python/R preferred. Only College Students can apply.

Join SpareProvider.com as a Data Analyst Team ! We offer remote work, competitive pay, and growth opportunities.

Company Name: Baaz Bikes

🛄 Job Title: Backend Developer Intern
✍🏻 YOE: 2024 and earlier grads
Stipend: 25k per month


➡️ Apply: https://www.linkedin.com/jobs/view/3923107428

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

Company Name: BrowserStack

🛄 Job Title: Software Engineer
✍🏻 YOE: 2023 and 2024 grads


➡️ Apply: https://docs.google.com/forms/d/e/1FAIpQLSe5xR1HfavMugDiwAMe4tmYG5lwlSeetrD_8gmY-Nwn-ErjGQ/viewform

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

Company Name: Paypal

🛄 Job Title: Software Engineer
✍🏻 YOE: 2022 and 2023 grads


➡️ Apply: https://paypal.eightfold.ai/careers/job?domain=paypal.com&pid=274899570229&query=R0111166&domain=paypal.com&sort_by=relevance&job_index=0

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

def get_palindromes(arr1, arr2):
    palindromes = set()
   
    for word1 in arr1:
        for word2 in arr2:
            concatenated = word1 + word2
            if concatenated == concatenated[::-1]: 
                palindromes.add(concatenated) 
   
    return sorted(list(palindromes))
Python 3✅

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

int main() {
    int a;
    cin >> a;
    vector<vector<int>> b(a, vector<int>(a));

    for (int c = 0; c < a; ++c) {
        for (int d = 0; d < a; ++d) {
            cin >> b[c][d];
        }
    }

    int sax;
    cin >> sax;
    cin.ignore();

    for (int o = 0; o < sax; ++o) {
        string query;
        int x;
        getline(cin, query);
        stringstream ss(query);
        string type;
        ss >> type >> x;

        int sum = 0;
        for (int e = 0; e < a; ++e) {
            for (int f = 0; f < a; ++f) {
                if (b[e][f] == x) {
                    if (type == "ADJACENT") {
                        if (e > 0) sum += b[e-1][f];
                        if (e < a-1) sum += b[e+1][f];
                        if (f > 0) sum += b[e][f-1];
                        if (f < a-1) sum += b[e][f+1];
                    } else if (type == "DIAGONAL") {
                        if (e > 0 && f > 0) sum += b[e-1][f-1];
                        if (e > 0 && f < a-1) sum += b[e-1][f+1];
                        if (e < a-1 && f > 0) sum += b[e+1][f-1];
                        if (e < a-1 && f < a-1) sum += b[e+1][f+1];
                    }
                }
            }
        }
        cout << sum << endl;
    }

    return 0;
}

class Parser {
    public static String isBalanced(String s) {
        Stack<Character> stack = new Stack<>();
        for (char ch : s.toCharArray()) {
            switch (ch) {
                case '(': case '{': case '[':
                    stack.push(ch);
                    break;
                case ')':
                    if (stack.isEmpty() || stack.pop() != '(') {
                        return "false";
                    }
                    break;
                case '}':
                    if (stack.isEmpty() || stack.pop() != '{') {
                        return "false";
                    }
                    break;
                case ']':
                    if (stack.isEmpty() || stack.pop() != '[') {
                        return "false";
                    }
                    break;
                default:
                    return "false";
            }
        }
        return stack.isEmpty() ? "true" : "false";
    }

Java Braces ✅

def getResult(n, k, pos):
    def canDistribute(maverickSweets):
        sweets_left = k - maverickSweets
        left = pos - 1
        right = n - pos

        for i in range(1, left + 1):
            required = max(maverickSweets - i, 1)
            sweets_left -= required
            if sweets_left < 0:
                return False

        for i in range(1, right + 1):
            required = max(maverickSweets - i, 1)
            sweets_left -= required
            if sweets_left < 0:
                return False

        return sweets_left >= 0

    low, high = 1, k
    result = 0

    while low <= high:
        mid = (low + high) // 2
        if canDistribute(mid):
            result = mid
            low = mid + 1
        else:
            high = mid - 1

    return result

DE Shaw ✅