Software Development Engineer II Interview Questions

I have written a program using Hashmap and StringBuilder.

An efficient solution to the problem can done using simple pattern matching. A sample solution goes as follows : public class SampleMain { /** * @param args */ public static void main(String[] args) { String charStream = "ABABCBABABABABABATGBHacbfoabcbahasacbJKOPLMNBGDESRABADACAJALAMNBADDHEMSZPQ"; String noise = "ABCPQR"; System.out.println("CharStream : " + charStream + "\n" + "Noise : " + noise + "\n" + "FliteredCharStream : " + func(charStream, noise)); } private static String func(String charStream, String noise) { String regex = "[" + noise.toLowerCase() + noise.toUpperCase() + "]"; Pattern p = Pattern.compile(regex); Matcher m = p.matcher(charStream); return m.replaceAll(""); } }

import java.util.Arrays; public class Solution{ public static void main(String[] args){ System.out.println(remove("as","asasfsg")); } public static String remove(String s1, String s2){ boolean[] flags = new boolean[255]; char[] a1 = s1.toCharArray(); char[] a2 = s2.toCharArray(); String str = ""; Arrays.fill(flags,false); for(int i=0; i=a1.length && i

This was a boring question. I gave a standard approach - doing a OO analysis to find the objects and go for layered model if there are scalability and integration requirements.

Switch on first switch for 5 minutes. light gets heated. After 5 minutes, switch off that light. Now switch on second, switch off third. Once you enter room, you can identify bulb with light is mapped to second switch. if you touch other two bulbs, you can identify the heated bulb is mapped to first switch.

I will add the nearest tourist spot who post their homedown and current city. This is use to know about their taste of thinking. And we will collect the advertisement who do business from that place.

Consider movie, show time, seat availability, ticket price (different for different seat types)

http://stackoverflow.com/questions/4252215/optimizations-for-longest-path-problem-in-cyclic-graph

Finding longest path between two nodes in a graph is an NP Hard problem. So, we should not try to find a polynomial solution to this problem. As you can see the given problem is of very small size. So even brute force is acceptable. Solution: Let there be n cities. GIven starting city as S and destination city as D. We are left with n-2 cities. There are approximately 2^(n-2) * (n-2)! ways for reaching D from S. Find length of all these ways and choose the smallest one.

int minOfTwo (int nb1, int nb2) { return ((!nb1 && !nb2) ? nb1 : ((nb1 leftSubTree), minDepth(nptr->rightSubTree)); }