vips
BAN USERDLL is the collection of routines are packaged into one file and can be loaded into memory when requeested by the program.
more info en.wikipedia.org/wiki/.dll
on the other hand .net framwork is THE BIG stack ! Mainly it is software framework on which you can code your program (in different languages supported by it)
//en.wikipedia.org/wiki/.NET_Framework
Well this can be solved in,O(n) time,
Here is my solution,
Traverse the array, and maintain a linked list of size three ,that stores the three largest elements this takes O(n) time.
Now again traverse the array and find the two minimum numbers O(n) time
Now multiply the elements of linkedlist store it as max sum , and compare it with product of two -ve numbers and every element of the maintained linked list
return the highest product...
This works in O(n)
Well this can be solved in,O(n) time,
Here is my solution,
Traverse the array, and maintain a linked list of size three ,that stores the three largest elements this takes O(n) time.
Now again traverse the array and find the two minimum numbers O(n) time
Now multiply the elements of linkedlist store it as max sum , and compare it with product of two -ve numbers and every element of the maintained linked list
return the highest product...
This works in O(n)
you can use the "Levenshtein distance" or "fuzzy string searching" or "Knuth–Morris–Pratt algorithm" to do that. Designing such system is complex task.
below is simple algo that I thought it will work.
1> capture a string while user is typing
2> for each such a string apply above algorithm
3> show the results to user and goto step 1
. Take fast and slow pointers.
- vips January 29, 2017. Find the middle of the linked list. O(n)
/// say Midj
. Then reverse first part of the linked list O(n)
/// say Revj
. Then just compare one by one Midj and Revj. if not matched, just bell out.