Tons of programming questions, including OOP, geodatabase, ArcSDE, etc. Questions can be very specific to make sure you know every single details which might be involved in the workflow. I didn't pass the first round since I don't have 7 years of programming experience plus GIS experience. My friend also got interviewed half a year ago for the same position, didn't pass the first round either. I think they are literally looking for an unicorn.

Phone interview scheduled via email. Hands down, this was the worst interview I have ever had in my life. - They changed the person who was going to interview. The new person didn't chose to explain why he was taking the interview and not the other person. When I asked he was not happy. - There was no formal customary introduction. I have 18 years of experience developing both enterprise and consumer applications. I am not a high school graduate asking for handouts. - The interviewer gave me a notepad on the internet and asked me to write code. When I asked him a few clarifying questions, he was not happy. He breathed heavily during the entire interview, every few minutes. - In the interview they asked me to write code for 4 questions. Before we started I was told that we had less than an hour interview. This was the entire interview. There was no opportunity to ask any questions in the end. Here is my challenge for Inrix. Select your best engineer. He gets 10 minutes to write code for the question below. Leetcode has marked this question as Easy. You don't have to worry about the Big O for time or for space ( this consideration was not given to me). But no oohs and aahs allowed after 10 minutes. The code needs to run and produce the correct result in all cases ( edge cases included ). Also the code must be written on a notepad ( preferably web based ). No IDEs allowed. Your time starts now: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. Example: Input: 1->2->4, 1->3->4 Output: 1->1->2->3->4->4 /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */