#include <algorithm>
#include <iostream>
using namespace std;

// Function to check if two strings are anagrams
bool areAnagrams(string s1, string s2)
{
    // Sort both strings
    sort(s1.begin(), s1.end());
    sort(s2.begin(), s2.end());

    // Compare sorted strings
    return s1 == s2;
}

int main()
{
    string str1 = "listen";
    string str2 = "silent";

    if (areAnagrams(str1, str2)) {
        cout << "True" << endl;
    }
    else {
        cout << "False" << endl;
    }

    str1 = "gram";
    str2 = "arm";

    if (areAnagrams(str1, str2)) {
        cout << "True" << endl;
    }
    else {
        cout << "False" << endl;
    }

    return 0;
}

GFG intern ✅

IBM hiring Software Developer

2025 grads eligible

Apply Here : https://careers.ibm.com/job/20957333/software-developer-ahmedabad-in/

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

using namespace std;

vector<string> solve(int N, const vector<vector<string>>& input) {
    vector<pair<int, char>> in;

    for (const auto& vec : input) {
        int number = stoi(vec[0]);
        char symbol = vec[1][0];
        in.emplace_back(number, symbol);
    }
    sort(in.begin(), in.end());

    string msgs;
    int s = -1;
    vector<string> result;
    for (const auto& p : in) {
        msgs += p.second;
    }
    for (size_t i = 0; i < msgs.size(); i++) {
        if (msgs[i] == '*') {
            if (s != -1) {
                string msg = msgs.substr(s + 1, i - s - 1);
                string out;
                char last = '\0';
                
                for (char c : msg) {
                    if (c != last) {
                        out += c;
                        last = c;
                    }
                }

                if (!out.empty()) {
                    result.push_back(out);
                }
            }
            s = i; 
        }
    }

    return result;
}

Message Parsing✅

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

int solution(int A, int B) {
    if (A > B) {
        return A - B;
    }

    int mini = INT_MAX;
    int count = 0;

    for (int i = A; i <= B; i++) {
        int mod = B % i;
        int ans = count;

        if (mod)
            ans += (i - mod);

        mini = min(mini, ans);
        count++;
    }

    return mini;
} m

ultiple ✅

class node{
  public:
  long ind;
  char c;
  int t;
  node()
  {
   
  }
  node(long ind,char c,int t)
  {
    this->ind=ind;
    this->c=c;
    this->t=t;
  }
};
bool cmp(node &a,node &b)
{
  if(a.ind<b.ind)return true;
  else return false;
}
vector<string>fun(int n,vector<vector<string>>messages)
{
  vector<node>v(n);
  for(int i=0;i<n;i++)
  {
    long ind=stol(messages[i][0]);
    char c=messages[i][1][0];
    int t=i;
    node temp(ind,c,t);
    v[i]=temp;
  }
  sort(v.begin(),v.end(),cmp);
  vector<pair<int,string>>check;
  vector<string>ans;
  for(int i=0;i<n;i++)
  {
    if(v[i].c=='*')
    {
      int j=i+1;
      while(j<n&&v[j].c!='*'&&v[j-1].ind+1==v[j].ind)j++;
      if(v[j].c=='*')
      {
        int mx=0;
        string temp="";
        for(int k=i+1;k<j;k++)temp.push_back(v[k].c);
        for(int k=i;k<=j;k++)mx=max(mx,v[k].t);
        check.push_back({mx,temp});
      }
    }
  }
  sort(check.begin(),check.end());
  for(int i=0;i<check.size();i++)ans.push_back(check[i].second);
  return ans;
}

String Parse ✅

Urgently required Freshers for Foxconn💥💥💥💥💥

Qualification: BCom, BA, BSc, Diploma, BE, BTech
Trade- EEE/ ECE/ EIE/ Mechanical/ Mechatronics

Year of Passing: 2022- 2023

Male & Female eligible.

Date of Interview: 6th September.
Venue: Impact College of Engineering and Applied Sciences.

Fill the form here: https://forms.gle/Jyy3Lnm3JwxtCAVy6

Hurry Up !!!!

Hello Everyone

Open position at Forgeahead

Python Developer - Fresher (Python, SQL)



Send your resume
tanmay.kashettiwar@forgeahead.io

Fleetx is hiring for Frontend Developer role

Fresh grads can apply

Send resume to : yesha.verma@fleetx.io

Send your Resume at: ajavutech@gmail.com

WhatsApp: 9093333888

Email: hr@briskminds.com

Send your Updated Resume at: abhishek.gupta@chauwk.com

Send your Resume: yesha.verma@fleetx.io

🎯Walk-IN Drive at AMAR UJALA
Role: Data Science Traniee

Stipend: 20k
Location: Amar Ujala Limited C-21, Sector-59, Noida

💻Apply: https://docs.google.com/forms/d/e/1FAIpQLSf0tSZA-nsosDJ-ZIx8326iD1FkvHcpmheZ48Cj6LLx1Ga2vA/viewform

📌Lepide  is Hiring QA Freshers
Location: Noida! 🚀

Are you a talented QA looking to take your career to the next level?

If you’re passionate about QA and ready to make an impact

Send your resume to
nisha.rajput@lepide.com
ayushi.sharma@lepide.com

SELECT
  c.name AS name,
  COUNT(w.customer_id) AS warehouses,
  MIN(w.volume) AS min_volume,
  MAX(w.volume) AS max_volume,
  SUM(w.volume) AS total_volume
FROM
  customers c
INNER JOIN
  warehouses w ON c.id = w.customer_id
WHERE
  w.is_active = 1
GROUP BY
  c.name
ORDER BY
  c.name ASC;

IBM ✅

def getBitDistances(n):
    binary = bin(n)[2:]
    return max(len(binary) - 1 - i for i, bit in enumerate(binary) if bit == '1')

def getTopKBitDistances(numbers, k):
    bit_distances = [(num, getBitDistances(num)) for num in numbers]
    sorted_numbers = sorted(bit_distances, key=lambda x: (-x[1], -x[0]))
    return [num for num, _ in sorted_numbers[:k]]

IBM✅

Intern Hiring
15-20K Stipend

For 2026 Batch who want Referral in Google send me resume

class Solution {
    public int solution(int[][] peanuts, int[][] carrots) {
        int N = peanuts.length;
        int M = peanuts[0].length;

        int[][] dp = new int[N][M];

        dp[0][0] = peanuts[0][0] - carrots[0][0];

        for (int j = 1; j < M; j++) {
            dp[0][j] = dp[0][j - 1] + peanuts[0][j] - carrots[0][j];
        }

        for (int i = 1; i < N; i++) {
            dp[i][0] = dp[i - 1][0] + peanuts[i][0] - carrots[i][0];
        }

        for (int i = 1; i < N; i++) {
            for (int j = 1; j < M; j++) {
                dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]) + peanuts[i][j] - carrots[i][j];
            }
        }

        return dp[N - 1][M - 1];
    }

Atlan fellowship ✅