[algogeeks] Job openings java developer jio gurgaon

[abhi m]

Openings in jio for Java software engineers (3-5 years of development
experience) to work in design and development of microservices based 5g
platforms in Jio. Exciting opportunity to work on cutting edge next gen
technologies Required skills:: Design, develop & test highly scalable,
resilient, testable services/code in Java Work closely with Development
Leads, Architects and product team to ensure the design meets the business
requirements Participate in defining & follow architecture principles and
development standards set by the Architecture practice to deliver high
quality code. Hands-on with REST Services Good working knowledge of
MicroServices Good understanding of Data structures and algorithms Strong
analytical skills A good team player and have strong communication skills.
Desired skills:: Hands on experience with cloud native applications Willing
to work in agile work environment through test driven development,
continuous integration hashtag#java

hashtag#microservices

hashtag#softwareengineers

hashtag#developer

... pls share your profiles to abhishek.mehro...@ril.com

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to algogeeks+unsubscr...@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/algogeeks/CAOtPNKaHq6jhpF2Td4KVDmyY5Ud1_OK6pp4U-KNRfSohkOVyNQ%40mail.gmail.com.

[algogeeks] Boomerang Commerce - Hiring Game Changers

[Abhi Mahajan]

Openings for SDE, SDET, Implementation Lead at Boomerang Commerce.

Boomerang Commerce is a fast growing Enterprise SaaS Company on a mission 
to transform the retail industry through analytics and optimization. Our 
customers are some of the fastest growing IR500 e-commerce and omni-channel 
retailers. 4 of the top 10 retailers rely on us to deliver recommendations 
that enable retailers to proactively compete and boost profits at scale. 
Our SaaS-based, machine learning platform optimizes pricing, inventory, and 
assortment through configurable rules, strategies and advanced algorithms. 
We have grown 4X in last 12 months, have several millions of $s in annual 
revenue and are beefing up the team to get ready for explosive growth next 
year.


Check out this short video (https://www.youtube.com/watch?v=rp-71VspLSs) to 
get an overview about our company.

Please drop me a note or send your resumes to a...@boomerangcommerce.com.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to algogeeks+unsubscr...@googlegroups.com.

[algogeeks] Openings in Boomerang Commerce

[Abhi Mahajan]

Hi 

There are multiple openings (SDE, SDET, UI Developer etc) in Boomerang 
Commerce (http://www.boomerangcommerce.com/careers/). We presented at the 
finale of recently held TechCrunch Disrupt NY 2014 and were among the top 6 
finalists (video: https://www.youtube.com/watch?v=rp-71VspLSs). For company 
profile visit, http://www.boomerangcommerce.com/. 

Folks who are interested to work with us, share your resume to 
a...@boomerangcommerce.com 

Regards
Abhi

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to algogeeks+unsubscr...@googlegroups.com.

[algogeeks] Microsoft online exam pattern

[Abhi]

Can anyone tell me the type of questions asked in Microsoft's online exam, 
their difficulty level and especially the questions related to test cases 
(pls also post some examples) ?

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/TOZP5gPhnnMJ.
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.

[algogeeks] Invert bits

[Abhi]

Write a one line code to invert the last four bits of an integer ?

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/sy3Ff971pRMJ.
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.

[algogeeks] Questions asked in directi

[Abhi]

1st round ( MCQ questions based on aptitiude, DBMS, OS etc)
30 questions were there:-

1) count number of ones in binary representation of 1 to 100
2) ACID (databases)
3) A C program was given with 4 forks().we had to find   number of times it 
prints hello world (answer - 26)
4)2-3 questions related to expectation number
5)bob-alice puzzle and a mario-luigi puzzle
6)divide 40 weight,you can weigh on both sides
7)7 holes in a line and a fox hides either on left/right   
hole(http://www.gurmeet.net/puzzles/fox-in-a-hole/)
8)which statement is wrong: a)ping uses only ICMP b)ARP   belongs to link 
layer c)ftp use port 20 for control
9)You have 4*1  2*1 multiplexers.Design a 32*1 multiplexer   using minimum 
number of given multiplexers
10)which isn't http command (not exact wordings)
   a)CONNECT b)PATCH c)OPTIONS d)DEBUG
