Vivek Grewal
BAN USERVivek Grewal Mailto: vivekgrewal89@yahoo.in
Phone: +917738989576
Date of Birth: 10th Apr’89
CAREER OBJECTIVE
To become member of the core team where I can contribute my technical knowledge and conceptual skills for growth of the organization.
ACADEMIC QUALIFICATIONS
B.E. IT Acropolis Inst. Of Tech., Madhya Pradesh RGPV 70.5% 2011
HSC Science Mount Carmel School, Indore MP Board 82% 2007
SSC General Mount Carmel School, Indore MP Board 82% 2005
TECHNICAL SKILLS
Languages Java/J2EE
DBMS Oracle
Tools SVN, Putty
Frameworks Spring Web Flow, Hibernate
Operating Systems Windows XP, Unix
PROFESSIONAL EXPERIENCE 2 Years
TATA Consultancy Services Ltd. Systems Engineer Mar’12-till present
Career Profile Responsibilities ( for various features worked on )
• Application Development: Developed applications which include interaction with payment gateways, mobile website and mobile applications.
• Performance Management: Database connection management and audit point fixes.
• Client Interaction for requirement analysis and effort estimation
• Client interaction for requirement gathering
• Development in SDLC Water-fall model.
• UAT and Production deployment.
Project Title ICICI PRULIFE WEBSITE DEVELOPMENT(ICICI Prudential) Mar’13-till present
Feature ICICI Pru Digitization
Role Team Member (Developer)
Description Ipru Digitization involves development of new website using technologies like Spring Web Flow and Hibernate with advanced business requirements.
Project Title ICICI PRULIFE WEBSITE ENHANCEMENTS(ICICI Prudential) Jul’12-Mar’13
Feature ICICI Pru Vendor Cons Enhancements
Role Team Member (Developer)
Description ICICI Pru Vendor Cons include change requests raised by the business for the addition of new modules to existing website or change in the existing ones. It also provides support to the existing website.
ACHIEVEMENTS
• Certification of Microsoft Technology Associate(MTA)
• Certification on JAVA and J2EE.
String str = "aazzzeeeefffmtttdd";
for(int i=1;i<str.length()-1;i++)
{
if(str.charAt(i)!=str.charAt(i-1)&&str.charAt(i)!=str.charAt(i+1))
{
System.out.println("Got u : "+str.charAt(i));
break;
}
}
You can put both arrays in 2 different sets and use retainAll method of set that finds the intersection of sets
- Vivek Grewal May 04, 2014String[] inputs={"1 3","1 3","2 4","3 5","3 5","3 5","1 1","1 1","1 1","1 1"};
Set<String> deletedElements=new HashSet<String>();
for(int i=1;i<inputs.length;i++)
{
for(int j=i-1;j>=0;j--)
{
if(inputs[i]!=null&&inputs[i].equals(inputs[j])&&!deletedElements.contains(inputs[j]))
{
for(int k=j;k<inputs.length-1;k++)
{
inputs[k]=inputs[k+1];
if(k+1==inputs.length-1)
inputs[k+1]=null;
}
deletedElements.add(inputs[j]);
}
}
}
public void regenerateBinarySum()
{
// BFS uses Queue data structure
Queue<Node> queue = new LinkedList<Node>();
Queue<Node> queueToClean = new LinkedList<Node>();
queue.add(this.root);
queueToClean.add(root);
if(root.right!=null)
root.data=root.data+this.getBFSSum(root.right);
root.visited = true;
while(!queue.isEmpty()) {
Node node = (Node)queue.remove();
Node child=null;
while((child=getUnvisitedChildNode(node))!=null) {
child.visited=true;
if(child.right!=null)
child.data=child.data+this.getBFSSum(child.right);
queue.add(child);
queueToClean.add(child);
}
}
// Clear visited property of nodes
clearNodes(queueToClean);
}
private int getBFSSum(Node node)
{
// BFS uses Queue data structure
Queue<Node> queue = new LinkedList<Node>();
Queue<Node> queueToClean = new LinkedList<Node>();
queue.add(node);
queueToClean.add(node);
int sum=node.data;
node.visited = true;
while(!queue.isEmpty()) {
Node node1 = (Node)queue.remove();
Node child=null;
while((child=getUnvisitedChildNode(node1))!=null) {
child.visited=true;
sum+=child.data;
queue.add(child);
queueToClean.add(child);
}
}
// Clear visited property of nodes
clearNodes(queueToClean);
return sum;
}
Not possible. However it can be achieved if special queen does not have the power of knight but in that case too M should be greater than 3 i.e M>3
- Vivek Grewal April 20, 2014package com.test.careercup;
import java.util.Random;
public class Test {
public static void main(String[] arg)
{
System.out.println("int : "+rand(7));
}
public static int rand(int maxNum)
{
Random r=new Random();
return r.nextInt(maxNum);
}
}
- Vivek Grewal June 14, 2014