How To DownLoad Full YouTube PlayList ..!!!

    How To DownLoad Full YouTube PlayList..!!! 

Method 1 : Using Software(4K Downloader) 

Step 1 :  Download 4K downloader here 

Step 2 :  Go to the YouTube PlayList Page And Copy the Address of the URL. 

Step 3 :  Open 4K downloader .
                      ClipBoard will be automatically copied into 4K Downloader.

Step 4 : Click on Paste Link.

Step 5 : It Will open a window Showing Download Full Playlist ..

                  Click on It.

Step 6 : It will show parsing window.It will take 2-3 minutes according to your internet speed.

            If asked for activation . Click on Skip.  

  

             Choose the format and other preferences and Click on Download .

   

          

Step 7 : Then the Downloader starts and download all the videos in playlist .

Step 8 : Downloaded files can be found on location in C drive in my videos / You can                         save your preferences in 4K downloader setting to save the location to store the                  downloaded videos .  

Method 2 : Using Command Line 

Step 1 : Download youtube_dl utility here

Step 2 : Add the entry to your Desktop's Environment Variables.

          

          How to Add executables in Environment variables(Execute application from Command Line Interface)

Step 3 : Open Command Prompt.

Step 4 : type youtube-dl <Link of the playlist to be downloaded>

Step 5 : This will automatically download all the videos in the playList in 720p. To choose                      from various options read youtube-dl documentation

Step 6 : The Downloaded files can be found in the <User_currently_logged_in> directory                     in C drive .

Read More

Hacker Rank - Day 23 : BST Level-Order Traversal

                   Day 23 : BST Level-Order Travarsal

Solution In Java 8:

import java.util.*;

import java.io.*;

class Node{

    Node left,right;

    int data;

    Node(int data){

        this.data=data;

        left=right=null;

    }

}

class Solution{

static void levelOrder(Node root){

      Queue<Node> queue = new LinkedList<>();

        queue.add(root);

        while (!queue.isEmpty()) {

            Node curr = queue.remove();

            System.out.print(curr.data + " ");

            if (curr.left != null) queue.add(curr.left);

            if (curr.right != null) queue.add(curr.right);

        }
    }

public static Node insert(Node root,int data){
        if(root==null){
            return new Node(data);
        }
        else{
            Node cur;
            if(data<=root.data){
                cur=insert(root.left,data);
                root.left=cur;
            }
            else{
                cur=insert(root.right,data);
                root.right=cur;
            }
            return root;
        }
    }
    public static void main(String args[]){
            Scanner sc=new Scanner(System.in);
            int T=sc.nextInt();
            Node root=null;
            while(T-->0){
                int data=sc.nextInt();
                root=insert(root,data);
            }
            levelOrder(root);
        }
}

Solution In Python 3: 

import sys

class Node:

    def __init__(self,data):

        self.right=self.left=None

        self.data = data

class Solution:

    def insert(self,root,data):

        if root==None:

            return Node(data)

        else:

            if data<=root.data:

                cur=self.insert(root.left,data)

                root.left=cur

            else:

                cur=self.insert(root.right,data)

                root.right=cur

        return root

    def levelOrder(self, root):

        queue = [root]

        while len(queue) is not 0:

            curr = queue[0]

            queue = queue[1:]

            print(str(curr.data) + " ", end="")

            if curr.left is not None:

                queue.append(curr.left)

            if curr.right is not None:

                queue.append(curr.right)

T=int(input())

myTree=Solution()

root=None

for i in range(T):

    data=int(input())

    root=myTree.insert(root,data)

myTree.levelOrder(root)

Read More

Hacker Rank - Day 22 : Binary Search Trees

                   Day 22 : Binary Search Trees

Solution In Java 8:

import java.util.*;

import java.io.*;

class Node{

    Node left,right;

    int data;

    Node(int data){

        this.data=data;

        left=right=null;

    }

}

class Solution{

public static int getHeight(Node root){

         return root == null ? -1 : 1 + Math.max(getHeight(root.left), getHeight(root.right));

    }

public static Node insert(Node root,int data){

        if(root==null){

            return new Node(data);

        }

        else{

            Node cur;

            if(data<=root.data){

                cur=insert(root.left,data);

                root.left=cur;

            }

            else{

                cur=insert(root.right,data);

                root.right=cur;

            }

            return root;

        }

    }

public static void main(String args[]){

        Scanner sc=new Scanner(System.in);

        int T=sc.nextInt();

        Node root=null;

        while(T-->0){

            int data=sc.nextInt();

            root=insert(root,data);

        }

        int height=getHeight(root);

        System.out.println(height);

    }

}

Solution In Python 3: 

class Node:
    def __init__(self,data):
        self.right=self.left=None
        self.data = data
class Solution:
    def insert(self,root,data):
        if root==None:
            return Node(data)
        else:
            if data<=root.data:
                cur=self.insert(root.left,data)
                root.left=cur
            else:
                cur=self.insert(root.right,data)
                root.right=cur
        return root
    def getHeight(self,root):

        return -1 if root is None else 1 + max(self.getHeight(root.left), self.getHeight(root.right))
T=int(input())
myTree=Solution()
root=None
for i in range(T):
    data=int(input())
    root=myTree.insert(root,data)
height=myTree.getHeight(root)

print(height)       

Read More

Hacker Rank - Day 21 : Generics

                   Day 21 : Generics

Solution In Java 8:

import java.util.*;

