Hyderabad India
We are Hiring Security Analyst L1 @ Hyderabad: Work From Office(Cyber Towers)

Role: Security Analyst L1
Experience : Freshers(Should be trained in Cyber Security)
Certification : CEH/ECSA Certified-Preferrable
Education:- BTech/MTech(CSE/ECE/IT--2023/2022/2021)—Must
Mode of Work : work from office
Total No of Positions : 2
Address: 3rd floor, Quadrant 3, Cyber towers, Hitech City Rd, HITEC City, Hyderabad, Telangana 500081

Job Description:

Desired certifications: CEH, ECSA, CompTIA+, GIAC, etc.
Understanding of Security operation center
Willing to work in 24/7 rotational shift and on call support
Understanding of Incident management, alert triaging, security monitoring
Investigate on any incidents detected and escalate to the responsible team, and ensure proper closure
Experience with SIEM tools – QRadar, Splunk, AlienVault, etc.
Understanding of network, network-security, Operating systems, and databases
Good Communication and writing skills
Ability to work in a dynamic and rapidly changing environment


You can share updated resume to the below mail ID:
vijaya.thirukolluri@uvcyber.com

Company Name: Leucine

Role: Full Stack Intern

Stipend: 25k per month

Batch eligible: 2024 and 2025 grads

Apply: https://bit.ly/48XI808

Internship + PPO Opportunity!!

class Solution {
public:
  int minOperations(vector<int>& nums, int x, int y) {
    int l = 0;
    int r = ranges::max(nums);

    while (l < r) {
      const int m = (l + r) / 2;
      if (isPossible(nums, x, y, m))
        r = m;
      else
        l = m + 1;
    }

    return l;
  }

private:
  bool isPossible(const vector<int>& nums, int x, int y, int m) {
    long long additionalOps = 0;
    for (const int num : nums)
      additionalOps += max(0LL, (num - 1LL * y * m + x - y - 1) / (x - y));
    return additionalOps <= m;
  }
};

Job Execution ✅

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



int main(){
    int n,m;
    cin>>n>>m;

    vector<int>ans(n);

    if(n<=m){
        for(int i=0;i<n;i++){
            ans[i]=i+1;
        }
    }
    else{
        
        int k=n/m;
        // int r=n%m;
        int j=0;
        for(int i=0;i<n;i++){
            ans[i]=j+1;
            j++;
            j%=m;
        }
        

        

    }

    for(int i=0;i<n;i++){
        cout<<ans[i]<<" ";
    }
    cout<<endl;
}

King Dreams ✅
Intuit

Company – WPP
Role – Data Analyst
Exp. – Fresher
Apply Here – https://www.linkedin.com/jobs/view/3788137565

Company – Facets Gems Polishing Works Pvt. Ltd.
Role – Data Analyst
Exp. – Fresher
Apply Here – https://www.simplyhired.co.in/job/qQdJcnUtaAA42tJ4G4XSq7sdgxkbMH8GyZl7f0FOkVHbIt64ytOUwA

Company – Anurag Electronic Gujarat
Role – Data Scientist
Exp. – 0-2 yrs
Apply Here – https://www.naukri.com/job-listings-data-scientist-phd-only-anurag-electronic-gujarat-mumbai-0-to-2-years-010421006391?src=sortby&sid=17069366294443773_1&xp=1&px=1&nignbevent_src=jobsearchDeskGNB

Company – Atmecs
Role – Data Scientist
Exp. – 0-1 yr
Apply Here – https://www.naukri.com/job-listings-data-scientist-atmecs-technologies-hyderabad-0-to-1-years-020224008496?src=sortby&sid=17069366294443773_1&xp=4&px=1&nignbevent_src=jobsearchDeskGNB


Company – NextGen Technologies
Role – Data Science Intern
Exp. –  Fresher
Apply Here – https://www.linkedin.com/jobs/view/3820371899

Company – Assurant
Role – BI Intern
Exp. –  Fresher
Apply Here – https://www.linkedin.com/jobs/view/3820637203

