Correct Parenthesis (Stack)

Problem If parentheses are entered, it outputs “YES” if it is a valid parenthesis, and “NO” if it is not correct. (())() This is the correct placement of the pair of parentheses, but (()())) is not the correct parentheses. input A string of parentheses is entered on the first line The maximum length…

Read More

Easy Ways To Facilitate Gitflow

Introduction The diagram below is the most famous one describing Gitflow. However, it is not easy to understand at a first glance. There are tons of alternative and different ways to apply Gitflow to your project. In this post, introduce the easiest and comprehensible strategy that I use. Develop…

Read More

Find All Anagrams (Hash, Two-Pointer, Sliding Window)

Problem Write a program that counts the number of substrings of S that are anagrams and T strings in S string. When identifying anagrams, case is sensitive. Substrings must be contiguous strings. input The first S string is entered on the first line, and the T string is entered on the second line…

Read More

Anagram (Hash)

Problem Anagrams Two words are said to be anagrams when two strings differ in alphabetical order, but their composition matches. For example, AbaAeCe and baeeACA have different alphabets, but if you look at their composition, they are A(2), a(1), b(1), C(1), e(2), the alphabets and their numbers…

Read More

Class President (Hash)

Problem A, B, C, D, and E candidates registered as candidates to select the class president. The ballot is written with the symbol (alphabetically) of the candidate chosen by the students in the class, and the teacher announces the symbol. After the teacher’s presentation, write a program that…

Read More
Page 8 Of 26