flash-anni

check the code below -------------------------------------------------------- https://stackblitz.com/edit/js-9vhtdm?file=index.js   //better ES5 object oriented in es5 //rules  //1. you can pass values in any order //2. default value //3. handle undefined in a better way  throw new Error function   Hero ( obj = undefined ) {      //if object is null return throw a new Error      if ( obj === undefined )      {        throw   new   Error ( "Empty Object" );      }      const   { name , age }= obj      this . name = name ;      this . age = age ; } //now extend myhero class function   Myhero ( obj = undefined )...

https://www.geeksforgeeks.org/window-sliding-technique/  working example https://www.onlinegdb.com/edit/BJX3JA0Zv code => #include <stdio.h> #include<iostream> #include<vector> using namespace std; //https://www.geeksforgeeks.org/window-sliding-technique/ int Windowslidingtechnique(vector<int> &vec,int element) {      //get sum      int sum=0;      for(int i=0;i<element;i++)      {          sum+=vec.at(i);      }      //sliding window technique      int windowSum=sum;      int maxSum=0;      for(int i=element;i<vec.size();i++)      {          windowSum+=vec.at(i)-vec.at(i-element);          maxSum=max(maxSum,windowSum);      }      return maxSum; } int main() {     vector<int> ve...

 working link more solution=> https://www.geeksforgeeks.org/find-a-triplet-that-sum-to-a-given-value/ code https://www.onlinegdb.com/edit/HkS7dTRWP solution below *******************************************************************************/ #include <stdio.h> #include<algorithm> #include<iostream> #include<vector> using namespace std; void triplet(vector<int> &vec,int sum) {     //sort the vector      sort(vec.begin(),vec.end());     int i=0;     int j=vec.size()-1;     while(j>=i)     {         if(vec.at(i)+vec.at(i+1)+vec.at(j)==sum)         {              const int a=vec.at(i);              const int b=vec.at(i+1);              const int c=vec.at(j);              std::cout <<a<<"-"...

 1. a binary search tree in c++ using a generic approach with both BFS and DFS approach    working tree    https://www.onlinegdb.com/edit/HkuQLdA-w code=> some properties of binary search tree-> 1. binary search tree is not always a balanced tree.  2. Inorder, traversing gives you sorted data.  3.  best is o(log n) and worst is O(n).  4. left node data is always less than root data and right node data always be greater than root data.  5. red-black tree STL map is a balanced binary search tree. *******************************************************************************/ #include <stdio.h> #include<iostream> #include<queue> using namespace std; template < typename T > class Node {   //can store any type of data private:   //genric data or store any type of data   T data;   //reference of left pointer   Node *left = nullptr;   //reference of right pointer   Node *rig...