Introduce Yourself Tips in Job Interview

 Thank you sir. My name is Adam, and I am grateful to be here. I recently graduated with a degree in ___, majoring in ___ from UNV.

During my academic journey, I developed a strong foundation in ***, and I had the opportunity to apply this knowledge in real-world settings through internships and hands-on projects. One notable project involved ____, where I [Highlight Your Contribution or Achievements].

Apart from my technical skills, I am known for my [Soft Skills], including effective communication, problem-solving, and adaptability. I believe that a well-rounded skill set is crucial in today's dynamic work environment.

My passion for [Relevant Industry or Field] is what initially drew me to this field. I am particularly fascinated by [Specific Aspect or Technology], and I am excited about the prospect of contributing to [Company or Project] where I can leverage my skills to [Goal or Contribution].

In my free time, I [Hobbies or Interests], which not only contribute to my personal growth but also enhance my ability to approach challenges with creativity and a positive mindset.

I am eager to bring my skills, enthusiasm, and commitment to excellence to a dynamic team. Thank you for considering my candidacy, and I look forward to the opportunity to contribute to [Company or Team]."

prefix tree/trie tree.......

#include<bits/stdc++.h>
using namespace std;
struct node
{
    bool endmark;
    node *next[27];
    node()
    {
        endmark=false;
        for(int i=0;i<27;i++)
        next[i]=NULL;
    }
}*root;
void insert(char *str,int len)
{
    node *cur=root;
    for(int i=0;i<len;i++)
    {
        int id=str[i]-'a';
        if(cur->next[id]==NULL)
        cur->next[id]=new node();
        cur=cur->next[id];
    }
    cur->endmark=true;
}
bool search(char *str,int len)
{
    node *cur=root;
    for(int i=0;i<len;i++)
    {
        int id=str[i]-'a';
        if(cur->next[id]==NULL)
        return false;
        cur=cur->next[id];
    }
    return cur->endmark;
}
main()
{
    int i,t,j,m,n;
    cin>>t;
    while(t--)
    {
        root=new node();
        cin>>m;
        while(m--)
        {
            char c[100];
            scanf("%s",c);
            insert(c,strlen(c));
        }
        cin>>n;
        while(n--)
        {
            char d[100];
            scanf("%s",d);
            if(search(d,strlen(d)))
            cout<<"YES"<<endl;
            else
            cout<<"NO"<<endl;
        }
    }
}

topological sort(code)...........

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#define Max 1000
#define pb push_back
#define ll long long
using namespace std;
ll indegree[Max];
vector<ll>v[Max];
vector<ll>ans;
ll topsort(ll m)
{
    ll i,j,l,k,taken[Max]={0};
    for(i=1;i<=m;i++)
    {
        for(j=1;j<=m;j++){
        if(indegree[j]==0&&!taken[j]){
        ans.pb(j);
        taken[j]=1;
        l=v[j].size();
        for(k=0;k<l;k++)
        indegree[v[j][k]]--;
        }
        }
    }
}
int main()
{
    ll m,n,i,x,y;
    while(cin>>m>>n)
    {
        if(m==0&&n==0)
        break;
        for(i=1;i<=m;i++)
        indegree[i]=0;
        while(n--)
        {
            cin>>x>>y;
            indegree[y]++;
            v[x].pb(y);
        }
        topsort(m);
        cout<<ans[0];
        for(i=1;i<ans.size();i++)
        cout<<" "<<ans[i];
        cout<<endl;
        for(i=1;i<110;i++)
        v[i].clear();
        ans.clear();

    }

}

struct sort(code)..........

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct node
{
    int a;
    int b;
};
bool cmp(const node c1, const node c2) {
return (c1.a < c2.a);
}
int main()
{
    int x;
    node v[5];
    for(int i=0;i<5;i++)
    {
        cin>>x;
        v[i].a=x;
        v[i].b=i;
    }
    sort(v,v+5,cmp);
    for(int i=0;i<5;i++)
    cout<<v[i].b<<" ";
}

prime_sieve(code)............

#include<iostream>
#include<cmath>
#include<cstdlib>
using namespace std;
bool a[1000001];
void sieve()
{
    long long i,j,m;
    m=sqrt(1000000);
    a[1]=1;
    a[0]=1;
    for(i=3;i<=m;i+=2)
    {
        if(a[i]==0)
        for(j=i*i;j<=1000000;j+=i+i)
        a[j]=1;
    }
}
int main()
{
    sieve();
    long long m;
    while(cin>>m)
    {
        if(m!=2&&m%2==0)
        cout<<"not prime"<<endl;
        else if(a[m]==0)
        cout<<"prime"<<endl;
        else
        cout<<"not prime"<<endl;
    }
}

prime factor(code)...........

#include<iostream>
#include<vector>
#include<cmath>
#define pb(a) push_back(a)
using namespace std;
int main()
{
    long n,i,m;
    vector<long>pfactor;
    cin>>n;
    m=sqrt(n);
    for(i=2;i<=m;i++)
    {
        if(n%i==0)
        while(n%i==0)
        {
            pfactor.pb(i);
            n/=i;
        }
    }
    if(n!=1)
    pfactor.pb(n);
    cout<<"number of factor :"<<pfactor.size()<<endl;
    for(i=0;i<pfactor.size();i++)
    cout<<pfactor[i]<<" ";
}

pair_kahini(code)........

#include<iostream>
#include<algorithm>
#include<vector>v;
#define ll long long
#define pb push_back
using namespace std;
pair<ll,ll>a[1000000];
ll m,i,ans[400000],x;
int main()
{
    cin>>m;
    for(i=0;i<m;i++)
    {
        cin>>a[i].first;
        a[i].second=i;
    }
    sort(a,a+m);
    ans[a[0].second]=a[0].first;
    for(i=1;i<m;i++)
    {
        if(a[i].first<a[i-1].first+1)
        a[i].first=a[i-1].first+1;
        ans[a[i].second]=a[i].first;
    }
    cout<<ans[0];
    for(i=1;i<m;i++)
    cout<<" "<<ans[i];
    cout<<endl;


}