Vir Pratap Uttam
BAN USER VIR PRATAP UTTAM(8+ yrs)
virprataputtam@hotmail.com
CERTIFICATIONS
• Java EE 6 Enterprise Architect Certified Master Exam.
• Oracle Certified Expert, Java EE 6 Web Services Developer.
• Oracle Certified Expert, Java EE 6 Java Persistence API Developer.
• OCWCD(Oracle Certified Professional, Java EE 5 Web Component Developer).
• OCJP6 (Oracle Certified Java Programmer).
LANGUAGES AND TECHNOLOGIES
• JDK 1.6,JSP ,Servlet
• Multithreading (volatile, ThreadPool, Reentrant Locks, Concurrent Hashmaps, Semaphores, Cyclic Barrier, Countdownlatches, Executors Framework, Synchronization etc.)
• Data Structures(Lists, Trees, Graphs, Queues, Stacks etc.)(Problem Solving, Time complexity analysis), Algorithm
• Spring 1.2 ,Spring 3(IOC ,AOP ,Security ,Services, MVC, Web, Integration, Batch, JMS), RTDS(HSBC Owned Framework), Struts 1.3 Framework , JSF(Java Server Faces)
• Hibernate 3.1, EJB 3
• Design Patterns (Singleton, Factory, Abstract Factory, Façade, Proxy, Strategy, Visitor etc.)
• Web Services(SOAP, REST, SOA)
• Web Logic Server, Jakarta Tomcat, Web Sphere
• Quality Center 9.2, Maven
• Oracle 10g , MySQL
private static int[][] rotateMatrixBy180Degree(int[][] matrix, int n) {
for (int layer = 0; layer < n / 2; layer++) {
int first = layer;
int last = n - 1 - layer;
for (int i = first; i < last; i++) {
int offset = i - first;
int top = matrix[first][i];
matrix[first][i] = matrix[last][last - offset];
matrix[last][last - offset] = top;
int leftBottom = matrix[last - offset][first];
matrix[last - offset][first] = matrix[i][last];
matrix[i][last] = leftBottom;
}
}
System.out.println("Matrix After Rotating 180 degree:-");
printMatrix(matrix, n);
return matrix;
}
private static int[][] rotateMatrixBy90Degree(int[][] matrix, int n) {
for (int layer = 0; layer < n / 2; layer++) {
int first = layer;
int last = n - 1 - layer;
for (int i = first; i < last; i++) {
int offset = i - first;
int top = matrix[first][i];
matrix[first][i] = matrix[last - offset][first];
matrix[last - offset][first] = matrix[last][last - offset];
matrix[last - offset][last] = matrix[i][last];
matrix[i][last] = top;
}
}
System.out.println("Matrix After Rotating 90 degree:-");
printMatrix(matrix, n);
return matrix;
}
private static int[][] rotateMatrixBy90Degree(int[][] matrix, int n) {
for (int layer = 0; layer < n / 2; layer++) {
int first = layer;
int last = n - 1 - layer;
for (int i = first; i < last; i++) {
int offset = i - first;
int top = matrix[first][i];
matrix[first][i] = matrix[last - offset][first];
matrix[last - offset][first] = matrix[last][last - offset];
matrix[last - offset][last] = matrix[i][last];
matrix[i][last] = top;
}
}
System.out.println("Matrix After Rotating 90 degree:-");
printMatrix(matrix, n);
return matrix;
}
private static int[][] rotateMatrixBy90Degree(int[][] matrix, int n) {
for (int layer = 0; layer < n / 2; layer++) {
int first = layer;
int last = n - 1 - layer;
for (int i = first; i < last; i++) {
int offset = i - first;
int top = matrix[first][i];
matrix[first][i] = matrix[last - offset][first];
matrix[last - offset][first] = matrix[last][last - offset];
matrix[last - offset][last] = matrix[i][last];
matrix[i][last] = top;
}
}
System.out.println("Matrix After Rotating 90 degree:-");
printMatrix(matrix, n);
return matrix;
}
private static int[][] rotateMatrixBy90Degree(int[][] matrix, int n) {
for (int layer = 0; layer < n / 2; layer++) {
int first = layer;
int last = n - 1 - layer;
for (int i = first; i < last; i++) {
int offset = i - first;
int top = matrix[first][i];
matrix[first][i] = matrix[last - offset][first];
matrix[last - offset][first] = matrix[last][last - offset];
matrix[last - offset][last] = matrix[i][last];
matrix[i][last] = top;
}
}
System.out.println("Matrix After Rotating 90 degree:-");
printMatrix(matrix, n);
return matrix;
}
private static int[][] rotateMatrixBy90Degree(int[][] matrix, int n) {
for (int layer = 0; layer < n / 2; layer++) {
int first = layer;
int last = n - 1 - layer;
for (int i = first; i < last; i++) {
int offset = i - first;
int top = matrix[first][i];
matrix[first][i] = matrix[last - offset][first];
matrix[last - offset][first] = matrix[last][last - offset];
matrix[last - offset][last] = matrix[i][last];
matrix[i][last] = top;
}
}
System.out.println("Matrix After Rotating 90 degree:-");
printMatrix(matrix, n);
return matrix;
}
private static int[][] rotateMatrixBy90Degree(int[][] matrix, int n) {
for (int layer = 0; layer < n / 2; layer++) {
int first = layer;
int last = n - 1 - layer;
for (int i = first; i < last; i++) {
int offset = i - first;
int top = matrix[first][i];
matrix[first][i] = matrix[last - offset][first];
matrix[last - offset][first] = matrix[last][last - offset];
matrix[last - offset][last] = matrix[i][last];
matrix[i][last] = top;
}
}
System.out.println("Matrix After Rotating 90 degree:-");
printMatrix(matrix, n);
return matrix;
}
private static int[][] rotateMatrixBy90Degree(int[][] matrix, int n) {
for (int layer = 0; layer < n / 2; layer++) {
int first = layer;
int last = n - 1 - layer;
for (int i = first; i < last; i++) {
int offset = i - first;
int top = matrix[first][i];
matrix[first][i] = matrix[last - offset][first];
matrix[last - offset][first] = matrix[last][last - offset];
matrix[last - offset][last] = matrix[i][last];
matrix[i][last] = top;
}
}
System.out.println("Matrix After Rotating 90 degree:-");
printMatrix(matrix, n);
return matrix;
}
private static int[][] rotateMatrixBy180Degree(int[][] matrix, int n) {
// TODO Auto-generated method stub
for (int layer = 0; layer < n / 2; layer++) {
int first = layer;
int last = n - 1 - layer;
for (int i = first; i < last; i++) {
int offset = i - first;
int top = matrix[first][i];
matrix[first][i] = matrix[last][last - offset];
matrix[last][last - offset] = top;
int leftBottom = matrix[last - offset][first];
matrix[last - offset][first] = matrix[i][last];
matrix[i][last] = leftBottom;
}
}
System.out.println("Matrix After Rotating 180 degree:-");
printMatrix(matrix, n);
return matrix;
}
private static int[][] rotateMatrixBy90Degree(int[][] matrix, int n) {
for (int layer = 0; layer < n / 2; layer++) {
int first = layer;
int last = n - 1 - layer;
for (int i = first; i < last; i++) {
int offset = i - first;
int top = matrix[first][i];
matrix[first][i] = matrix[last - offset][first];
matrix[last - offset][first] = matrix[last][last - offset];
matrix[last - offset][last] = matrix[i][last];
matrix[i][last] = top;
}
}
System.out.println("Matrix After Rotating 90 degree:-");
printMatrix(matrix, n);
return matrix;
}
private static void anagram(String[] str1,String searchString) {
// TODO Auto-generated method stub
for(String s:str1)
{
if(sort(searchString).equals(sort(s)))
{
System.out.println(s);
}
}
}
import java.util.Arrays;
public class BinarySearchTreeImpl {
public static void main(String[] args) {
// TODO Auto-generated method stub
createBinarySearchTree("epic");
}
private static void createBinarySearchTree(String s) {
// TODO Auto-generated method stub
char[] content=s.toCharArray();
Arrays.sort(content);
BinarySearchTreeNode minimalBST=createMinimalBSTree(new String(content),0,s.length()-1);
}
private static BinarySearchTreeNode createMinimalBSTree(String s,
int start, int end) {
// TODO Auto-generated method stub
if(end<start)
return null;
int mid=(start+end)/2;
BinarySearchTreeNode bstNode=new BinarySearchTreeNode(s.charAt(mid));
bstNode.setLeft(createMinimalBSTree(s,start,mid-1));
bstNode.setRight(createMinimalBSTree(s,mid+1,end));
return bstNode;
}
}
private int maxInt()
{
int a=-1;
a=a>>>1;
return a;
}
Language Doesn't matter for Big Companies like Google,Amazon, facebook, yahoo etc. You need to focus on data structures and algorithm.
Best of Luck!
private static void maxHalves(int i, int j) {
int firstValue, secondValue;
int iLength = String.valueOf(i).length();
int jLength = String.valueOf(j).length();
if (iLength - jLength == 1) {
firstValue = i / j;
secondValue = i - firstValue * j;
System.out.println("First Value:- " + firstValue
+ " second Value:- " + secondValue);
} else {
System.out.println("Invalid Input");
}
}
I think it is Assonance. Please correct me if i am wrong.
private static double findSqrt(double number) {
double g1;
double squareRoot = number/2;
do
{
g1=squareRoot;
squareRoot = (g1 + (number/g1))/2;
}
while((g1-squareRoot)!=0);
return squareRoot;
}
package com.algorithm.amazon;
public class RunPairs {
public static void main(String[] args) {
// TODO Auto-generated method stub
runPairs(new int[] { 0, 1, 2, 7, 21, 22, 1098, 1099 });
}
private static void runPairs(int[] arr) {
// TODO Auto-generated method stub
int start = arr[0], end = 0;
int count = 0;
for (int i = 1; i < arr.length; i++) {
if (arr[i - 1] == arr[i] - 1) {
end = arr[i];
count++;
} else {
end = arr[i - 1];
if (count > 0)
System.out.println(start + "-" + end);
else
System.out.println(end);
start = arr[i];
count = 0;
}
}
System.out.println(start + "-" + end);
}
}
package com.algorithm.amazon;
public class SumDigits {
public static void main(String[] args) {
// TODO Auto-generated method stub
String s = "1a3sdf4a5fggt";
char[] arr = s.toCharArray();
int sum = 0;
String localDigit="";
for (int i = 0; i < arr.length; i++) {
if (Character.isDigit(arr[i])) {
localDigit=localDigit+arr[i];
}
else
{
if(localDigit!="")
sum = sum + Integer.parseInt(String.valueOf(localDigit));
localDigit="";
}
}
System.out.println(sum);
}
}
package com.algorithm.amazon;
public class SumDigits {
public static void main(String[] args) {
// TODO Auto-generated method stub
String s = "1a3sdf4a5fggt";
char[] arr = s.toCharArray();
int sum = 0;
String localDigit="";
for (int i = 0; i < arr.length; i++) {
if (Character.isDigit(arr[i])) {
localDigit=localDigit+arr[i];
}
else
{
if(localDigit!="")
sum = sum + Integer.parseInt(String.valueOf(localDigit));
localDigit="";
}
}
System.out.println(sum);
}
}
package com.algorithm.amazon;
import java.util.Arrays;
public class DuplicateNumbers {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] arr = { 1, 2, 2, 2, 2, 4, 3, 2, 5, 6 };
Arrays.sort(arr);
for (int i = 1; i < arr.length; i++) {
if (arr[i] == arr[i - 1]) {
System.out.println(arr[i]);
return;
}
}
}
}
package com.algorithm.yahoo;
import java.util.Arrays;
public class Pmean {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] arr1 = { 20, 30, 10 };
System.out.println("Pmean1 :- " + Pmeans(arr1));
}
private static int Pmeans(int[] arr1) {
// TODO Auto-generated method stub
Arrays.sort(arr1);
int j = 1;
int result = 0;
for (int i : arr1) {
result += i * j;
j++;
}
return result;
}
}
1. Make a suffix tree for all permutation of T such that T$Reverse(T)#
2. Check for all permutation for same node
Line 5 : Cannot make a static reference to the non-static field y
package com.algorithm.amazon;
public class RemoveAdjacentPairs {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] arr = { 1, 1, 2, 3,3, 4, 5 };
removeAdjPairs(arr);
}
private static void removeAdjPairs(int[] arr) {
// TODO Auto-generated method stub
int j = 0,len=arr.length;
for (int i = 1; i < arr.length; i++) {
while(j >= 0 && arr[j] == arr[i] ) {
len--;
i++;
j = j <= 0 ? 0 : j - 1;
}
arr[++j]=arr[i];
}
for (int i = 0; i < len; i++) {
System.out.println(arr[i]);
}
}
}
package com.algorithm.amazon;
import java.util.StringTokenizer;
public class ReverseSentence {
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println(reverseWordsInSentence("I am Don"));
}
private static String reverseWordsInSentence(String string) {
// TODO Auto-generated method stub
StringTokenizer st=new StringTokenizer(string," ");
String revString="";
while(st.hasMoreTokens())
{
revString=st.nextToken()+" "+revString;
}
return revString;
}
}
RepGayle L McDowell, CEO at CareerCup
Gayle Laakmann McDowell is the founder / CEO of CareerCup, which provides programming interview prep for candidates interviewing with Microsoft, Google ...
- Vir Pratap Uttam May 04, 2015