@praveen11

#include <iostream> #include <vector> using namespace std; int main() { vector<int> v={-2, 1, -3, 4, -1, 2, 1, -5, 4}; int start=-1, end=-1, temp=-1, sum=0, maxSum=-1; for(int i=0; i<v.size(); i++){ if(sum==0) temp=i; sum+=v[i];

#include <iostream> #include <vector> #include <queue> using namespace std; class Solution { private: bool detectCycle(int start, vector<vector<int>>& adj, vector<int>& vis) { queue<pair<int, int>> q; vis[start] = 1;

#include <iostream> #include <vector> #include <queue> #include <algorithm> using namespace std; vector<int> bfs(int start, int n, vector<int> adj[]){ vector<int> bfsV; vector<int> vis(n,0); queue<int> q;

#include <iostream> #include <vector> using namespace std; class Node{ public: int data; Node* next; public: Node(int data1){

const arr = [1,2,3,4,5,6,7]; arr.push(8); console.log(arr); arr.pop(); console.log(arr); arr.shift(); console.log(arr); arr.splice(2); console.log(arr);

const func = (...arr) => console.log(arr); func(1,2,3,4,5); const app = (a,...arr) => console.log(a,arr); app(1,2,3,4,5,6);

// object destructing details = { name : 'praveen', id : 1, age : '22' }; const {name,age} = details;

a = { name:'praveen', id:1 } b = {...a, age:22 } console.log(b['name'])

class A{ name = 'praveen'; printName = () => console.log(this.name); } class B extends A{ name = 'praveen kumar'; age = 22; printDetails = () => console.log(this.name + this.age); }

#include <iostream> using namespace std; int main() { int t; cin>>t; while(t--){ int n; cin>>n; int a[n]; for(int i=0;i<n;i++){

#include <iostream> #include <vector> using namespace std; int main() { int n; cin>>n; int a[n]; for(int i=0;i<n;i++){ cin>>a[i]; }

#include <iostream> #include <algorithm> using namespace std; int main() { int n; cin>>n; int a[n]; for(int i=0;i<n;i++){ cin>>a[i]; }

s1=input() s2=input() l=[0]*26 for i in s1: l[ord(i)-97]+=1 #l[i]=a l[97-97]=1 for i in s2: l[ord(i)-97]+=1 flag=0 for i in l: if(i%2!=0):

s1=input() s2=input() l=[0]*26 for i in s1: l[ord(i)-97]+=1 #l[i]=a l[97-97]=1 for i in s2: l[ord(i)-97]+=1 flag=0 for i in l: if(i%2!=0):

#include<iostream> #include<vector> #include<algorithm> using namespace std; int main(){ int n=9; int a[]={-5,2,-7,-2,8,4,6,1,3}; // sort(a,a+n); for(int i=0;i<n;i++){ for(int j=1;j<n;j++){

#include <iostream> using namespace std; int main() { string s="PraVeEn"; cout<<s<<"\n"; for(int i=0;i<s.size();i++){ s[i]=tolower(s[i]); } cout<<s<<"\n";

#include <iostream> #include <vector> #include <string> #include <algorithm> using namespace std; int check(string s,int count,char ch){ int res=0; for(int i=0;i<s.length();i++){ if(s[i]==ch)

#include <iostream> using namespace std; int main() { int n,k; cin>>n>>k; int a[n]; for(int i=0;i<n;i++){ cin>>a[i]; } int sum=a[0],start=0,i;

#include <iostream> #include <string> #include <sstream> #include <map> using namespace std; int main() { string str; getline(cin,str); map<string,int> mp; stringstream s(str);

#include <iostream> using namespace std; int main() { int a[]={1,4,5,3,2}; for(int i=0;i<5;){ if(a[i]!=i+1) swap(a[i],a[a[i]-1]); else i++; }