HackerRank

HackerRank copied to clipboard

if max has reached the maximum possible value that is max == s, then there is no need to continue the loop

jilsonjoseph

Algorithms/Warmup in C and Python

1

Added all the solutions in Algorithms/Warmup either in C or Python or both

akankshamahajan99

jeffreydwalter

jnikita356

shari09

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 n = in.nextInt(); int...

Saurabhofficial7

Alternative solution to milatry time problem

DaraOladapo

Question: How is sorting defined as (n+m) log(n+m)? Shouldn't it be nlogn +mlogm?

1

nlogn for drives and mlogm for keyboard. So, if you sort both independently, shouldn't it be mlogm+nlogn , instead of (m+n)log(m+n) ?

tseth92

because it works fine with the hackerrank solution

yashodip

Add Left Rotation Java Solution

1

medifle