![](https://static.wixstatic.com/media/d35fad_29bd31e5510e4081bc10e47de1fa0699~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,lg_1,q_30,blur_30,enc_auto/d35fad_29bd31e5510e4081bc10e47de1fa0699~mv2.webp)
![Reverse an array in same array.](https://static.wixstatic.com/media/d35fad_29bd31e5510e4081bc10e47de1fa0699~mv2.jpg/v1/fill/w_218,h_214,fp_0.50_0.50,q_90,enc_auto/d35fad_29bd31e5510e4081bc10e47de1fa0699~mv2.webp)
prashant raj
- Apr 21, 2022
- 1 min
Reverse an array in same array.
#include <iostream> using namespace std; int main() { int arr[] = {1,2,3,4,5,6,7}; int len = sizeof(arr)/sizeof(arr[0]); for(int i =...
50
![](https://static.wixstatic.com/media/d35fad_29bd31e5510e4081bc10e47de1fa0699~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,lg_1,q_30,blur_30,enc_auto/d35fad_29bd31e5510e4081bc10e47de1fa0699~mv2.webp)
![write a program to reverse word in a string.](https://static.wixstatic.com/media/d35fad_29bd31e5510e4081bc10e47de1fa0699~mv2.jpg/v1/fill/w_218,h_214,fp_0.50_0.50,q_90,enc_auto/d35fad_29bd31e5510e4081bc10e47de1fa0699~mv2.webp)
prashant raj
- Mar 31, 2022
- 1 min
write a program to reverse word in a string.
#include <iostream> //#include<string.h> #include<string> using namespace std; int main() { //char str[100] = {"Hello World"}; string str...
80
![](https://static.wixstatic.com/media/d35fad_9a8e6f4724cb4ef7aff83715c5254a80~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,lg_1,q_30,blur_30,enc_auto/d35fad_9a8e6f4724cb4ef7aff83715c5254a80~mv2.webp)
![Producer Consumer Program in Multithreading.](https://static.wixstatic.com/media/d35fad_9a8e6f4724cb4ef7aff83715c5254a80~mv2.jpg/v1/fill/w_218,h_214,fp_0.50_0.50,q_90,enc_auto/d35fad_9a8e6f4724cb4ef7aff83715c5254a80~mv2.webp)
prashant raj
- Mar 27, 2022
- 1 min
Producer Consumer Program in Multithreading.
#include <iostream> #include<deque> #include<thread> #include<mutex> #include<condition_variable> std::deque<int> buffer; std::mutex mu;...
90
![](https://static.wixstatic.com/media/d35fad_bd9769c6046444a5aac0d199af102697~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,q_30,blur_30,enc_auto/d35fad_bd9769c6046444a5aac0d199af102697~mv2.webp)
![Write a program to find whether a number is power of 2?](https://static.wixstatic.com/media/d35fad_bd9769c6046444a5aac0d199af102697~mv2.jpg/v1/fill/w_315,h_237,fp_0.50_0.50,q_90,enc_auto/d35fad_bd9769c6046444a5aac0d199af102697~mv2.webp)
prashant raj
- Mar 18, 2022
- 1 min
Write a program to find whether a number is power of 2?
#include <iostream> using namespace std; int main() { int a = 128; int b = a-1; if(a && !(a & b)) { cout<<"Number is power of 2"<<endl;...
70
![](https://static.wixstatic.com/media/d35fad_bd9769c6046444a5aac0d199af102697~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,q_30,blur_30,enc_auto/d35fad_bd9769c6046444a5aac0d199af102697~mv2.webp)
![Count number of bits to be flipped to convert a to b.](https://static.wixstatic.com/media/d35fad_bd9769c6046444a5aac0d199af102697~mv2.jpg/v1/fill/w_315,h_237,fp_0.50_0.50,q_90,enc_auto/d35fad_bd9769c6046444a5aac0d199af102697~mv2.webp)
prashant raj
- Mar 18, 2022
- 1 min
Count number of bits to be flipped to convert a to b.
#include <iostream> using namespace std; int main() { int a = 3 , b = 4; int count = 0; int x = a ^ b; cout<<x<<endl; while(x) { if(x...
100
![](https://static.wixstatic.com/media/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,lg_1,q_30,blur_30,enc_auto/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.webp)
![Print the odd/even number through multiple thread.](https://static.wixstatic.com/media/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.jpg/v1/fill/w_218,h_214,fp_0.50_0.50,q_90,enc_auto/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.webp)
prashant raj
- Jan 29, 2022
- 1 min
Print the odd/even number through multiple thread.
// Example program #include <iostream> #include<thread> #include<mutex> #include<condition_variable> #include<chrono> using namespace...
190
![](https://static.wixstatic.com/media/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,lg_1,q_30,blur_30,enc_auto/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.webp)
![sort array](https://static.wixstatic.com/media/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.jpg/v1/fill/w_218,h_214,fp_0.50_0.50,q_90,enc_auto/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.webp)
prashant raj
- Jan 28, 2022
- 1 min
sort array
// Example program #include<iostream> using namespace std; void sort(int *arr,int length) { for(int i =0; i<length;i++) { for(int j =...
70
![](https://static.wixstatic.com/media/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,lg_1,q_30,blur_30,enc_auto/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.webp)
![How to Find the 2nd Highest number in array.](https://static.wixstatic.com/media/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.jpg/v1/fill/w_218,h_214,fp_0.50_0.50,q_90,enc_auto/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.webp)
prashant raj
- Jan 28, 2022
- 1 min
How to Find the 2nd Highest number in array.
// Example program #include<iostream> using namespace std; int getMaxValue(int *arr,int length) { int max = arr[0]; int max1 = arr[0];...
80
![](https://static.wixstatic.com/media/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,lg_1,q_30,blur_30,enc_auto/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.webp)
![Reverse Single LinkedList using class](https://static.wixstatic.com/media/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.jpg/v1/fill/w_218,h_214,fp_0.50_0.50,q_90,enc_auto/d35fad_322be506a682446fb00e9f7bbfdc0b35~mv2.webp)
prashant raj
- Dec 12, 2021
- 1 min
Reverse Single LinkedList using class
#include<iostream> using namespace std; class node { public: int info; node *next; }; class list { private: node *head; public: list()...
140