HackerRank is the market-leading coding test and interview solution for hiring developers. Start hiring at the pace of innovation!
HackerRank Alternatives See All See all HackerRank Alternatives Let’s Get Social
DayChallengeSolutionVideo Explaination 0 Hello, World Day0HelloWorld.java 1 Data Types Day1DataTypes.java 2 Operators Day2Operators.java 3 Intro to Conditional Statements Day3IntroToConditionalStatements.java 4 Class vs. Instance Day4ClassVsInstance.java 5 Loops Day5Loops.java 6 Let's Rev...
CGPA = c; }publicStringgetName(){returnname; }publicDoublegetCGPA(){returnCGPA; } }publicclassSolution{privatefinalstaticScannerscan=newScanner(System.in);privatefinalstaticPrioritiespriorities=newPriorities();publicstaticvoidmain(String[] args){inttotalEvents=Integer.parseInt(scan.nextLine()); List<...
如果自动判断器不支持异常，但支持进程退出代码，则如果抛出异常，则执行System.exit。)
问摩根和字符串HackerRankEN我认为，当你在两个堆栈的顶部有相同的字母时，问题就会发生:你不能随意选择...
1.从头到尾打印链表 输入一个链表,按链表值从尾到头的顺序返回一个ArrayList. # -*- coding:utf-8 -*- class ListNode: def __init__(self, x): self.val = x self.next = None class Solution: def printListFromTailToHead(self, listNode): l =[] while listNode: l.append(listNode.val) lis...
public class Solution { static boolean isAnagram(String a, String b) { boolean x= true; if (a.length()!=b.length()){ x=false; } a= a.toLowerCase(); b=b.toLowerCase(); int al[]=new int [256]; for(char c : a.toCharArray()){ ...
9 Multiple Linear Regression 30 Solution.java 30 Days of Code DayChallengePointsSolution 0 Hello, World 30 Solution.java 1 Data Types 30 Solution.java 2 Operators 30 Solution.java 3 Intro to Conditional Statements 30 Solution.java 4 Class vs. Instance 30 Solution.java 5 Loops 30 Solution.java...
import java.util.*; class Solution{ public static void main(String []argh) { Scanner in = new Scanner(System.in); while(in.hasNext()){ String s = in.next(); Stack<Character> st = new Stack<Character>(); for(int i = 0;i < s.length();i++){ if(!st.empty()){ switch(s....