apply for the position.
Regards,
Abhijeet Srivastava
0987114705
On Sat, Jun 6, 2015 at 12:40 PM, ~*~VICKY~*~ venkat.jun...@gmail.com
wrote:
Hi,
Only to folks in Bangalore
My team is expanding and is looking for strong devs with deep
understanding of basics and problem solving skills
the challenge of redesigning and
optimizing the cloud computing world, send me your resumes (preferably one
page resume) to give a shot at this great opportunity.
PS : No freshers please, Minimum experience of 2 years preferably.
--
Cheers,
Vicky
--
You received this message because you
about the team
http://www.microsoft.com/about/technicalrecognition/Autopilot.aspx
http://www.theregister.co.uk/2014/02/07/microsoft_autopilot_feature/
--
Cheers,
Vicky
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe from
Missed to add, preferably 1 year+ experience.
On Sat, Jan 31, 2015 at 3:26 PM, ~*~VICKY~*~ venkat.jun...@gmail.com
wrote:
Hi folks,
My team is expanding and looking for strong devs with deep understanding
of basics. If you think you can take up the challenge of redesigning and
optimizing
* - * status*
*
*
reesd re*.d - match
re*eed reeed - match
can some one help with this ?
--
--
--
--
--
--
--
Cheers,
Vicky
--
Hi guys pls share the quest you know that was asked in facebook phone
interview. Thank you.
--
Cheers,
Vicky
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe
of times, e.g. with DOM. But they still have to describe it.
--
Cheers,
Vicky
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email
Hey I just gave an idea, I believe solve it yourself :) I appreciate your
effort.
On Tue, Aug 14, 2012 at 4:34 PM, Kailash Bagaria kbkailashbaga...@gmail.com
wrote:
@vicky
your approach doesn't work for (x1,y1) = (1,2)
(x2,y2) = (2,3)
By your
Its something which is good to have discussion with the interviewer rather
than making any assumption. :)
On Mon, Aug 13, 2012 at 6:07 PM, Srividhya Sampath
srisam261...@gmail.comwrote:
@vicky
Got it . thanks ..is it possible to ignore the preprocessing time when
calculating time complexity
Always share code using ideone like sites or discuss the algo approach.
Attaching code isn't the best idea is my personal feeling.
Regards,
Vicky
On Sun, Aug 12, 2012 at 12:44 AM, Ankit Singh ask9092516...@gmail.comwrote:
if i am correctly understand the problem den i hv attchd the solution
] - sumArray[x1][y1] + ip[x1][y1]
For our case it will be Ans = 18-0+0 = 18
Please lemme know if any bugs with the logic.
On Sun, Aug 12, 2012 at 6:27 PM, Srividhya Sampath
srisam261...@gmail.comwrote:
@ Vicky
Can yo explain with an illustration ?
On Sat, Aug 11, 2012 at 10:07 PM, ~*~VICKY
@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Cheers,
Vicky
--
You received this message because you are subscribed to the Google Groups
][j] = sum[i-1][j-1] + (sum[i-1][j] - sum[i-1][j-1]) + (sum[i][j-1] -
sum[i-1][j-1])+ip[i][j]
[smaller rect] [that row sum value][that col
sum value]
On Sun, Aug 12, 2012 at 8:54 PM, Srividhya Sampath
srisam261...@gmail.comwrote:
@vicky
can yo explain the logic
@Arun: This approach is constant time once the array is build for any
queries that follows. :) You know sum for all possible rectangles in the
given 2d array thats makes it better than computing sum for each input.
Hope it makes sense
On Sun, Aug 12, 2012 at 9:07 PM, ~*~VICKY~*~ venkat.jun
.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Cheers,
Vicky
--
You received this message
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Cheers,
Vicky
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe
.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Cheers,
Vicky
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group
#includeiostream
using namespace std;
class Abc
{
public :
int i;
Abc(){ i = 0;}
};
int main()
{ Abc a = new Abc();
couta.i;
}
--
Cheers,
Vicky
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
Its level order traversal but its O(n^2) u search entire tree to check
if the nodes level is i (say 0= i = height). i guess can use stack
or queue to get O(n) complexity
On Nov 19, 2:58 pm, shady sinv...@gmail.com wrote:
this doesn't seem like level order printing, because you are simply
I guess it could be.
b) position independent code
Keeping relative addressing facilates address independent code as its
always relative. correct me if am wrong.!
On Nov 18, 4:07 pm, Vijay Khandar vijaykhand...@gmail.com wrote:
Relative mode of addressing is most relevant to writing
False not necessarily.
On Nov 17, 4:03 pm, Vijay Khandar vijaykhand...@gmail.com wrote:
Can anyone explain following sentence- True or False and explain
All instructions affect the flags
Vijay Khandar...
--
You received this message because you are subscribed to the Google
clause is executed.
--
Shuaib
http://twitter.com/ShuaibKhan
http://www.bytehood.com/
On 03-Oct-2011, at 4:47 PM, ~*~VICKY~*~ venkat.jun...@gmail.com wrote:
#includestdio.h
#define chk(cond) if(!(cond))\
fprintf(stderr,chk failed: %s,file %s, line %d \n, #cond,\
__FILE__,__LINE__),abort
Design a logic to implement doubly linked list with only one pointer
--
Cheers,
Vicky
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send
@rahul : can u give any related links plz
On Sun, Oct 2, 2011 at 11:33 PM, rahul sharma rahul23111...@gmail.comwrote:
xor linked list.
On Sun, Oct 2, 2011 at 11:32 PM, ~*~VICKY~*~ venkat.jun...@gmail.comwrote:
Design a logic to implement doubly linked list with only one pointer
, ~*~VICKY~*~ venkat.jun...@gmail.comwrote:
@rahul : can u give any related links plz
On Sun, Oct 2, 2011 at 11:33 PM, rahul sharma
rahul23111...@gmail.comwrote:
xor linked list.
On Sun, Oct 2, 2011 at 11:32 PM, ~*~VICKY~*~
venkat.jun...@gmail.comwrote:
Design a logic to implement
Find the difference of two numbers without using '-' operator !
plz share ur solutions!
--
Cheers,
Vicky
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from
Tricky question with more tricky answers. thank you all.
On Mon, Sep 26, 2011 at 9:55 PM, Kunal Yadav kunalyada...@gmail.com wrote:
difference = x+ ~y +1
On Mon, Sep 26, 2011 at 7:33 PM, ~*~VICKY~*~ venkat.jun...@gmail.comwrote:
Find the difference of two numbers without using '-' operator
Given a string which oly has 0's and 1's . Find the maximum largest
substring which have equal no of 0's and 1's and give the length of the
substring .
whether it can be solved in DP ?? or any other soln ?
for example :
given string : 001101000
output :0101
--
You received this message
Given a string which has repeating pattern .Find the repeating pattern and
the length of the pattern .
Example:
123123123123123
output :
123
lenth is 3
1122222211
output :
112211
lenght is 6
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
Given 2 trees .Find wether second tree is the subtree of the first tree .
here is my soln corect me if i m wrong:
bool find(struct node * tree,struct node *subtree)
{
if(tree==NULL )
return ;
if(tree-data==subtree-datafind(tree-left,subtree-left)
find(tree-right,subtree-right)
Any one know how the global scholar written round will be ? whether they
concentrate on OOPs language lik C++ Java or c aptitudes itself enough ? how
wil be the next techinical rounds ?
Thanks in adcance :)
--
You received this message because you are subscribed to the Google Groups
Algorithm
i am join this group
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options,
, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Cheers,
Vicky
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send
Hi all, as i find it hard to find a site that has a collection of non
obvious or fairly hard c aps sites anywhere, i seek help here. plz post if
u find any source proving to be useful.
--
Cheers,
Vicky
--
You received this message because you are subscribed to the Google Groups
Algorithm
.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Cheers,
Vicky
--
You received this message because
Given a linked list with a n*n matrix elements write an algo to
compute product of two such linked list.
say n = 3then
1 2 3
4 5 6
7 8 9
will be given as 1-2-3-4-5-6-7-8-9
now given two matrices , given a algo to perform matrix
multiplication giving result in thrid linked list.
--
You
doing xor of all elements in array[][] should work. you start from a[0]
[0] to a[0][n] then a[1][0] .. when the xor value bcomz 0 then the
corresponding value in arr[i][j] is the first repeated element in the
array. though this code will have two loops and seem as O(n2) it will
terminate once it
group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Cheers,
Vicky
--
You received
I m adding my program too, with some 2-3 added features:
#include stdio.h
#include stdlib.h
#include string.h
#includeconio.h
#includeiostream
#include stack
#include algorithm
#include queue
using namespace std;
// BST-node layout
typedef struct Tree{
int data;
Tree *left;
Tree
It took me more time to understand this problem then solving after i
understood.
You guys too have a look @ it.::
Let f(k) = y where k is the y-th number in the increasing sequence of
non-negative
integers with the same number of ones in its binary representation as
y, e.g. f(0) =
ques-Given a list of N coins, their values (V1, V2, ... , VN), and
the total sum S. Find the minimum number of coins the sum of which is
S (we can use as many coins of one type as we want), or report that
it's not possible to select coins in such a way that they sum up to
S.
ex:
S=11
coins: 1,3,5
given a graph G(V,E) and a source vertex, v. no. of vetices n, and
edges e. you have to find all different paths from vertex v to some
vertex N, having exactly i(1in) edges. v,N,i will be given by the
user. provide an algorithm for it.
--
You received this message because you are subscribed to
Given a file with a lot of words (10 million) find out the top 10%
most
frequently occuring words.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group,
i didn't get anything plz elaborate
On Oct 10, 10:44 am, Prunthaban Kanthakumar pruntha...@gmail.com
wrote:
Sterling numbers of second kind.
On Sat, Oct 10, 2009 at 10:41 AM, vicky mehta...@gmail.com wrote:
example:
n=10,k=10
ans:1
n=30,k=7
ans:
475020
On Oct 10, 9:51 am
find some of all the digits in number-100!
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send
u have to color n similar balls with k diff. colors , such that every
color must be used atleast once find the no. of ways
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
example:
n=10,k=10
ans:1
n=30,k=7
ans:
475020
On Oct 10, 9:51 am, vicky mehta...@gmail.com wrote:
u have to color n similar balls with k diff. colors , such that every
color must be used atleast once find the no. of ways
--~--~-~--~~~---~--~~
You received
ok i can tell one with complexity of O(log(n)) , u take a no. pow =
3,temp=3;
then
while(1){
temp=pow;
pow*=pow;
if(pown){
pow=pow/temp;
break;
}
}
now do , pow =pow *3; untill pow=n;
and check from here
am i clear?
On Sep 23, 2:40 am, Dave dave_and_da...@juno.com wrote:
He didn't
yaa , that's right as then we are sure of having complexity O(n)
On Sep 23, 4:39 pm, Dufus rahul.dev.si...@gmail.com wrote:
Vicky, Yup! you got it there.
BTW you might like to do binary search again instead of sequential
search when you hit the break condition.
to indeed make it O(logn
@ Minjie Zha ,
hey, how does these things clicks to u , as i thought it for 2 hrs.
and still couldn't find a completely correct sol..
On Sep 19, 2:04 pm, Minjie Zha diego...@gmail.com wrote:
Oh yes, I made a mistake.
Your are right.
On Sep 18, 12:02 am, ashish gupta ashish12.it...@gmail.com
50 matches
Mail list logo