11)A triangle is given with longest side =28,one angle= 120 and product of 
other 2 sides = 240.Find sum of 3 sides.
12)You have 1-100 numbers.You take 2 numbers(remove themfrom the 
array),add them,subtract 5 from sum and then   put this number(a1+a2-5) 
back into array.In this way,we are left with 99 numbers.Repeat this 
procedure until weleft with only one element.What would be the last
element left in the array ? a)5050 b)4555 c)4550 d)4545
13)int x;
for(int y=x;y0;y=(x(y-1)))
printf(Hey);
How many times it will print Hey ?
14)Find lowest number divisible by 1..10 and has odd number of divisors ?
15)n=4464
   D(n)=4+4+6+4=18=1+8=9
   How many numbers(1n123456789) are there with D(n)=5 ?
16)one question related to turing test.

Coding Round:-
2 Questions were there in coding round.We were given 90min to solve these 
problems
In First question,We had to implement LRU algorithm.We didn't have to write 
the whole program,but only to write a function.

#include stdio
#include conio.h
int lru(int N, int S, int A[101], int cached_pages[51]);

int main () {

int N, S,T;
int A[1001];
scanf(%d,T);
while(T--){
// N - no of processes  S - size of cache
scanf(%d %d, N, S);
for(int i = 0; i  N; i++)
  scanf(%d, A[i]);

int pages[51];
int n_pages = lru(N, S, A, pages);
for (int i = 0; i  n_pages; i++) {
printf(%d, pages[i]);
if (i != n_pages - 1) printf( );
else printf(\n);
}
}

}


int lru(int N, int S, int A[101], int cached_page[51]) {
   
   // this stub was to be filled by us
 
   return 0;

}

2)Program related to maximum profit in stock market.We were given an array 
containing stock prices on 1st,2nd...nth day and we had to calculate the 
maximum profit.
(seen this problem on careercup.com)

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/arc88O7bCBUJ.
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.

[algogeeks] Re: Traverse a 2-D array of strings

[Abhi]

@atul007, number of rows represent number of tokenized strings.How do i 
know the number of tokenized strings? It depends upon input string and 
delimiter

On Saturday, 14 July 2012 22:45:46 UTC+5:30, Abhi wrote:

 I have written a mystrtok function which takes a string and a delimiter as 
 argument and returns an array of tokenized strings.But i don't know how to 
 traverse that array
 Here is my code:-
 char string[50] = asdf.sdf.sdf.sdf.wer.sfd.df;
 char delim = '.';
 char **result = mystrtok( string , delim);

 for (int i=0; ??? ; i++)  //what to write in condition part  
 printf(%s,result[i]);


-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/exXJLYEOcXwJ.
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.

[algogeeks] Traverse a 2-D array of strings

[Abhi]

I have written a mystrtok function which takes a string and a delimiter as 
argument and returns an array of tokenized strings.But i don't know how to 
traverse that array
Here is my code:-
char string[50] = asdf.sdf.sdf.sdf.wer.sfd.df;
char delim = '.';
char **result = mystrtok( string , delim);

for (int i=0; ??? ; i++)  //what to write in condition part  
printf(%s,result[i]);

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/1rLyQxMylhkJ.
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.

[algogeeks] Finding intersection of 2 linked lists

[Abhi]

Any efficient algorithm to find intersection of two linked lists.Example: 
Linked List 1)  1 - 2 - 3 - 4 - 5 - 6
Linked List 2)  3 - 4 - 5

Intersection 4 - 5 - 6  

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/-8_lnGA-ZhgJ.
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.

Re: [algogeeks] new social network (be the owner of the website)

[abhi mehrotra]

Dude dont be so futuristic join it if u think it may be useful later. i
didnt join it to be a millionaire (i liked the idea and want to go with it
thats all). Also read the link

http://thetechmag.net/zurker-a-new-and-unique-social-network/

abhhishek




