• Posts
Introduction
DSA
• CodeForces
  • 1918-A: Brick Wall
• ICPC
  • 2023
    • Azerbaijani
      • Classify The Roman Numerals
    • Nordic
      • Karl Coder
• LeetCode
  • 2: Add Two numbers
  • 58: Length of Last Word
  • 142: Linked List Cycle II
• Eolymp
  • 87: Robot
  • 325: Dangerous route
  • 4036 & 4038: Pre-Order/Post-Order Traversal of a Tree
  • 6254: Timebomb
• HackerRank
  • Queen's Attack II
  • Winning Lottery Ticket
  • Balanced Brackets
Django
• How to detect field changes in Django
Reinventing the wheel
• Linux command: `ls`
  • Command, file types and flags
  • Starting with C
  • Getting the list of files and their info
  • Processing flags
  • Sorting and formatting the output
Open Source Projects
• Integrify
Misc
• How did I get into programming?
• How I got job in two hours

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

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

Eolymp 325: Dangerous route

Problem statement In one country there are n cities, some of which are connected by two-way routes. Cities are numbered by integers from 1 to n. In times of financial crisis the level of the crime in a state rose and the crime groups are organized. The most dangerous of these was “Timur and his gang” led by a notorious criminal circles by Timur, that commit robberies on most of the roads. As a result, some roads became dangerous to drive.

Wednesday, October 11, 2023 | 6 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