Showing posts with label data structure. Show all posts
Showing posts with label data structure. Show all posts

Friday, June 11, 2021

Arrays - DS | HackerRank | DS | Arrays | Color the Code

 Arrays - DS ( HackerRank )


Solution : 


import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;

class Result {

    /*
     * Complete the 'reverseArray' function below.
     *
     * The function is expected to return an INTEGER_ARRAY.
     * The function accepts INTEGER_ARRAY a as parameter.
     */

    public static List<Integer> reverseArray(List<Integer> a) {
    // Write your code here
        
    Collections.reverse(a);
    return a;
    }

}

public class Solution {
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new 
        InputStreamReader(System.in));
        BufferedWriter bufferedWriter = new BufferedWriter(new 
        FileWriter(System.getenv("OUTPUT_PATH")));

        int arrCount = Integer.parseInt(bufferedReader.readLine()
        .trim());

        List<Integer> arr = Stream.of(bufferedReader.readLine()
        .replaceAll("\\s+$""").split(" "))
        .map(Integer::parseInt)
        .collect(toList());

        List<Integer> res = Result.reverseArray(arr);

        bufferedWriter.write(
            res.stream()
                .map(Object::toString)
                .collect(joining(" "))
            + "\n"
        );

        bufferedReader.close();
        bufferedWriter.close();
    }
}




                        

Friday, January 1, 2021

Java Sort | Data Structure | HackerRank | Java | Solution | Color The Code



Problem : https://www.hackerrank.com/challenges/java-sort/problem

Solution :

Java Generics | Data Structure | HackerRank | Java | Practice | Solution | Color The Code



Problem : https://www.hackerrank.com/challenges/java-generics/problem

Solution : 

Java Map | Data Structure | Java | HackerRank | Solution | Color The Code



Problem : https://www.hackerrank.com/challenges/phone-book/problem

Solution : 

Java List | Data Structure | HackerRank | JAVA | Solution | Color The Code



Problem : https://www.hackerrank.com/challenges/java-list/problem

Solution :

Java Arraylist | Data Structure | HackerRank | JAVA | Solution | Color The Code



Problem  : https://www.hackerrank.com/challenges/java-arraylist/problem

Solution :

Java Subarray | Data Structure | HackerRank | JAVA | Solution | Color The Code



Problem : https://www.hackerrank.com/challenges/java-negative-subarray/problem

Solution :

Java 2D Array | Data Structure | HackerRank | JAVA | Solution | Color The Code



Problem : https://www.hackerrank.com/challenges/java-2d-array/problem

Solution : 

Friday, October 30, 2020

IMPLEMENT STACK USING ARRAY

IMPLEMENTATION  USING ARRAY

DATA STRUCTURE

We will use structure to create stack that will have three things
1- Max Size : contains the maximum size stack can have or its capacity
2- Top : contains the index of the top element
3- items array or pointer to array : contains the elements of stack








Header Files :





operations to perform :

1- Initialization of stack




2- Getting size of stack




3- Check the status i.e. is the stack empty or not




4- Check the status i.e. is the stack full or not




5- Adding element to stack using Push operation




6- Removing the top of the stack using Pop operation





7- Getting the top of the stack