I had a client realize today that their dealer search by radius function wasn’t working anymore so I dug in to find out why. The cause turns out to be the service we were using to geocode was no longer functioning which is rational since it was sevceral years old and before yahoo or google was offering geocoding. Basically they need the dealers address and latitude and longitude to be added to the database so…
"JQuery – Getting a Latitude & Longitude from address"Author: Aly Chiman
While coding in a hurry, you sometimes use internal API’s either willingly –since you don’t want to spend more time– or unwillingly instead of public equivalents. I am saying don’t use them because they meant to change, as the name implies they are for internal use. Just today, I spent three hours just to replace these kind of codes after upgrading Alfresco to 3.3 from 3.2 for a project I am working on. Those who…
"Don't use internal APIs while integrating 3rd party Libraries"I had some interviews into big companies like Google, Amazon and so on, and there were tasks related to the algorithms. So, Here I’ll describe one of the tasks and publish code for this algorithm. Note, during interview you can chose algorithm by your self and time for implementation (runtime implementation) about 30 mins….. Predefined: There is dictionary of words with unspecified size, we just know that all words in dictionary are sorted (for example by alphabet). Also we have…
"Algorithms: Customization Binary Search"Today we will learn how to solve two problems from leetcode – Linked List Cycle and Linked List Cycle II. So, as you can see these problems are related but first easiest and second more complex. OK, first task description: Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? So, it’s easy if you know Robert W. Floyd algorithm also called “tortoise and the hare” algorithm. Full…
"Linked List Cycle / II Algorithm"Binary Tree Level Order Traversal Today we will work on the tree traversal task – Binary Tree Level Order Traversal II. We can see that task is pointed as second (II) it means not simple/classic level order traversal, so, let’s read task description: Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root). For example: Given binary tree {3,9,20,#,#,15,7},…
"Algorithm {Binary Tree Level Order Traversal II}"