Company – Blackcoffer
Role – Data Science Intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/work-from-home-data-science-internship-at-blackcoffer1706929807?utm_source=cp_link&referral=web_share

Company –   Jambudweep Shodh Kendra
Role – Data Analytics Intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/work-from-home-part-time-data-analytics-internship-at-jambudweep-shodh-kendra1706902404?utm_source=cp_link&referral=web_share

string makeLexicographicallySmallestPalindrome(string s) { 
    int n=s.length(); 
    unordered_map<char, int> cnt; 
    string R = ""; 

    for (int i = 0; i < n; i++) { 
        char a = s[i]; 
        cnt[a]++; 
    } 

    for (char i = 'a'; i <= 'z'; i++) { 
        if (cnt[i] % 2 != 0) 
            R += i; 
    } 

    int l = R.length(); 
    int j = 0; 

    for (int i = l - 1; i >= l / 2; i--) { 
        cnt[R[i]]--; 
        R[i] = R[j]; 
        cnt[R[j]]++; 
        j++; 
    } 

    string first, middle, second; 

    for (char i = 'a'; i <= 'z'; i++) { 
        if (cnt[i] != 0) { 
            if (cnt[i] % 2 == 0) { 
                int j = 0; 
                while (j < cnt[i] / 2) { 
                    first += i; 
                    j++; 
                } 
            } else { 
                int j = 0; 
                while (j < (cnt[i] - 1) / 2) { 
                    first += i; 
                    j++; 
                } 
                middle += i; 
            } 
        } 
    } 

    second = first; 
    reverse(second.begin(), second.end()); 
    string resultant = first + middle + second; 
    return resultant; 
}

Palindromic Algorithm ✅

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

class Directory { 
public: 
    unordered_map<string, unordered_set<string>> children; 
     
    Directory(vector<vector<string>>& edges) { 
        for (auto& edge : edges) { 
            children[edge[0]].insert(edge[1]); 
        } 
    } 
     
    void mkdir(string parent, string folder) { 
        children[parent].insert(folder); 
    } 
     
    void rmdir(string folder) { 
        children.erase(folder); 
        for (auto& pair : children) { 
            pair.second.erase(folder); 
        } 
    } 
     
    int countSubdir(string folder) { 
        int count = 1; 
        for (auto& child : children[folder]) { 
            count += countSubdir(child); 
        } 
        return count; 
    } 
}; 

vector<int> getSubFolders(vector<vector<string>>& existingStructureEdges, vector<string>& queries) { 
    Directory dir(existingStructureEdges); 
    vector<int> results; 
     
    for (string& query : queries) { 
        stringstream ss(query); 
        string operation, x, y; 
        ss >> operation; 
         
        if (operation == "mkdir") { 
            ss >> x >> y; 
            dir.mkdir(x, y); 
        } else if (operation == "rmdir") { 
            ss >> x; 
            dir.rmdir(x); 
        } else if (operation == "count_subdir") { 
            ss >> x; 
            results.push_back(dir.countSubdir(x)); 
        } 
    } 
     
    return results; 
}

File Structure ✅

int min(string str){
unordered_map<char,int>mp;
for(char :str){
  mp[ch]++;
}
unodered_set<int>d;
for(auto it:mp){
  d.insert(it.second);
}
return d.size();

}

Music Teacher ✅
Only 4 test cases pass

Mitsogo Exam Done✅

Manish:
Company Name : Freshworks INC

Role : 1. Application Developer
           2. Software Developer

Package Freshers: 5LPA
Package Experience (1-2 yrs) : 7.5 LPA

Skills Needed : Java , Python , HTML, CSS, Java Script,  SQL and DBMS.

Location: Bangalore and Chennai (currently remote)

Passed out : 2021 - 2025

Round 1 : Coding Assessment Live in Google meet with interviewer (30 mins)

Round 2 : Technical Interview (30 mins)

Round 3 : HR Interview (20 mins)

https://docs.google.com/forms/d/e/1FAIpQLScSh9qPFBce3XvlCUbm4ZpIKuqTcN6IIsdTLPh2WXhAC4XRfQ/viewform?usp=sf_link