VizShaT

React Lifcycle https://blog.bitsrc.io/understanding-react-v16-4-new-component-lifecycle-methods-fa7b224efd7d https://www.youtube.com/watch?time_continue=38&v=nLF0n9SACd4

deprecated

1. componentWillMount

2. componentWillReceiveProps

3. componentWillUpdate

4. Mounting

VizShaT

// Scope - Where are you in the code and what you can see from there.

// Closure- function can always remeber the variables that they could see at creation.

/*
var name = "Veer";

function sayName(){
	console.log(name);
}

VizShaT

<style id="jsbin-css">
div {
  height: 40px;
  padding: 20px;
  border: 8px solid green;
  background: yellow
}

/*
.two {

VizShaT

JavaScript Learning Resource

If you are new to JavaScript then start with this book.

1. Vanilla Js Beginner - Head First JavaScript Programming

Websites -

1. The Modern JavaScript Tutorial
2. How To

Topic wise best tutorial

VizShaT

/*
http://www.practice.geeksforgeeks.org/problem-page.php?pid=700234
http://www.geeksforgeeks.org/sort-linked-list-already-sorted-absolute-values/
*/
/* The structure of the Linked list Node is as follows:
struct Node
{
    Node* next;
    int data;
}; */

VizShaT

/*
http://www.practice.geeksforgeeks.org/problem-page.php?pid=700232
http://quiz.geeksforgeeks.org/doubly-linked-list/
*/
/* a node of the doubly linked list 
struct node
{
  int data;
  struct node *next;
  struct node *prev;

VizShaT

/*
http://www.geeksforgeeks.org/write-a-c-function-to-detect-loop-in-a-linked-list/
*/

bool has_cycle(Node* head) {
    Node *slow = head;
    Node *fast = head;
    
    while(slow && fast && fast->next){
        slow = slow->next;

VizShaT

Node* RemoveDuplicates(Node *head)
{
    Node *prev = head;
    Node *current = head->next;
    Node *temp = NULL;
    
    while(current != NULL){
        if(current->data == prev->data){
            temp = current;
            prev->next = current->next;

VizShaT

int GetNode(Node *head,int positionFromTail)
{
    Node *current = head;
    int count = 0;
    while(current != NULL){
        count++;
        current = current->next;
    }
    int position = count - positionFromTail;
    current = head;

VizShaT

/*
http://ideone.com/NzL6KP
http://www.practice.geeksforgeeks.org/problem-page.php?pid=981
*/


#include <iostream>
using namespace std;

int main() {