The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Group info
 Language: English Group categories: Computers > Programming More group info »
Active older topics
7 new of 7 - May 17
10 new of 10 - May 12
5 new of 5 - May 14
1 new of 1 - May 5
2 new of 2 - May 5
3 new of 3 - May 3
4 new of 4 - May 3
5 new of 5 - May 2
1 new of 1 - May 2
32 new of 32 - Apr 30
Discussions
 View: Topic list, Topic summary Topics 1 - 10 of 7087  Older »

You cannot post messages because only members can post, and you are not currently a member.
 Description: Discuss ideas, algorithms, challenges related to programming. Don't message moderators or owners un-necessarily, read instructions and only then apply. For "INTERVIEW or COMPANY" related queries kindly join http://groups.google.com/group/interview -street

 Rope Data Structure Implementation I want to implement rope data stucture from scratch in c , is there any good material that can help me implement this with ease. Thanks Nishant By Nishant Pandey  - May 17 - 2 new of 2 messages

 Lexicographic rank of a string following is ocde snippet for this int findRank (char* str) { int len = strlen(str); int mul = fact(len); int rank = 1, i; int count[MAX_CHAR] = {0}; // all elements of count[] are initialized with 0 // Populate the count array such that count[i] contains count of // characters which are present in str and are smaller than i... more » By rahul sharma  - May 16 - 1 new of 1 message

 Highest reminder For a given number when divided by a number between 1 and n. I figured out that highest reminder can be got if I divide the number by (⌊(n/2)⌋+1) .Can anyone give me pointers ? By Soumya Prasad Ukil  - May 16 - 1 new of 1 message

 Math problem If a+b+c=C1 and ab+bc+ac=C2, how do you get abc? C1,C2 are constant. -- regards, soumya prasad ukil By Soumya Prasad Ukil  - May 15 - 4 new of 4 messages

 program to count set bits in all numbers from 1 to n // A O(Logn) complexity program to count set bits in all numbers from 1 to n Please tell what is use of getNextLeftmostBit as getleft most is getting the left most bit and getNext's while loop will never be executed...plz comment ... /* Returns position of leftmost set bit. The rightmost position is considered as 0 */... more » By rahul sharma  - May 12 - 3 new of 3 messages

 count number of set bits in an (big) array (Asked in Google interview) I was searching for google questions and got this question.Use look up to do it in bext way What is best time complexity for this.. plz post algo too By rahul sharma  - May 11 - 4 new of 4 messages

 I am new to CPP STL please help This is my code snippet ...using namespace std; void work() { map name_age; map index_name; map index_name_temp; std::map< int, string >::iterator it; name_age["abc"] = 12; name_age["pqr"] = 1; name_age["stu"] = 13; index_name[0] = "abc"; index_name[1] = "pqr";... more » By Nishant Pandey  - May 9 - 3 new of 3 messages

 Next higher number with same number of set bits unsigned snoob(unsigned x) { unsigned smallest, ripple, ones; // x = xxx0 1111 0000 smallest = x & -x; // 0000 0001 0000 ripple = x + smallest; // xxx1 0000 0000 ones = x ^ ripple; // 0001 1111 0000 ones = (ones >> 2)/smallest; // 0000 0000 0111 return ripple | ones; // xxx1 0000 0111 ...... more » By rahul sharma  - May 9 - 1 new of 1 message

 SPOJ- MPILOT WA on 10th TEST FILE I have been trying to solve this problem using DP. i managed to realize the problem in the form of recurrence.. The solution is: Suppose the task was : given N pilots you have to assign N/2 of them as captains and N/2 as assistances. Furthermore you need to do this in a way such that for every 1<=X<=N, the group of the youngest X pilots doesn't... more » By Piyush Raman  - May 12 - 4 new of 4 messages

 amazon f2f round question .. Given an acyclic graph. Give an algorithm to find the pair of nodes which has the maximum distance between them, i.e. the maximum number of edges in between them any suggestion ? thanks --mac By MAC  - May 11 - 7 new of 7 messages

 1 - 10 of 7087   « Newer | Older »

XML       Send email to this group: algogeeks@googlegroups.com