[algogeeks] Freelance Website Tagging Consultant | Adobe Analytics and CDP Expertise Available

Hi Team, I hope this email finds you well. I am reaching out to introduce myself as a freelance Website Tagging Consultant with extensive experience in Adobe Analytics and Customer Data Platform (CDP) implementation. After reviewing your organization's needs, I am confident that my skills and

[algogeeks] Personal introduction and question.

I am Ian Martin Ajzenszmidt, retired, and I reside in Australia. My question is What is the likely output if you use an evolutionary algorithm on itself, perhaps with a supervising neural network? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks"

Re: [algogeeks] Re: Amazon Job openings

It's great to see this group active after such a long time, though it was not for discussing an algo, but I think it's fine if a member in the group needs some help in his/her professional career and asks for the same here. Many members in this group are in this industry from more than a decade or

Re: [algogeeks] Re: Amazon Job openings

Hello, guys! Have a nice day. Greetings from Russia. пт, 16 июл. 2021 г., 09:19 Himanshu Singh : > Hello Guys, > > Sorry to say pls stop spamming whole group. > > Thanks. > > > On Fri, Jul 16, 2021, 11:46 AM Yash Khandelwal < > khandelwalyash...@gmail.com> wrote: > >> Done kindly check the mail

Re: [algogeeks] Re: Amazon Job openings

Hello Guys, Sorry to say pls stop spamming whole group. Thanks. On Fri, Jul 16, 2021, 11:46 AM Yash Khandelwal wrote: > Done kindly check the mail > > On Fri, Jul 16, 2021, 11:41 AM immanuel kingston < > kingston.imman...@gmail.com> wrote: > >> Please send a note to me on king...@amazon.com

Re: [algogeeks] Re: Amazon Job openings

Done kindly check the mail On Fri, Jul 16, 2021, 11:41 AM immanuel kingston < kingston.imman...@gmail.com> wrote: > Please send a note to me on king...@amazon.com > > Thanks, > Kingston > > On Fri, Jul 16, 2021 at 11:16 AM immanuel kingston < > kingston.imman...@gmail.com> wrote: > >> Hi all, >>

[algogeeks] Re: Amazon Job openings

Please send a note to me on king...@amazon.com Thanks, Kingston On Fri, Jul 16, 2021 at 11:16 AM immanuel kingston < kingston.imman...@gmail.com> wrote: > Hi all, > > I am a hiring manager at Amazon. We are hiring for SDE and Applied Science > roles in my team. Please send a short note about

[algogeeks] Amazon Job openings

Hi all, I am a hiring manager at Amazon. We are hiring for SDE and Applied Science roles in my team. Please send a short note about yourself, the role you wish to apply for and your updated CV. Thanks, Kingston -- You received this message because you are subscribed to the Google Groups

[algogeeks] Amit shah Home Minister of India: Support Arnab Goswami, Maharashtra Government is Harassing him.

Hey, I just signed the petition "Amit shah Home Minister of India: Support Arnab Goswami, Maharashtra Government is Harassing him." and wanted to see if you could help by adding your name. Our goal is to reach 100 signatures and we need more support. You can read more and sign the petition here:

[algogeeks] ADOBE SOLUTIONS PARTNER Consulting Services -Increase your Digital Business with Infinite 360

Hi , I am Pavan from Infinate360 Consulting Services. Recently we saw your linkedin profile and wanted to introduce our company which helps companies in Adobe Solution Patner i.e Adobe analytics Implementation Services. We have completed integrating with https://www.thecatalystacademy.org/ as our

Re: [algogeeks] ADOBE SOLUTIONS PARTNER Consulting Services -Increase your Digital Business with Infinate 360

Hello, I am available from 8 a.m to 12 p.m Best regards, Mykhailo Shershen T, 16. juuni 2020 16:32 Pavan_DigitalTechnocryne kirjutas: > Hi , > > > > I am Mark from Infinate360 Consulting Services. Recently we saw your > linkedin profile and wanted to introduce our company which helps

Re: [algogeeks] ADOBE SOLUTIONS PARTNER Consulting Services -Increase your Digital Business with Infinate 360

