
Testing for the Hack-A-Thon
My name is vishek patel This is my blog This is my another blog This is the third blog Testing the italics option

My name is vishek patel This is my blog This is my another blog This is the third blog Testing the italics option
//Stack implementation in C++/C #include <iostream> using namespace std; int top =-1; void push(int * p,int size); void pop(); void print(int *p,int size); int peak(int *p); int main() { int arr[3]; int size=sizeof(arr)/sizeof(arr[0]); p...
Link to the problem : https://www.codechef.com/problems/AIRLINE Chef has 3 bags that she wants to take on a flight. They weigh A, B, and C kgs respectively. She wants to check-in exactly two of these bags and carry the remaining one bag with her. Th...
Template Class in C++ #include <iostream> using namespace std; template <class T> class Vishek { private: T num1; T num2; public: T add(T a,T b); }; template <class T> T Vishek<T>::add(T a, T b){ return (a+b); }...
#include <iostream> using namespace std; void findElement(int*p,int size1,int x1){ for (int i=0;i<size1;i++){ if (p[i]==x1){ cout<<"Voilla!, We found it at index "<<i<<endl; return; } } cout<<"Sorr...
#include <iostream> #include <stdbool.h> using namespace std; int main() { bool isFound=false; int arr[7]={ 4,6,7,8,10,12,14 }; int target=20; int num1=0,num2=0; for(int i=0;i<6;i++){ if(arr[i]+arr[i+1]==target){...
#include <iostream> using namespace std; int maxSalary(int (*p)[3],int row,int column){ int Tmax=0; int*arr=new int[row]; for (int i=0;i<row;i++){ for(int j=0;j<column;j++) arr[i]+= *(*(p+i)+j); } for(int i=0;i<row;...
Linked List Implementaion in C++ What is a LinkedList? LinkedList is a Data Structure model which used to make the accessibiity of data more easy .Each element in a LinkedList is know as a node which links or points to another node. The address of t...
// Online C++ compiler to run C++ program online #include <iostream> using namespace std; int main() { int arr[]={40,20,46,50,4,90}; int size=sizeof(arr)/sizeof(int); int min; int temp; for(int i=0;i<size;i++){ min=i; ...