An O(n log(n)) solution in Java.

What it does:

• Store start date and end date.
• Sort it by the start date. In case of a clash, sort it by end date. O(n log(n)) complexity is due to sorting.
• Store the last considered timings in array last.
• Work with each elements in such a way that you squeeze down the end date as much as possible.
• That is it!

import java.io.*;
import java.util.*;
class Main
{
    public static void main(String[] args) throws IOException
    {

My program is being killed due to excessive memory usage. What's the problem?

import java.io.*;
import java.util.*;
class Main
{
    public static void main(String[] args) throws IOException
    {
        BufferedReader st = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(st.readLine());
        int[] data = new int[n];
        for(int i = 0; i < n; i++) data[i] = Integer.parseInt(st.readLine());
 
        for(int i = 1; i < n; i++)
        {
            int rank = 1;
            for(int j = 0; j < i; j++)
            {
                if(data[j] > data[i]) rank++;
            }
            System.out.println(rank+"");
        }

Can anybody please tell me why am I getting WA for all the test cases?

Works in BlueJ.

import java.util.*;
class ZCO14
{
    public static void main(String[] args)
    {
        Scanner s = new Scanner(System.in);
 
        int n = s.nextInt();
 
        long[] list = new long[n];
        int[] freq = new int[n];
 
        for(int i = 0; i < n; i++) {list[i] = s.nextLong(); freq[i] = 1;}
 
        Arrays.sort(list);
 
        for(int i = 1; i < n; i++)
        {
            if(list[i] == list[i-1])
            {

I took a non-bitwise operator approach in JAVA. Getting wrong answer. Help, please?

import java.util.*;
class hussainSet
{
    public static void main(String[] args)
    {
        Scanner s = new Scanner(System.in);
 
        int n = s.nextInt();
        int m = s.nextInt();
 
        double[] arr = new double[n];
        for(int i = 0; i < n; i++) arr[i] = s.nextDouble();
 
        quicksort(arr, 0, n-1);
 
        int[] query = new int[m];
        for(int i = 0; i < m; i++) query[i] = s.nextInt();
 
        int done_so_far = 0;
        for(int i = 0; i < m; i++)

Stupid me. Thank you!

Could someone please tell me why this baby gives 3 wrong answers?

import java.util.*;
class Main
{
    public static void main(String[] args)
    {
        Scanner s = new Scanner(System.in);
 
        int n = Integer.parseInt(s.nextLine().trim());
        String a = "";
        while(n > 0)
        {
            a += s.nextLine();
            n--;
        }
        String[] data = a.toLowerCase().replaceAll("[^a-z]"," ").split(" +");
        
        \\ Removing duplicates
        data = new HashSet<String>(Arrays.asList(data)).toArray(new String[0]);
        
        int len = data.length;
 
        \\ bubble-sort approach