Hi Mark, I will be available between 10 am to 4 pm tomorrow. So you can connect me any time in between. On Tue, 16 Jun 2020, 19:02 Pavan_DigitalTechnocryne, < pavan.mtech1...@gmail.com> wrote: > Hi , > > > > I am Mark from Infinate360 Consulting Services. Recently we saw your > linkedin profile

Re: [algogeeks] ADOBE SOLUTIONS PARTNER Consulting Services -Increase your Digital Business with Infinate 360

Rspected Sir , This is Yash Khandelwal here. I received a mail from your side in which you mention that you visit my LinkedIn profile. It's a great pleasure for me. You are required some information to connect with me here are the same I provided to you: Email id: khandelwalyash...@gmail.com

[algogeeks] ADOBE SOLUTIONS PARTNER Consulting Services -Increase your Digital Business with Infinate 360

Hi , I am Mark from Infinate360 Consulting Services. Recently we saw your linkedin profile and wanted to introduce our company which helps companies in Adobe Solution Patner i.e Adobe analytics Implementation Services. We have completed integrating with https://www.thecatalystacademy.org/ as

[algogeeks] Job openings java developer jio gurgaon

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,

[algogeeks] HEY GUYS PLEASE HELP ME FOR THİS QUESTİON CAN YOU SOLVE THİS?

İM WAİTİNG FOR YOUR ANSWERS İF YOU CAN QUİCK İTS GONNA REALLY HELP ME -- 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.

Re: [algogeeks] CAN ANYBODY HELP ME ?!! WİTH THİS ALGORİTHM

thank you :) Rahul Rai , 6 Kas 2018 Sal, 14:16 tarihinde şunu yazdı: > Let the glass be numbered 0 1 2 3... (2n - 1). > And the glass numbered 0 1 2 3...(n - 1) are filled. > Pick every alternating ith filled glass starting from 1 indexed glass and > swap it with the (n - 1 - i)th unfilled

Re: [algogeeks] CAN ANYBODY HELP ME ?!! WİTH THİS ALGORİTHM

Let the glass be numbered 0 1 2 3... (2n - 1). And the glass numbered 0 1 2 3...(n - 1) are filled. Pick every alternating ith filled glass starting from 1 indexed glass and swap it with the (n - 1 - i)th unfilled glass. Index 1 will swap with 2n - 2 indexed glass. Index 3 will swap with 2n - 4

[algogeeks] CAN ANYBODY HELP ME ?!! WİTH THİS ALGORİTHM

There are 2n glasses standing next to each other in a row, the first n of them are filled with a soda drink, while the remaining n glasses are empty. Make the glasses alternate in a filledempty- filled-empty pattern in the minimum no of glass moves. -- You received this message because you are

Re: [algogeeks] Job Openings in Hyderabad/Bangalore

Вы кто? Отправлено со смартфона Samsung Galaxy. Исходное сообщение От: Михаил Троицкий Дата: 12.10.18 21:22 (GMT+03:00) Кому: algogeeks@googlegroups.com Тема: Re: [algogeeks] Job Openings in Hyderabad/Bangalore we have job in Siberiacome to motherland comrad пт, 12 окт.

Re: [algogeeks] Job Openings in Hyderabad/Bangalore

we have job in Siberia come to motherland comrad пт, 12 окт. 2018 г., 16:34 kumar raja : > Folks, > I am looking for job switch in Hyderabad/Bangalore, if any one has > references/pointers regarding openings please let me know. > > -- > Regards > Kumar Raja > > > -- > You received this message

[algogeeks] Job Openings in Hyderabad/Bangalore

Folks, I am looking for job switch in Hyderabad/Bangalore, if any one has references/pointers regarding openings please let me know. -- Regards Kumar Raja -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and

Re: [algogeeks] Need help

Hi, An approach could be to guess the answer `A` and check if in `A` time, all the tasks can be completed. For checking, just iterate through the k people, the number of tasks completed would be `A`/k[i] (integer division) for everyone. If sigma(`A`/k[i]) >= N, `A` works. Now do a binary search to

