"Solve a maze", you have a 2D matrix with 1's as blocked and 0's as path. Find a path from one corner to another, backtracking should be allowed.
Development Engineer Interview Questions
37,098 development engineer interview questions shared by candidates
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 ?
Coding Challenge 1) Find the longest palindromic substring from the given string. No need of DP solution.
To return the 'm' smallest numbers from a file of 'n' numbers
Vertically and horizontally center an element on the screen using css.
get the second most highest integer from an array
Implement a stack using two queues.
Given an array of sorted integers where duplicates are allowed, find the index of the first number I give you?
Using Collabedit, write a program to find the index of the first non-repeated character in a java string.
The first coding question was to determine whether a list of integers with size N, contains all the numbers from one to N.
Viewing 41 - 50 interview questions