class Printer <T> {
    /**
    *    Method Name: printArray
    *    Print each element of the generic array on a new line. Do not return anything.
    *    @param A generic array
    **/
    
   public static <Element> void printArray(Element[] array) {
        for (Element element : array) {
            System.out.println(element);
        }

    }
}

public class Generics {
    
    public static void main(String args[]){
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        Integer[] intArray = new Integer[n];
        for (int i = 0; i < n; i++) {
            intArray[i] = scanner.nextInt();
        }

        n = scanner.nextInt();
        String[] stringArray = new String[n];
        for (int i = 0; i < n; i++) {
            stringArray[i] = scanner.next();
        }
        
        Printer<Integer> intPrinter = new Printer<Integer>();
        Printer<String> stringPrinter = new Printer<String>();
        intPrinter.printArray( intArray  );
        stringPrinter.printArray( stringArray );
        if(Printer.class.getDeclaredMethods().length > 1){
            System.out.println("The Printer class should only have 1 method named printArray.");
        }
    } 

}

Read More

Hacker Rank - Day 20 : Sorting

                                     Day 20 : Sorting

Solution In Java 8:

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int temp;
        int n = in.nextInt();
        int a[] = new int[n];
        int numSwaps = 0, firstElement,lastElement;
        
        for(int a_i=0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
       for (int i = 0; i < n; i++) {
            for (int j = 0; j < n - 1; j++) {
                if (a[j] > a[j + 1]) {
                    temp = a[j];
                    a[j] = a[j + 1];
                    a[j + 1] = temp;
                    numSwaps++;
                }
            }

            if (numSwaps == 0) {
                break;
            }
       }     
        System.out.println("Array is sorted in "+numSwaps+" swaps.");
        System.out.println("First Element: "+a[0]);
        System.out.println("Last Element: "+a[n-1]);
    }
}

Solution In Python 3: 

#!/bin/python3

import sys


n = int(input().strip())
a = [int(a_temp) for a_temp in input().strip().split(' ')]
numSwaps = 0
for i in range(0,n):
    for j in range(0,n-1):
        if(a[j] > a[j+1]):
            temp = a[j]
            a[j] = a[j+1]
            a[j+1] = temp
            numSwaps = numSwaps+1
            
print("Array is sorted in {} swaps.".format(numSwaps))
print("First Element: {}".format(a[0]))
print("Last Element: {}".format(a[n-1]))

Read More

Hacker Rank - Day 18 : Queues and Stacks

                   Day 18 : Queues and Stacks

Solution In Java 8:

import java.io.*;
import java.util.*;

public class Solution {
    Queue <Character> queue = new LinkedList<>();
    Deque <Character> stack = new ArrayDeque<>();
   
    public void pushCharacter(char ch){
        stack.push(ch);
    }
    public void enqueueCharacter(char ch){
        queue.add(ch);
    }
    public char popCharacter(){
        return stack.pop();
    }
    public char dequeueCharacter(){
        return queue.remove();
    }
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        String input = scan.nextLine();
        scan.close();

        // Convert input String to an array of characters:
        char[] s = input.toCharArray();

        // Create a Solution object:
        Solution p = new Solution();

        // Enqueue/Push all chars to their respective data structures:
        for (char c : s) {
            p.pushCharacter(c);
            p.enqueueCharacter(c);
        }

        // Pop/Dequeue the chars at the head of both data structures and compare them:
        boolean isPalindrome = true;
        for (int i = 0; i < s.length/2; i++) {
            if (p.popCharacter() != p.dequeueCharacter()) {
                isPalindrome = false;               
                break;
            }
        }

        //Finally, print whether string s is palindrome or not.
        System.out.println( "The word, " + input + ", is "
                           + ( (!isPalindrome) ? "not a palindrome." : "a palindrome." ) );
    }
}



Solution In Python 3: 

import sys

class Solution:

    def __init__(self):

        self.stack = []

        self.queue = []

    def pushCharacter(self , ch):

        self.stack.append(ch)

    def enqueueCharacter(self , ch):

        self.queue.append(ch)

    def popCharacter(self):

        return self.stack.pop()

    def dequeueCharacter(self):

        ch = self.queue[0]

        self.queue = self.queue[1:]

        return ch       

        

s=input()

obj=Solution()   

l=len(s)

for i in range(l):
    obj.pushCharacter(s[i])
    obj.enqueueCharacter(s[i])
    
isPalindrome=True

for i in range(l // 2):
    if obj.popCharacter()!=obj.dequeueCharacter():
        isPalindrome=False
        break
#finally print whether string s is palindrome or not.
if isPalindrome:
    print("The word, "+s+", is a palindrome.")
else:
    print("The word, "+s+", is not a palindrome.")    

Read More

Hacker Rank - Day 19 : Interfaces

                   Day 19 : Interfaces

Solution In Java 8:

import java.io.*;
import java.util.*;

interface AdvancedArithmetic{
   int divisorSum(int n);
}
class Calculator implements AdvancedArithmetic
{
    public int divisorSum(int n)
        {
            int sum=0;
             for(int i=1;i<=n/2;i++)
             {
                 if(n%i==0)
                 {
                     sum=sum+i;
                 }
             }
                return (sum+n);
        }
}
class Solution {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        scan.close();
       
          AdvancedArithmetic myCalculator = new Calculator();
        int sum = myCalculator.divisorSum(n);
        System.out.println("I implemented: " + myCalculator.getClass().getInterfaces()[0].getName() );
        System.out.println(sum);
    }
}

Read More