Day 18: Queues and Stacks Welcome to Day 18! Today we're learning about Stacks and Queues. Check out the Tutorial tab for learning materials and an instructional video!A palindrome is a word, phrase, number, or other sequence of characters which reads the same backwards and forwards. Can you determine if a given string, , is a palindrome?To solve this challenge, we must first take each character in , enqueue it in a queu.. 더보기 Day 17: More Exceptions Task Write a Calculator class with a single method: int power(int,int). The power method takes two integers, and , as parameters and returns the integer result of . If either or is negative, then the method must throw an exception with the message: n and p should be non-negative.Note: Do not use an access modifier (e.g.: public) in the declaration for your Calculator class.Input FormatInput from.. 더보기 Day 16: Exceptions - String to Integer Task Read a string, , and print its integer value; if cannot be converted to an integer, print Bad String.Note: You must use the String-to-Integer and exception handling constructs built into your submission language. If you attempt to use loops/conditional statements, you will get a score.Input FormatA single string, .Constraints, where is the length of string . is composed of either lowercase .. 더보기 Day 15: Linked List A Node class is provided for you in the editor. A Node object has an integer data field, , and a Node instance pointer, , pointing to another node (i.e.: the next node in a list).A Node insert function is also declared in your editor. It has two parameters: a pointer, , pointing to the first node of a linked list, and an integer value that must be added to the end of the list as a new Node objec.. 더보기 Day 14: Scope The absolute difference between two integers, and , is written as . The maximum absolute differencebetween two integers in a set of positive integers, , is the largest absolute difference between any two integers in .The Difference class is started for you in the editor. It has a private integer array () for storing non-negative integers, and a public integer () for storing the maximum absolute .. 더보기 Day 13: Abstract Classes Task Given a Book class and a Solution class, write a MyBook class that does the following:Inherits from BookHas a parameterized constructor taking these parameters:string string int Implements the Book class' abstract display() method so it prints these lines:, a space, and then the current instance's ., a space, and then the current instance's ., a space, and then the current instance's .Note:.. 더보기 Day 11: 2D Arrays Context Given a 2D Array, :1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 We define an hourglass in to be a subset of values with indices falling in this pattern in 's graphical representation:a b c d e f g There are hourglasses in , and an hourglass sum is the sum of an hourglass' values.Task Calculate the hourglass sum for every hourglass in , then print the maximum ho.. 더보기 Day 10: Binary Numbers Task Given a base- integer, , convert it to binary (base-). Then find and print the base- integer denoting the maximum number of consecutive 's in 's binary representation.Input FormatA single integer, .ConstraintsOutput FormatPrint a single base- integer denoting the maximum number of consecutive 's in the binary representation of .Sample Input 15 Sample Output 11 Sample Input 213 Sample Output.. 더보기 Day 9: Recursion Recursive Method for Calculating Factorial Task Write a factorial function that takes a positive integer, as a parameter and prints the result of ( factorial).Note: If you fail to use recursion or fail to name your recursive function factorial or Factorial, you will get a score of .Input FormatA single integer, (the argument to pass to factorial).ConstraintsYour submission must contain a recursi.. 더보기 Day 8: Dictionaries and Maps Task Given names and phone numbers, assemble a phone book that maps friends' names to their respective phone numbers. You will then be given an unknown number of names to query your phone book for. For each queried, print the associated entry from your phone book on a new line in the form name=phoneNumber; if an entry for is not found, print Not found instead.Note: Your phone book should be a Di.. 더보기 이전 1 2 3 다음