Tech Architect interview questions – page 3

You are given n ropes,maybe of different length. the cost of tying two ropes is the sum of their lengths.Find a way to tie these ropes together so that the cost is minimum.

Given a binary matrix, find out the maximum size rectangular sub-matrix with all 1

Let's say you have a phrase without any spaces - eg. "thisisawesome". Given a dictionary, how would you add spaces in this string?

Find all combinations of telephone#

Given an expression remove the unnecessary brackets in it with out creating an ambiguity in its execution.

Given a NXN array, rotate the array 90 degrees counter-clockwise in place.

Write a program to check graph is bipartite or not , what will be the time complexity.

Give a sorted array of huge size. The array cannot fit in memory. How would you do binary search in such a array?

In a X's and 0's game (i.e. TIC TAC TOE) if you write a program for this give a fast way to generate the moves by the computer. I mean this should be the fastest way possible. T

Given an unsorted array of numbers, Find a set of all the pythagorean triplets. e.g. Input array: [12,3,5,8,9,15,17,13] output set: {(3,4,5), (5,12,13), (8,15,17)} Try to minimize time complexity to O(n) if possible.

Differences between class and structure?

We have a file containing all product IDs. Write a code to retrieve all the Unique IDs that start with 'b' and doesn't have any special characters in it.

How can we associate a single codebehind file with two aspx pages.eg. We have two files First.aspx and Second.aspx and we have cs files codebehind.cs in which we want to write code for both files. Then how we will execute this cs file for both of the aspx

Given an array A of positive integers. Convert it to a sorted array with minimum cost. The only valid operation are: 1) Decrement with cost = 1 2) Delete an element completely from the array with cost = value of element

You have given a dictionary and a string, you need to separate words that are in dictionary. ex - catsanddog (here cat and cats both can be in dictionary) output - cat,cats,sand,dog

Let A be a real valued matrix of order n*n already stored in memory. Its (i, j)-th element is denoted by a[i, j]. The elements of the matrix A satisfy the following property:

U know the max number and min number is always zero.. u will be given pairs.. u need to see whether they have any gaps.. ex1: max no:20 pairs: 11-15, 0-5, 18-20, 14-19, 6-13

Given a word,convert it into a pallindrome with minimum addition of letters to it.letters can be added anywhere in the word.for eg if amazon is given result shud be amazonnozama .give a optimize soln

Explain merge sort and quick sort, and compare them.

You have 'n' players who have played against each other and for each player you have 2 sets Win = { } Loose = { } which tells you what all players has a given player lost/won against.

3.Given two arrays with one array containing m elements sorted and another array of size m+n containing n elements sorted at beginning where the last m positions are empty, write code to merge these two sorted arrays efficiently so that u have the...

How do you apply Binary Search on 2D array supposed you have 2D array with integers sorted both horizontally and vertically. If you find any occurrence of the value you are looking for you return true else false. What is the complexity?For example the 2D

Given a binary tree, write a program to find the cousin nodes of the given node.

A rectangle is defined by two pts i.e, top left and bottom right . write a function that accepts four pts defining two rectangles and return whether they are intersecting or not!!!

Write a function that would have as input a string,and list of characters to be deleted from the string. Write Test Cases.

What is the BEST-WORST case time to add and remove elements from a queue that has been implemented with the help of 2 stacks.

Write a func that will return second min weighted path between two nodes.(in linear time) Edge<list> find_sec( Node *n1, Node *n2, Edge<list> E2)

Twenty seven identical white cubes are assembled into a single cube, the outside of which is painted black. The cube is then disassembled and the smaller cubes are thoroughly shuffled in a bag.

Implement the Color filling of MS-paint (when u click on an image.. all the pixels connected with the same color are filled with the choosen color). Given a matrix nXn having values of a color at each element.. try to implement the color filling w...

Given a new input string, how would you search a suffix array to find the longest match in the stored text? How would you build a GUI interface for this task?