reddit
Truth about Booking.com
Jobs
xml.booking
Reviews
Syte Analytics
The Company
Room Key threat to Expedia and Priceline
What does KISS stand for?
How DNS Works
Disaster Recovery for SQL Server Databases
Setting Up Replication Servers
Data Mirroring Vs. Log Shipping Vs. Replication
Introduction to Database Indexes
Database index
How does database indexing work?
Interview Questions: Database Indexes
Interview Questions by Jesse Farmer
The Danger of Na�vet�
Database Transaction
what is �stringification� in Perl
OOP Perl
Normailisation in a Relational Database
Grep and Map in Perl
 
Booking.com Interview Question Software Engineer
count the character and create a histogram


Booking.com Interview Question Software Engineer
You have the file with word at a single line.
#input sample file
abactor
abaculus
abacus
Abadite
.
.
Zyrenian
#Output
******************************************************************a
*************b
**********************************c
**********************d
*******************************************************************************e
a) you have to count the character and create a histogram in alphabetical order.
b) now you have to produce a histogram with max 80 character in line in reference to max count
c) now same out based histrogram based on the character count
- madeinindia on March 24, 2014 in neitherland for perl backe

----------------------------------------------------------------------
Algorithm:
Read file lines
Initialise character_hash
Accept only ENGLISH LATIN CHARATERS
Buillt character_hash
Find_Maximum_occurence (if bigger than 80 normlise maximum)
Print hystogram
http://eftpos-test.telekomcloud.hr/cgi-bin/mercur_histogram.cgi
===============================================
"A Multiset is a set where repetitions are allowed (ex: MS1 = (1,1,2,2,2,3,3,4,4,4,4,4,5,7,7,9...).
Problem: write a program that receives two Multisets and returns intersections (element 2 appears three times on MS1 and five times on MS2 then intersection should contain the element three times."
@ms1 = [1,1,2,2,2,3,3,4,4,4,4,4,5,7,7,9];
@ms2 = [2,3,3,3];
Algorithm:
1. built 2 hashes ms1 and ms2
2. loop through each key and print difference =abs(ms1{key} - ms1{key});