Update appNew update is available. Click here to update.
About
Institute of Engineering & Management 2025
My Stats
EXP gained
yellow-spark
15184
Level
7 (Expert)
Community stats
Discussions
7
Upvotes
9
Know more
Weekend contest rating
Contest attended
Problems solved
2021 2023
Better than %
Weekend contest rating
Contest attended
Problems solved
2021 2023
Better than %
164
Total problems solved
131
Easy
33
Moderate
0
Hard
0
Ninja
Jan Jan Feb Feb Mar Mar Apr Apr May May Jun Jun Jul Jul Aug Aug Sep Sep Oct Oct Nov Nov Dec Dec

Current streak:

0 days

Longest streak:

23 days

Less

More

Achievements
4
Ronin
Topics
Arrays
Binary Search
Sorting
+ 1 more
Discussions
can you find the solution on youtube
Interview problems

can you find the solution on youtube

profile
yashswag22
Published On 18-Nov-2023
35 views
0 replies
0 upvotes
can you find the solution on youtube
Interview problems

can you find the solution on youtube

profile
yashswag22
Published On 18-Nov-2023
35 views
0 replies
0 upvotes
can you find the solution on youtube
Interview problems

can you find the solution on youtube

profile
yashswag22
Published On 18-Nov-2023
35 views
0 replies
0 upvotes
can you find the solution on youtube
Interview problems

can you find the solution on youtube

profile
yashswag22
Published On 18-Nov-2023
35 views
0 replies
0 upvotes
can you find the solution on youtube
Interview problems

can you find the solution on youtube

profile
yashswag22
Published On 18-Nov-2023
35 views
0 replies
0 upvotes
Easy to understand c++ solution | Bit Manipulation | Striver Dsa Sheet
Interview problems 
vector<int> bitManipulation(int num, int i){
    vector<int>ans;
    i = i-1;
    if((num & (1<<i)) ==  1<<i )
    ans.push_back(1);
    else
    ans.push_back(0);

    ans.push_back(num | (1<<i));

    ans.push_back(num & ~(1<<i));
    
    return ans;
}
profile
yashswag22
Published On 07-Nov-2023
183 views
0 replies
0 upvotes
Easy to understand c++ solution | Bit Manipulation | Striver Dsa Sheet
Interview problems 
vector<int> bitManipulation(int num, int i){
    vector<int>ans;
    i = i-1;
    if((num & (1<<i)) ==  1<<i )
    ans.push_back(1);
    else
    ans.push_back(0);

    ans.push_back(num | (1<<i));

    ans.push_back(num & ~(1<<i));
    
    return ans;
}
profile
yashswag22
Published On 07-Nov-2023
183 views
0 replies
0 upvotes
Easy to understand c++ solution | Bit Manipulation | Striver Dsa Sheet
Interview problems 
vector<int> bitManipulation(int num, int i){
    vector<int>ans;
    i = i-1;
    if((num & (1<<i)) ==  1<<i )
    ans.push_back(1);
    else
    ans.push_back(0);

    ans.push_back(num | (1<<i));

    ans.push_back(num & ~(1<<i));
    
    return ans;
}
profile
yashswag22
Published On 07-Nov-2023
183 views
0 replies
0 upvotes
Easy to understand c++ solution | Bit Manipulation | Striver Dsa Sheet
Interview problems 
vector<int> bitManipulation(int num, int i){
    vector<int>ans;
    i = i-1;
    if((num & (1<<i)) ==  1<<i )
    ans.push_back(1);
    else
    ans.push_back(0);

    ans.push_back(num | (1<<i));

    ans.push_back(num & ~(1<<i));
    
    return ans;
}
profile
yashswag22
Published On 07-Nov-2023
183 views
0 replies
0 upvotes
Easy to understand c++ solution | Bit Manipulation | Striver Dsa Sheet
Interview problems 
vector<int> bitManipulation(int num, int i){
    vector<int>ans;
    i = i-1;
    if((num & (1<<i)) ==  1<<i )
    ans.push_back(1);
    else
    ans.push_back(0);

    ans.push_back(num | (1<<i));

    ans.push_back(num & ~(1<<i));
    
    return ans;
}
profile
yashswag22
Published On 07-Nov-2023
183 views
0 replies
0 upvotes