On Mon, May 14, 2012 at 7:47 PM, Nikhil Mishra mishra00...@gmail.comwrote:

  Company ain't listed yet. Even it gets, think about Offshore funds :-)

 -Nikhil


 On Mon, May 14, 2012 at 7:20 PM, abhi mehrotra 
 abhishekmehrotra.i...@gmail.com wrote:

 Not at all a spam dude just try googling zurker and read about it.

 regards
 Abhishek



 On Mon, May 14, 2012 at 7:04 PM, Nikhil Mishra mishra00...@gmail.comwrote:


 Definitely a spam ! :-) . Add + 1...


 On Mon, May 14, 2012 at 8:39 AM, abhi mehrotra 
 abhishekmehrotra.i...@gmail.com wrote:

 nope its real social network!!


 On Sun, May 13, 2012 at 11:14 PM, Rahul raikra...@gmail.com wrote:

 spam

 On 5/13/12, abhi mehrotra abhishekmehrotra.i...@gmail.com wrote:
  Guys,
 
  As u all know, Facebook CEO and Founder Mark Zuckerburg stole the
 idea of
  Facebook from twin brothers - Tyler Winklevoss  Cameron Winklevoss
 from
  harvard university in 2001.. later on they filed a complaint Mark
 and got
  65 million dollar in 2007..
 
  In 2009, the twins started a new project and launched the beta
 version in
  dec 2011.. You can join it now and become a share holder of this
 website..
 
  Currently there are thousands of member joining this web site in UK
 alone
  per day, totally free , new features than Facebook and G+ (Yet to
 arrive I
  guess).
 
  Facebook is worth 50 billion today but its users are getting 0% of
 the
  shares.. So this new idea is invoked by the twins is definitely
 amazing..
  Welcome To Zurker - A Chance In A Lifetime! Zurker - How You Can Be
 An
  Owner. Zurker is a new and unique type of social media. It seems to
 be a
  mixture between Facebook and Google + but with a unique selling
 point: it's
  owned by its members! You earn shares in Zurker by referring
 members. You
  get 2 shares for each referral in the first 24 hours of your
 membership and
  one share per referral thereafter. Click Here to Join Zurker!
 
  Since it is beta, you definitely need a n invitation..
 
  http://www.zurker.in/i-152526-xkykcgxtqw
 
 
 
 
  Abhhishek Mehrotra
 
  --
  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.
 
 


 --
 --
 http://about.me/raikrahul

 --
 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.


  --
 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.


  --
 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.


  --
 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.


  --
 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.


-- 
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.

Re: [algogeeks] Coding..........

[Abhi]

@atul: can you please elaborate the algorithm you are using. 

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/mLtfUz77JMIJ.
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.

[algogeeks] Re: Largest substring with unique characters

[Abhi]

No, every character won't be read exactly once.


-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/lU8COVBGWSwJ.
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.

[algogeeks] Adobe Ques

[Abhi]

Given a string, find largest unique substring in string efficiently..


-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/dOfxYROYaXEJ.
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.

Re: [algogeeks] Adobe ques

[Abhi]

@piyush
A small mistake though,but output of your code for 1110 00011000 
0101 00110011 then output shall be 51.65.24.14  ..opposite of what 
should be 

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/vvfMGlrMoPkJ.
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.

[algogeeks] Largest substring with unique characters

[Abhi]

Given a string, find the length of the largest unique substring in it..

Sample Case
Input: abcadece
Output:5  (the string bcade)

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/XkHOLozCtIIJ.
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.

Re: [algogeeks] Largest substring with unique characters

[Abhi]

That is exactly what I was doing. But the complexity of the code would not 
come up to be O(n). It would be O(n^2) in the worst case.

Worst case: String is of the form abcdeabcde ..Start with a..hash upto 
second 'a' encountered. (n/2 elements accessed). Reset hash. start afresh 
from b..hash upto second 'b' encountered.(n/2 elements.) and so on.. Thus in 
first n/2 calls, n/2 elements accessed in each call. O(n/2 + n/2...n/2 
times)= O(n^2/4) = O(n^2)

Correct if I am making any mistake.


regards,
Abhishek Khattri

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/IiCXmJSkWp0J.
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.

Re: [algogeeks] Memory Allocation

[Abhi]

Yes, to a great extent. Thanks :)
Obviously we can pass arrays across functions by declaring them static. Just 
saying.

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/dpYbwj0LyhcJ.
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.

Re: [algogeeks] Re: how this output is obtained ?

[Abhi]

@Devansh:
Nice post..





Regards,
Abhishek Khattri 
 

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/r4Gbsw08bI0J.
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.

[algogeeks] Re: C Doubts

[Abhi]

Perhaps the only way to alter the value of a variable declared constant in C 
is through passing its address to a function and changing the value 
henceforth though it generates a warning of 'discarding the qualifiers'.

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/SbHlNcA7Fj8J.
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.

[algogeeks] C Doubts

[Abhi]

1.When I declare a variable as const then any subsequent assignment of it 
gives an error assignment of read only variable. Is a const variable 
treated as a read only variable?


2.

#includestdio.h
struct s1 {
  char a;
 };

char s2 {
 char b;
 int c;
   };

printf(%d,sizeof(struct s1));  // output : 1
printf(%d,sizeof(struct s2));  // output : 8

please explain..



-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/nOK4AkuAgW8J.
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.

Re: [algogeeks] C Doubts

[Abhi]

That was really helpful.

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/KvxrTcPf104J.
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.

[algogeeks] Re: C OUTPUT HELP

[Abhi]