[algogeeks] Need help

Hi All, Has anybody solved the following problem? https://www.careercup.com/question?id=5196860946907136 -Pawan -- 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

[algogeeks] Manufacturing equal length poles from given Rods

Hello geeks, I came across a problem, please help me to find out solution of it. Statement: There are N iron rods having some hight, task is to manufacture two poles having same hight using the available N rods. ( these poles are used for hoarding), it’s expected that hoarding can be seen from

Re: [algogeeks] GREGOVIA in SPOJ

hi Mehdi, Why should we consider from left to right only or right to left only ? Explanation you gave does not look like proof that it gives optimal solution. We should be able to prove that any other matching strategy is not better than greedy approach mentioned. The example I

Re: [algogeeks] GREGOVIA in SPOJ

The Greedy observation is something like this: the leftmost person needs to satisfy his/her requirement from someone on his right, (i.e. if he wants to sell he has to sell to someone on his right, if he needs to buy he has to buy from someone on his right) Try to traverse the street from left to

[algogeeks] Interns Required

Hello all, We at Mindtickle (Pune based) are looking to hire some interns having interest and experience in *JS / frontend*. People having a break in next two months would be very suitable, but others are also encouraged to reach out. 6 months interns would be even better. The work will be

[algogeeks] GREGOVIA in SPOJ

Hi, I am trying to solve this problem in spoj website. you might be aware of this website. http://www.spoj.com/problems/GERGOVIA Gergovia consists of one street, and every inhabitant of the city is a wine salesman. Everyone buys wine from other inhabitants of the city. Every day each

Re: [algogeeks] Re: MICROSOFT:Given a BST and a number. Find two node in a BST whose sum is equal to given number in O(n) time and O(1) space.

