1st round HR: basic behavioral questions 2nd tech screen: data structures and an algorithm question that most people should have learned in their algorithms class 3rd tech screen: a simpler algorithm design question, then a really weird data structure question.
Concate two strings in such a way that 1st letter of 1st string should b placed together and 2nd to 2nd and so on until you reach null
Write an algorithm to calculate the total number of paths possible from point (0, 0) to point (m, n) in an m by n grid. (You cannot retrace a line you already made when forming a path.)
Given an array of (unsorted) integers, arrange them such that a < b > c < d > e... etc.
Interviewer asked me about the ICMA code of ethics.
Find the integer pairs in an integer array, so that they sum up to a specific number n.
how would you find the shortest path between two nodes in a social network?
Given two arrays, find if the integers in array 2 are a subset of the integers in array 1.
Given an array of randomly arranged lower case letters, uppercase letters, and numbers, sort the array such that all lower case letters come before all uppercase letters, come before all numbers. The classes of characters do not need to be in order in their respective sections.
I was asked two questions. Q 1. You are given two version numbers of a software, like Version 10.3.4 and Version 10.3.41. Write a program to find out which of the version numbers are the latest. If version 1 is latest output -1, if version number 2 is latest output +1 else output 0 if same version. Both the version numbers are taken as string. He also asks to make the program of minimum time complexity as we can. At the end he also asked the difference between an iterative program and one with recurrence and their advantages and disadvantages. Q 2. Given two files with a list of application IDs (or some kind of data) stored in them , write a program to compare the data in the two files and output all the common data found in each. What data structure would you use and why ? Give a minimum time and space complexity algorithm. Why did you choose the particular data Structure or algorithm ?
Viewing 51 - 60 interview questions