168 questions
There is a starting point and an arriving point. Departing from the starting point, passing all the vertices, arriving at the arrival point DFS solved the problem of finding the shortest path.However,...
https://www.hackerrank.com/challenges/30-linked-list/problemThis is the question above.First, you get the number of nodes, then you get the data value inside the nodeI think it's a matter of final out...
Hello, I'm a new student who started studying algorithms.I'm solving the Baekjun algorithm problem with Python.When there was no input value or one line, I used to test it by floating it on the consol...
I'm a college studentI came to this site by chanceAbout computer theory, including programming languages, from one to tenYou seem to know a lot.Are you a senior developer in your current job?I respect...
Is there anyone in the Java library who has used the graph algorithm? I found JGraph and wrote it. There are a lot of other things on Google. So I'm asking if there's a good library that you can use a...
I'm asking you this question because I want to save time while solving algorithm problems!When numbers are listed in a picture-like rule, is there a formula that allows you to figure out what number a...
You want to create a counter that increments the number. I want to create a counter similar to the current status of election counting. For example, we're going to count the number 15000. It's not tha...
Writing a function that finds the maximum/minimum value of an array is a bit tedious, as follows::/** * * * @param chars * Maximum value in @returnchar array */private static int maxValue(char[] char...
https://programmers.co.kr/tryouts/850/introYou can see the problem if you go to the address here. It's this kind of problem.I'm going to find the biggest pattern that matches this problem from the ver...
We're working on a simple code related to information retrieval.I'm using TF-IDF to make it, but I have a question as I got IDF.When obtaining an IDF, see the article that it is common to add 1 to the...
« | - 15 - | » |
© 2024 OneMinuteCode. All rights reserved.