The O(1) space constraint is impossible, for any traversal will take Omega(n) stack space in the worst case. On Sep 5, 2017 10:38 PM, "deepikaanand" wrote: > using iterators: > > > __author__ = 'deepika' > > """ > This code will return iterator for inorder traversal of

[algogeeks] Re: MICROSOFT:Given a BST and a number. Find two node in a BST whose sum is equal to given number in O(n) time and O(1) space.

using iterators: __author__ = 'deepika' """ This code will return iterator for inorder traversal of a BST """ class TreeNode(object): def __init__(self, x): self.val = x self.left = None self.right = None def __repr__(self): return str(self.val)

Re: [algogeeks] Openings at Amazon - SDE IIs

why you team is hiring? On 9 May 2017 at 16:00, immanuel kingston wrote: > My team is hiring Software Development Engineers! > > > More about the team > > "Come join the platform team that develops components and services used to > support repeat delivery programs

[algogeeks] Openings at Amazon - SDE IIs

My team is hiring Software Development Engineers! More about the team "Come join the platform team that develops components and services used to support repeat delivery programs like Subscribe & Save for customers and Recurring Delivery for businesses. Our systems enable Amazon to launch

[algogeeks] Openings for freshers, experienced guys For Juniper Networks..

We have openings at Juniper Networks for Freshers & experienced guys. Email me your resume at piyushj at gmail.com Regards, Piyush Jain -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving

Re: [algogeeks] Experience hiring in siemens with 5-8 years in C\C++

How much is the maximum CTC which can be offered by Simens? On Monday, October 24, 2016, Himanshu Singh wrote: > Hello All, > > Openings at Siemens Bangalore with following skill set. > 1. 5-8 years of experience. > 2. c, c++ and Embedded experience. > 3. Linux,

[algogeeks] Experience hiring in siemens with 5-8 years in C\C++

Hello All, Openings at Siemens Bangalore with following skill set. 1. 5-8 years of experience. 2. c, c++ and Embedded experience. 3. Linux, RTOS. 4. RS485, CAN, BANet, I2C, SPI, Industrial Ethernet. 5. Linux system programming and scripting. If interested send your resume... *Regards,*

[algogeeks] MindTickle Interview process

Hi All, Has anybody experienced the interview process with MindTickle Pune? If yes, please share the problems. Thanks, Pawan -- 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,

Re: [algogeeks] Designing Interview questions

You can review below blogs i came across: https://github.com/shashank88/system_design https://github.com/shashank88/system_design/blob/master/README.md On Sun, Jul 10, 2016 at 4:52 PM, pawan yadav wrote: > Hi All, > > Can anyone please let me know where can I

[algogeeks] Designing Interview questions

Hi All, Can anyone please let me know where can I read/understand about questions like "Design a Car Service center", I see this type of questions in many interview sets. What do interviewer expect in this type of questions? It would be great help. -Pawan -- You received this message because

[algogeeks] Hello from Amazon

Hi, Amazon Appstore is hiring. We need Software Development Engineers, Web Development Engineers, Quality Assurance Engineers, UX designers, Program Managers, Technical Program Managers, Operations Managers, Data Engineers, Executive Assistants, Business Development Managers If you are any of

[algogeeks] Openings in Amazon

Multiple openings for SDE-2 position in Hyderabad/Gurgaon location. Interested ones revert back with updated CV. -- Aman A. Amazon.com | Software Development Engineer | TAM - Technology एकम् सत्, विप्राः बहुधा वदन्ति -- You received this message because you are subscribed to the Google

Re: [algogeeks] Re: 25march

Check here http://www.writeulearn.com/defective-ball-puzzle/ On Mon, Mar 28, 2011 at 5:54 PM, Subhransu wrote: > Worst Case scenario you will get in 3 steps > > 9 balls > > Compare 1st:123| 456| 789 > if (first > second)

Fwd: [algogeeks] Interview Question

See this amazing list here: http://www.writeulearn.com/interview-questions/ -- Forwarded message -- From: Umer Farooq Date: Fri, Apr 8, 2011 at 4:22 PM Subject: Re: [algogeeks] Interview Question To: algogeeks@googlegroups.com Ankur, you are rite. He

[algogeeks] Matriz of int

For a NxM matrix, with N lines and M columns of long integers, representing a full paragraph of text, each set of 8 letters into cell 1x1 as, L0, L1, ..., L7, are stored in the following way, l7, L6, ..., l1, l0 (i.e., backward); in the cell 1x2 presents the next set of 8 letters as follows l15,

[algogeeks] About images in python!

Hi folks! I have a little question, i have a picture, let's say picture A. And i would like to reduce it by half (reduce its dimension). To be more fomal, i would like to apply a funtion of the type f(x)=(1/2)x to the image A, i.e, i want B=f(A)=(1/2)A. Where B it's the new image with the

[algogeeks] Re: Minimal number of swaps

Use the quicksort algorithm: Set the swap counter to 0. Search from the beginning of the array for the first 0, and from the end of the array for the first 1. If the pointers cross, you are done; otherwise increment the swap counter and continue the searches. On Tuesday, March 29, 2016 at

[algogeeks] Re: Minimal number of swaps

oh, nevermind, sorry ;P you want the 1's at the beginning, not the end... //friday On Friday, April 22, 2016 at 4:07:53 PM UTC-4, icy` wrote: > > Hi, > I'm not sure I understand the second example. Shouldn't the second one > also produce an answer of 1 (swap the one in index 1 with the

[algogeeks] Re: Minimal number of swaps

Hi, I'm not sure I understand the second example. Shouldn't the second one also produce an answer of 1 (swap the one in index 1 with the zero in the last index) 0 *1* 0 1 1 1 *0* icy` On Tuesday, March 29, 2016 at 10:00:21 AM UTC-4, Régis Bacra wrote: > > This puzzle comes from a

Re: [algogeeks] Minimal number of swaps

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

Re: [algogeeks] Minimal number of swaps

It's essentially the same as kumar's algorithm. a[n - 1] records the total number of 1's, ie. K; a[a[n-1]-1] = a[K-1] records the number of 1's in the first K elements. the difference K-a[K-1] is the number of 0's in the first K elements, to be swapped for remaining 1's. 2016-04-19 16:54

Re: [algogeeks] Minimal number of swaps

Hey Sachin, What is the correctness of your code? I mean how do you say that this is give the right answer -- 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

Re: [algogeeks] Minimal number of swaps

1 - keep a running total of the sum in an array (or reuse the same array) 2 - a[n - 1] (ie, the length of the array) - a[a[n - 1] - 1] is the answer 0 1 0 1 1 1 0 0 1 1 2 3 4 4 ans = 4 - a [ 4 - 1 ] = 2 1 0 1 0 1 1 1 2 2 3 ans = 3 - a [ 3 - 1 ] = 1 Same Os as the prev solution mentioned,

Re: [algogeeks] Minimal number of swaps

Clever. Thanks! Le mardi 29 mars 2016 20:23:22 UTC+2, kumar raja a écrit : > > Adding time and space complexities. > > Time complexity: O(n) > Space complexity: O(1) > > > On 29 March 2016 at 23:44, kumar raja > wrote: > >> I think it is straight forward. Correct me if i

Re: [algogeeks] Minimal number of swaps

Adding time and space complexities. Time complexity: O(n) Space complexity: O(1) On 29 March 2016 at 23:44, kumar raja wrote: > I think it is straight forward. Correct me if i am wrong or if there is > better solution. > > 1) Do one pass over the list of elements and

Re: [algogeeks] Minimal number of swaps

I think it is straight forward. Correct me if i am wrong or if there is better solution. 1) Do one pass over the list of elements and count the number of 1's. let us say it is K 2) count = 0 from index 0 to K-1 do if array[index] != 1 count ++ end end

[algogeeks] Minimal number of swaps

This puzzle comes from a contribution on codingame.com (link to the puzzle ). Any idea to solve it efficiently? Given a list of 1 and 0, you must regroup all the 1 at the begin of the list in a minimum number of steps. A step is the

[algogeeks] Re: Buying candy

It is like bubble sort type of algorithm. I'm not tested it on different data sets, created just for fun and your critic) struct valuePos {int val; int pos;} valuePos[,] data = new valuePos[n,n]; // assign input data array to [val] properties // initialize by maximum val in data +1 or just

[algogeeks] Re: Find all the subarrays in a given array with sum=k

void findSum(int[] arr, int startPos, int finPos, int reqiredSum) // recursion procedure { int sum =0; // calculating sum of current(subarray) segment of array. imo single element is also a subarray so here we have i <= finPos in case when startPos == finPos for(int i = startPos, i

[algogeeks] Re: Largest Rectangle

Use data structure to hold first position and last position of line // line - sequence of "0" elements in one of the dimensions in your matrix Search lines in each dimension and store in array of line[s] //for optimization, store in separate array for each dimension:

Re: [algogeeks] Find all the subarrays in a given array with sum=k

Hi, This question was asked in Amazon interview few days back. Please explain to me the part after building the SUM array. With Regards, Saurabh Agrawal On Sun, Feb 21, 2016 at 9:08 PM, Saurabh Paliwal < saurabh.paliwa...@gmail.com> wrote: > Hi, > I can think of an approach that is neither

[algogeeks] Re: Find all the subarrays in a given array with sum=k

http://stackoverflow.com/questions/14948258/given-an-input-array-find-all-subarrays-with-given-sum-k On Sunday, 21 February 2016 20:48:42 UTC+11, Shubh Aggarwal wrote: > > Given an array of n elements(both +ve -ve allowed) > Find all the subarrays with a given sum k! > I know the solution using

[algogeeks] Re: Buying candy

Don writes: > > JVC is a multi-part algorithm which consists of a shortest augmenting > path algorithm (JV) followed by a modified auction algorithm (C). It > is best implemented as a sparse matrix. JVC is definitely an example > of efficiency requiring a significant increase in

Re: [algogeeks] Find all the subarrays in a given array with sum=k

Hi, I can think of an approach that is neither recursion nor dynamic programming. ( I would like to know, how to solve it using dp, as you say, though) 1. Take an auxiliary array SUM which stores the sum of all entries from beginning to that index. 2. Now, you have to find all the pairs(i,j | j >

[algogeeks] Find all the subarrays in a given array with sum=k

Given an array of n elements(both +ve -ve allowed) Find all the subarrays with a given sum k! I know the solution using dynamic programming. It has to be done by recursion (as asked by the interviewer) For ex arr = 1 3 1 7 -4 -11 3 4 8 k = 12 answer = {1 3 1 7}, {4 8}, {1 3 1 7 -4 -11 3 4 8}

Re: [algogeeks] Openings in Mentor Graphics,Noida Location

Hi Ashish, Can you forward my profile. Thanks, Pradeep On Tue, Nov 17, 2015 at 10:04 AM, Ashish kumar Jain wrote: > Anybody interested to join Mentor Graphics Noida having 1-10 years of > experience in C/C++/DS/Algo can forward his/her resume to me. > > Please

Re: [algogeeks] Openings in Mentor Graphics,Noida Location

gj admin. Here's a question : http://careercup.com/question?id=5720992639877120 On Mon, Nov 16, 2015 at 8:38 PM, saurabh singh wrote: > Banned for spamming. > Again a request to the members to post algorithm related queries. Stuck in > some programming problem? Post it

Re: [algogeeks] Openings in Mentor Graphics,Noida Location

Hi, PFA. With Regards, Saurabh Agrawal On Tue, Nov 17, 2015 at 10:04 AM, Ashish kumar Jain wrote: > Anybody interested to join Mentor Graphics Noida having 1-10 years of > experience in C/C++/DS/Algo can forward his/her resume to me. > > Please understand that the

Re: [algogeeks] Re: Find max sum of elements in an array ( with twist)

you don't need to have arrays to store everything. A more memory efficient way is to store 2 values at each iteration whether to take this number or not. Below is a python code doing just that. def main(): numbers = map(int, raw_input().split()) maxTakingThis = 0

[algogeeks] Re: Find max sum of elements in an array ( with twist)

Here's a solution in javascript var data = [10 , 20 , 30, -10 , -50 , 40 , -50, -1, -3]; function max(array) { var i = array[0]; array.forEach(function(val) { if(val > i) i = val; }); return i; } function maxSum(i, data, canSkip) { var len = data.length - i; if( len === 1)

[algogeeks] Re: Find max sum of elements in an array ( with twist)

Here's a solution in javascript var data = [10 , 20 , 30, -10 , -50 , 40 , -50, -1, -3]; function max(array) { var i = array[0]; array.forEach(function(val) { if(val > i) i = val; }); return i; } function maxSum(i, data, canSkip) { var len = data.length

[algogeeks] Fresher vacancy in Siemens, Bangalore

Hi, There are huge no of vacancies in Siemens,Bangalore for fresher. If Interested please frwrd me your resume at get2himanshusi...@gmail.com Job Profile:- • Implement software solutions as per business requirements. • Support existing software implementations • Participate in

[algogeeks] Boomerang Commerce - Hiring Game Changers

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

[algogeeks] Help solving this problem

Given an undirected graph G = (V, E), for any subset of nodes S ⊆ V we can construct a graph Gs from G by removing all nodes in S together with their incident edges. In the critical node problem (CNP), we are given an integer 1 ≤ k ≤ |V | and need to find a subset S of size k such that the graph

[algogeeks] Regarding the placement papers of Hitachi consultancy

Does anyone have the placement paper of Hitachi consultancy please send me asap. -- 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

Re: [algogeeks] Find max sum of elements in an array ( with twist)

Let function f(idx, can_skip) be the maximum possible value when we're observing array element at idx, and can_skip tells the function whether it can skip the element it is currently observing. The recurrence relation for f(idx, can_skip) is: 0 if idx == length of input arr, arr[idx] +

[algogeeks] Openings in Mentor Graphics,Noida Location

Anybody interested to join Mentor Graphics Noida having 1-10 years of experience in C/C++/DS/Algo can forward his/her resume to me. Please understand that the opening needs to be closed urgently.So,Hurry up. Note: Please ignore if inappropriate for this forum. -- Regards, Ashish -- You

Re: [algogeeks] Openings in Mentor Graphics,Noida Location

Banned for spamming. Again a request to the members to post algorithm related queries. Stuck in some programming problem? Post it here. Not understanding some algorithm? Post it here. Found an interesting problem? Post it. On Tue, Nov 17, 2015 at 10:04 AM Ashish kumar Jain

Re: [algogeeks] Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr

Banned for spamming. Again a request to the members to post algorithm related queries. Stuck in some programming problem? Post it here. Not understanding some algorithm? Post it here. Found an interesting problem? Post it On Mon, Nov 16, 2015 at 8:56 AM shashi kant wrote:

Re: [algogeeks] Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr

Hi Shashi, Please find the attached resume. Please consider my resume for this job opening. Thanks, Ashu On Thu, Nov 12, 2015 at 9:25 AM, shashi kant wrote: > hi, > > *Note:* if an inappropriate mail ..please do ignore > > Opening in Oracle IDC: Having experience in

Re: [algogeeks] Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr

You're not supposed to post job ads over here. Please help keeping the group clean. On Wed, Nov 11, 2015 at 7:55 PM, shashi kant wrote: > hi, > > *Note:* if an inappropriate mail ..please do ignore > > Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr ..mail

Re: [algogeeks] Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr

HI, thanks for letting me know ... *Shashi Kant * *"Think positive and find fuel in failure"* *Senior Member technical Staff* *Oracle India Pvt Ltd* http://thinkndoawesome.blogspot.com/ On Mon, Nov 16, 2015 at 4:31 AM, Shachindra A C wrote: > You're not supposed to post

[algogeeks] Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr

hi, *Note:* if an inappropriate mail ..please do ignore Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr ..mail your resume to me Regards, *Shashi Kant * *"Think positive and find fuel in failure"* *Senior Member technical Staff* *Oracle India Pvt Ltd*

[algogeeks] Re: [BANNED!!!] Urgent need Lead - Java Developer in Atlanta, GA

FYI, have banned this user and several others who mistook this group for a recruitment platform. Can we revive the legacy of this group again? On Mon, Nov 2, 2015 at 11:36 PM Shaik Asif wrote: > Hi Partner, > > This is Shaik from Deegit Inc. Partner find the below

[algogeeks] Urgent need Lead - Java Developer in Atlanta, GA

Hi Partner, This is Shaik from Deegit Inc. Partner find the below requirement for your consultants. If there are available. Please get back to me ASAP on sh...@deegit.com *WE ARE LOOKING FOR 10+ YEAR'S RESUME'S* *Position: Lead - Java Developer * Location: Atlanta, GA 30301 Duration: Long

Re: [algogeeks] Re: [BANNED!!!] Urgent need Lead - Java Developer in Atlanta, GA

Well, you need to ban a whole lot more people. On Mon, Nov 2, 2015 at 10:16 AM, saurabh singh wrote: > FYI, have banned this user and several others who mistook this group for a > recruitment platform. Can we revive the legacy of this group again? > > > On Mon, Nov 2, 2015

Re: [algogeeks] Re: [BANNED!!!] Urgent need Lead - Java Developer in Atlanta, GA

I guess we need new admins who can actively moderate the group. On Mon, Nov 2, 2015 at 6:30 PM, Shachindra A C wrote: > Well, you need to ban a whole lot more people. > > On Mon, Nov 2, 2015 at 10:16 AM, saurabh singh > wrote: > >> FYI, have banned

Re: [algogeeks] Re: [BANNED!!!] Urgent need Lead - Java Developer in Atlanta, GA

Yes, I would like that. I am sure about other admins, but I am guilty of ignoring mails on the group. I am finding it hard to manage things between job, other interests and google groups that I own/moderate. People who want to volunteer to moderate this group, please reply (unicast to me, *avoid

[algogeeks] Re: Range Modulo Problem

function solution( c1, c2, c3, c4 ) { var min; var max; var x; for( var y = c1; y <= c2; y++ ) { for( var z = c3; z <= c4; z++ ) { x = y % z; if ( !min ) { min = x;

[algogeeks] Urgent need Lead - Java Developer in Atlanta, GA

Hi Partner, This is Shaik from Deegit Inc. Partner find the below requirement for your consultants. If there are available. Please get back to me ASAP on sh...@deegit.com *We are looking more then 10 - 12 year's resume's.* *Position: Lead - Java Developer * Location: Atlanta, GA 30301

[algogeeks] Urgent need Lead - Java Developer in Atlanta, GA

Hi Partner, This is Shaik from Deegit Inc. Partner find the below requirement for your consultants. If there are available. Please get back to me ASAP on sh...@deegit.com *We are looking more then 9-10 year's resume's.* *Position: Lead - Java Developer* Location: Atlanta, GA 30301 Duration:

[algogeeks] Urgent need Business Analyst in Seattle, WA

Hi Partner, This is Shaik from Deegit Inc. Partner find the below requirement for your consultants. If there are available. Please get back to me ASAP on sh...@deegit.com *WE NEED CANDIDATE MORE THAN 10- 12 YEAR'S* *Position: Business Analyst* Location: Seattle, WA Duration: Long Team *The

[algogeeks] Immediate openings at a Bangalore based seed funded startup

Hi All, We are a seed funded startup working on an app only product for professional networking. We have 2 immediate openings the links of which are shared as follows https://angel.co/fairmont-technologies/jobs/91715-android-developer

[algogeeks] Urgent need Lead - Java Developer in Atlanta, GA for 5 months

Hi Partner, This is Shaik from Deegit Inc. Partner find the below requirement for your consultants. If there are available. Please get back to me ASAP on sh...@deegit.com Position: Lead - Java Developer Location: Atlanta, GA Duration: 5 Months · *Must have experience in

[algogeeks] Urgent need Lead - Java Developer in Atlanta, GA for 5 months

Hi Partner, This is Shaik from Deegit Inc. Partner find the below requirement for your consultants. If there are available. Please get back to me ASAP on sh...@deegit.com *Position: Lead - Java Developer * Location: Atlanta, GA Duration: 5 Months · *Must have experience in

[algogeeks] Urgent need Tableau Developer in San Francisco, CA for 6 months

Hi Partner, This is Shaik from Deegit Inc. Partner find the below requirement for your consultants. If there are available. Please get back to me ASAP on sh...@deegit.com *Position: Tableau Developer* Location: San Francisco, CA Duration: 6 Months 1"Tableau Architect with 8-10 + years of

[algogeeks] Openings in brocade ( Bangalore)

Guys, There are openings in my organization, description of which is below. Please send out your resume to me if you are interested in the openings. All the best to all of you. *Job Description* Roles and responsibility: Analyze requirements, design and deliver high quality software in

[algogeeks] Re: Question on algo

Very simple. If MAXOR of the entire input set is not equal to zero, there are no subsets with equal MAXORs. If MAXOR of the entire set is zero, then any two complementary subsets have equal MAXORs. Since there are 2^N (^ is the exponential operator) subsets of a set of N elements, Little Panda

Re: [algogeeks] Urgent Need Hadoop Architect in Bellevue, WA for 6 months

I'm interested for the position. Thanks, Chiranjeev +917838025430 On Wed, Oct 7, 2015 at 9:41 PM, Shaik Asif wrote: > Hi, > > > > This is Shaik from Deegit Inc. Please find the below requirement for your > review. If you are comfortable with the requirement please

[algogeeks] Urgent Need Hadoop Architect in Bellevue, WA for 6 months

Hi, This is Shaik from Deegit Inc. Please find the below requirement for your review. If you are comfortable with the requirement please get back to me ASAP. *Position: Hadoop Architect * Location: Bellevue, WA Duration: 6 Months • Serve as a technical Hadoop resource to define,

[algogeeks] Urgent Need Senior Solution Architect - Ticketing Solution Architect in Orlando, FL for 6 months

*Position: Senior Solution Architect - Ticketing Solution Architect* Location: Orlando, FL 32801 Duration: 6 Months *Special Skills: * Subject Matter Expertise in Ticket Sales and Set up required, Prior experience working in Ticketing solutions including product set up, pricing and

  1   2   3   4   5   6   7   8   9   10   >