Easy

Eolymp 6254: Timebomb

Problem statement You and your teammates from the anti-bomb squad of the local police have been called to defuse a bomb found in the only pub in town. Fearing the tragic consequences this might produce, you go to the scene as quickly as possible. After some research, you learn that the bad guys have created a tricky way to allow them to defuse the bomb at will. You find a remote control with a button that you can take to a safe place. You also find that it is possible to connect to the bomb through a wireless connection and retrieve an ASCII representation of a code every 2 seconds. The bomb then gets defused if the button is pressed when the code is a number divisible by 6. But you have to be careful. If you press the button when the ASCII representation of the code is not a number divisible by 6 or has an invalid representation for any digit, the bomb will explode instead.

Monday, March 18, 2024 | 5 minutes Read

Leetcode 58: Length of Last Word

Problem statement Given a string s consisting of words and spaces, return the length of the last word in the string. A word is a maximal substring consisting of non-space characters only. Example 1 Input: s = "Hello World" Output: 5 Explanation: The last word is "World" with length 5. Example 2 Input: s = " fly me to the moon " Output: 4 Explanation: The last word is "moon" with length 4.

Sunday, February 11, 2024 | 3 minutes Read

Classify The Roman Numerals

This problem is from ICPC competition that one of my followers participated (and asked for explanation) on October 22, 2023. Problem statement Your task is to determine the number of symmetry axis of the given Roman Numeral. The following table from Wikipedia displays how the Roman Numerals are written: Individual decimal places Thousands Hundreds Tens Units 1 M C X I 2 MM CC XX II 3 MMM CCC XXX III 4 CD XL IV 5 D L V 6 DC LX VI 7 DCC LXX VII 8 DCCC LXXX VIII 9 CM XC IX Note that:

Saturday, October 28, 2023 | 8 minutes Read

Eolymp 4036: Pre-Order Traversal of a Tree & 4038: Post-Order Traversal of a Tree

Problem statement These are two identical problems: Eolymp 4036 and 4038. The following problem statement is that of 4038, but explanation covers both problems. Given an array of integers. Create a Binary Search Tree from these numbers. If the inserted value equals to the current node, insert it to the right subtree. Write method PostOrder that makes Post-Order traversal of a tree. In this traversal method the left subtree is visited first, then the right subtree and finally the root node.

Friday, October 13, 2023 | 4 minutes Read

Karl Coder

This problem is from ICPC competition that I participated in on 7th of October, 2023. Problem statement Karl is an aspiring C programmer, and is excited by the risks and rewards of low-level manual memory management. In the program he currently develops, he stores a string containing N non-zero bytes into a buffer named “buf”. By mistake he accidentally made the buffer 2N bytes in size. The last bytes N of the buffer consists of only zero-bytes.

Monday, October 9, 2023 | 5 minutes Read

Eolymp 87: Robot

Problem statement The infinite in both directions stripe with width 1 is divided into blocks of size 1 x 1. In one of these blocks the robot is located. It can move from one cell to another (the robot at the figure is marked with square). Its movements are determined by the program, each instruction is given by one of three capital letters: L, R, S. The instruction L says the robot to move one cell to the left, the instruction R - to move one square right, and S - to stay in the same cell. Program execution means the sequential execution of all instruction in it.

Friday, October 6, 2023 | 3 minutes Read