You have datastructure my $users = [ { name => 'John', score => 10, }, { name => 'Bob', score => 1, }, { name => 'Carlos', score => 5 }, { name => 'Alice', score => 5, }, { name => 'Donald', score => 7 } ]; now u have to arrange the name with highest to lower score, if score is same than in alphabetical order #expected output: # John # Donald # Alice # Carlos # Bob
Determine if an array from 1..n has a duplicate in constant time and space.
Find number of ones in an integer.
Write a function(int[]) -> int that returns the lowest unassigned integer. For example [] -> 1 (empty set), [1] -> 2, [5, 3, 1] -> 2. Basically just sort the array, iterate, and compare current and previous. If there is a gap then that's your number.
Verify that a binary search tree is indeed a binary search tree.
Write a program to print * * * * * * * * * * * * * * * * * * * * * * * * * * * * * with minimum number of variable use
If you have an unsorted array of numbers from 1-100, except 1 of those numbers is missing, how do you determine which number is missing
Print a binary tree by vertical level order like 1 2 4 3 5 print : 3 2 1 5 4
Given a string find the first non-repeated character.
Viewing 101 - 110 interview questions