All Questions
2 questions
-3
votes
2
answers
210
views
find the value at kth position when numbers are sorted lexicographically till n [closed]
Ex :-
Input:
n = 12, k = 5
Output:
ans = 2
Sorted list S: ["1", "10", "11", "12", "2", "3", "4", "5", ...., "9"]
ans = 2
2
votes
2
answers
904
views
Fastest C/C++ comparison function for an opaque field containing doubles
Description:
Write the fastest comparison function for an opaque field containing a double. Here is my example:
...