Welcome to OStack Knowledge Sharing Community for programmer and developer-Open, Learning and Share
Welcome To Ask or Share your Answers For Others

Categories

Recent questions tagged Algorithm

0 votes
628 views
1 answer
    Given an array, you have to find the max possible two equal sum, you can exclude elements. i.e 1,2,3, ... sum cannot be greater than 1000. See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
692 views
1 answer
    Is radix sort capable of sorting float data for example 0.5, 0.9, 1.02, etc.? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
716 views
1 answer
    Can Breadth first Search be used for finding topological sorting of vertices and strongly connected components in a ... .reverse() return stack See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
553 views
1 answer
    Here's the problem: I have a number of binary images composed by traces of different thickness. Below there are two ... longer than it is wide. See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
707 views
1 answer
    I'd like to know what the worst-case runtime complexity of a switch statement is, assuming you have n cases. I ... Java C/C++ C# PHP Javascript See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
579 views
1 answer
    From Codechef: A string is considered balanced if and only if all the characters occur in it equal number of ... dynamic programming to it ? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
627 views
1 answer
    I have a problem related to the subset sum problem and am wondering if the differences make it easier, i.e. ... speed it up past that. See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
663 views
1 answer
    Say S = 5 and N = 3 the solutions would look like - <0,0,5> <0,1,4> <0,2,3> <0,3,2> < ... add up to S. Any other dynamic programming solution? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
669 views
1 answer
    I know the title seems kind of ambiguous and for this reason I've attached an image which will be helpful to ... me know your thoughts. Thanks. See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
700 views
1 answer
    The N-Queens Problem: This problem states that given a chess board of size N by N, find the different ... improvement in my algorithm/program See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
710 views
1 answer
    How can I write a function which will return pi (π) to a given number of decimal places? Speed is not a concern. ... to get the nth digit of pi. See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
779 views
1 answer
    I am having problems implementing the function described here here. This is my Java implementation: private static ... am doing wrong? Thanks See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
512 views
1 answer
    What is the point of the one-comparison-per-iteration binary search? And can you explain how it works? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
747 views
1 answer
    So I was thinking, how do you convert a decimal fraction into a hexadecimal fraction? What are some methods for ... and are there short cuts? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
481 views
1 answer
    It's well-known that the worst-case runtime for heapsort is &Omega;(n lg n), but I'm having trouble ... the best-case behavior of heapsort? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
792 views
1 answer
    I have a set of integers M and a target sum k. I want to find the subset of M that when added together ... would be interesting to me as well. See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
640 views
1 answer
    So I have about 16,000 75-dimensional data points, and for each point I want to find its k nearest ... solve this exactly in reasonable time? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
929 views
1 answer
    I'm about to write a function which, would return me a shortest period of group of letters which would ... of characters creating input word. See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
609 views
1 answer
    I'm checking if two strings a and b are permutations of each other, and I'm wondering what the ideal way to ... I expect to be most common? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
714 views
1 answer
    EDIT: as everyone is getting confused, I want to simplify my question. I have two ordered lists. Now, I ... similarity between these two lists. See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
804 views
1 answer
    I'm developing tic-tac-toe game, and I need algorithm to check when game ends(and who win). In 3x3 game I ... is a lot of possible win patterns. See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
854 views
1 answer
    Given an unsorted set of integers in the form of array, find all possible subsets whose sum is greater than or ... solve it in polynomial time? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
760 views
1 answer
    I am trying to do an alpha blend operation of an RGBA image (foreground image), on to a RGB image (background ... there another way to do this? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
580 views
1 answer
    Every programmer is taught that binary search is a good, fast way to search an ordered list of data. There are ... used in real-life programs? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
586 views
1 answer
    I have a lot of compound strings that are a combination of two or three English words. e.g. "Spicejet" ... words from such compound strings. See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
711 views
1 answer
    I am playing with computer graphics programming for the first time. I want to convert RGB (24-bit) images to ... this in the first place :) See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
614 views
1 answer
    If we have n steps and we can go up 1 or 2 steps at a time, there is a Fibonacci relation between the ... be the base-case is that correct? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
641 views
1 answer
    The dynamic programming algorithm to optimally fill a knapsack works well in the case of one knapsack. But is there ... fully included or not). See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
Ask a question:
Welcome to OStack Knowledge Sharing Community for programmer and developer-Open, Learning and Share
Click Here to Ask a Question

...