Language93 Balanced Parentheses Checker Example Input : (()(()))(() Output : NO My answer: import java.util.*; class BalancedParenthesesChecker { public static void main(String[] args) { BalancedParenthesesChecker t = new BalancedParenthesesChecker(); Scanner kb = new Scanner(System.in); String s = kb.nextLine(); System.out.println(t.solution(s)); } String solution(String s) { char[] ca = s.toCharArray(); Stack st = new Stack(); for(c.. 2024. 1. 4. Anagram Counting Algorithm Example Input : bacaAacba abc Output : 3 My answer: import java.util.*; class AnagramCounter { public static void main(String[] args) { AnagramCounter t = new AnagramCounter(); Scanner kb = new Scanner(System.in); String a = kb.nextLine(); String b = kb.nextLine(); System.out.println(t.solution(a, b)); } int solution(String a, String b) { int cnt = 0; Map mapB = new HashMap(); for(char c : b.toC.. 2024. 1. 2. Distinct Element Subarrays Example Input : 7 4 20 12 20 10 23 17 10 Output : 3 4 4 3 My answer: import java.util.*; class DistinctElementsInSubarrays { public static void main(String[] args) { DistinctElementsInSubarrays t = new DistinctElementsInSubarrays(); Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int k = kb.nextInt(); int[] a = new int[n]; for(int i = 0; i < n; i++) { a[i] = kb.nextInt(); } for(int j .. 2024. 1. 1. Anagram Examples Input : AbaAeCe baeeACA Output : YES Input : abaCC Caaab Output : NO My answer: import java.util.*; class AnagramChecker { public static void main(String[] args) { AnagramChecker t = new AnagramChecker(); Scanner kb = new Scanner(System.in); String a = kb.nextLine(); String b = kb.nextLine(); System.out.println(t.solution(a,b)); } String solution(String a, String b) { String answer = "Y.. 2023. 12. 30. 이전 1 2 3 4 ··· 24 다음