PROBLEM 2:  First all the expressions are evauated from right to left in 
printf() and then results printed with tha final value of i.

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/9uxWDI2wuhwJ.
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.

Re: [algogeeks]

[Abhi]

I thought malloc returned char* !

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/n-KMvxWiJs4J.
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.

Re: [algogeeks] Re: Yahoo Question

[Abhi]

Can anyone give an insight into the way XOR operations are used for swapping 
two variables?

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/ZJ_fiB6VmlQJ.
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.

[algogeeks] Re: Some adobe interview questions.

[Abhi]

Q1. 
First sort both the strings using counting sort perhaps. 
Then starting from the first character, search for it in the second string 
using binary search. 
The succeeding character of A will be searched from the index in B at 
which last character of A was found

Worst case: When both the strings are alike : O(log(m) + log(m-1) + log(m-2) 
...log(1)) = O(m*log(m))

But Average case will be quite efficient

Abhishek Khattri,
Computer Engineering,
Netaji Subhas Institute of Technology

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/vo0EQrVjxBUJ.
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.

[algogeeks] Re: Some adobe interview questions.

[Abhi]

Sol for Q4

int pallindrome(char *str)
{
static length = strlen(str);
if(length  1)
return 1;

if(str[0] == str[length-1])
{
   length -= 2;
   return pallindrome(str+1);
}
else
return 0;
}





-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/WwBB4MUlTWMJ.
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.

Re: [algogeeks] Explain this.....

[Abhi]

Well, according to gnu standards, it's never safe to depend on the order of 
evaluation of the arguements passed to a function. So the output in the 
above case would vary from compiler to compiler

Source:
http://gcc.gnu.org/onlinedocs/gcc/Non_002dbugs.html

read the second last point

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/4IBDW_MOIpAJ.
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.

[algogeeks] Re: Removing a set of characters from a given string

[Abhi]

Is this your college assignment?


On Aug 7, 9:00 pm, Arulanandan P [EMAIL PROTECTED] wrote:
 You have to write a function whose prototype is given bellow. this function
 will accept two char * named subject and pattern. for example
 subject=abracadbra
 and pattern=bca.now it should check occurrences of all chars of string
 pattern in subject . If any match occurs then it will remove that char from
 subject . so finally , as in our example
 at end subject =rdr

 void fun(char *subject,char *pattern)
 {
 // write your code here}


--~--~-~--~~~---~--~~
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 [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---

[algogeeks] Find the original array

[Abhi]

You are given an array of n numbers and each element is equal to the
count of numbers less than that number in right hand side of the
original and we have to find the original array;
It is given that the n-numbers in the original array is from 1 to n.

For ex. if the original array is 4,1,3,2
Then we would we given the array 3,0,1,0
Ex no 2. Original array 2,3,1,4
Given array 1,1,0,0
Ex no. 3 original array 5, 2,1,3,4
Given array 4, 1,0,0,0

Can any one suggest space and time efficient solution for this.


--~--~-~--~~~---~--~~
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 [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---

[algogeeks] Interesting flash puzzles

[Abhi]

http://fizzlebot.com/cdt2.php


--~--~-~--~~~---~--~~
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 [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---

[algogeeks] Re: A Definiton of an Algorithm

[Abhi]

I believe, you must have gone through the homepage of this site  ;-)

http://en.wikipedia.org/wiki/algorithm

-Abhishikt


--~--~-~--~~~---~--~~
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 [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---

[algogeeks] Re: puzzle from code4bill

[Abhi]

int steps_combi(int steps)
{
if(steps==1)
return 1;
if(steps==2)
return 2;

// can take single step or double step

return (steps_combi(steps-1) + steps_combi(steps-2));  
}

[algogeeks] Donald E. Knuth - The Art of Computer Programming, Volumn 4 released

[Abhi]

Donald E. Knuth -
The Art of Computer Programming, Volumn 4 released

http://www.cs.utsa.edu/~wagner/knuth/

[algogeeks] Sum of sub array

[Abhi]

Given sorted array of size n. For any i, j  n; return me sum from
array[i] to array[j] in O(log n). You can use O(n) memory, do
pre-computations and store it in a data structure

-Abhishikt

[algogeeks] Re: www.algogeeks.com - request to check out

[Abhi]

I also think that there should be a two way sync-up established before
start using this new site. At least one way sync-up should be there.

-Abhi

[algogeeks] Re: Quick primer on time complexity

[Abhi]

Introduction to Algorithms, Second Edition
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford
Stein

This is a real good book to clearly understand all time complexities in
detail.

http://mitpress.mit.edu/catalog/item/default.asp?ttype=2tid=8569