dj@coder
BAN USER
Employee at None
Comments (5)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
From file create a map<word, index> which is backed by hashing, BST etc and original word sequences, typically by an array. Now given word index if found if exists then from original word sequences expected output can be obtained.
Assumed memory is fit for all words, if not then it may need external indexing etc.
Comment hidden because of low score. Click to expand.
0
of 0 vote
I have confusion "express it as the sum of at least two consecutive positive integers" with phrase "at least two". Assuming the word "all".
Can we think of something AP series, S = n/2(2a+(n-1)) where S and "a" is known. Now we need to find whether a validation solution of "n" is exists for a given "a". Now how we will select the value of "a" to get optimum solution?
what you think guys?
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
your problem statement is quite lengthy. you could explain precisely. BTW this a classic example of backtracking. you can solve it using BFS or DFS.
- dj@coder May 24, 2020