Given two sorted arrays, A and B, find i,j for which |A[i] - B[j]| is minimum
Subscribe to:
Post Comments (Atom)
Blog Archive
-
▼
2010
(147)
-
▼
December
(27)
- Google's AROUND Operator for Proximity Search
- Joining all lines in a file with comma
- Mysql db count tables
- linux : extracting a line range from a file
- mediawiki useful tables - pass 1
- Find the minimum difference between two arrays
- Longest sequence of d-dimensional boxes fitting in...
- Encoding/decoding a tree
- Location of an element where index is same as the ...
- Locker design interview question
- interview questions
- Interview question
- Some Interview questions
- php echo print difference
- PHP how to get the browser information
- GET POST difference
- BST in PHP
- Web Security issues
- Cross site scripting attack (Google example)
- Some db performance optimizations
- Data Denormalization guidelines
- Interview question
- generating all the possible permutations in action...
- Dijkstra's_algorithm in PHP
- Yahoo Interview Questions
- Binary Search C recursive and iterative
- Flex Interview Questions
-
▼
December
(27)
No comments:
Post a Comment