acadgild Profile Banner
ACADGILD Profile
ACADGILD

@acadgild

Followers
1K
Following
4K
Media
3K
Statuses
6K

AcadGild is a technology education start-up. We believe that new skill are best learned with guidance from an experienced practitioner.

Bengaluru, India
Joined July 2014
Don't wanna be here? Send us removal request.
@acadgild
ACADGILD
5 years
@codingheroai
codinghero
5 years
Answers to yesterday's puzzle: .A) 7 times.B) The algorithm is if n is the length of the stick, then 2^x > n, where x is the number of cust. #Coding #CodingHeroPuzzles #ContestAlert #Puzzles #dailymotivation #kidsathome #kidsactivities #codingisfun #programmingisfun.
0
0
0
@acadgild
ACADGILD
5 years
@codingheroai
codinghero
5 years
So, yes, 8 is the right answer to yesterday's puzzle. Did you know that no formula exists to find out the number of magic squares of an arbitrary order. #Coding #CodingHeroPuzzles #Puzzles #dailymotivation #kidsathome #kidsactivities #FridayThoughts #weekend #codingisfun.
0
0
0
@acadgild
ACADGILD
5 years
@codingheroai
codinghero
5 years
73 is the right answer. Btw, this is a classic Josephus problem. It's named after famous Jewish historian Flavius Josephus. You can use recursion to solve this.#Coding #CodingHeroPuzzles #ContestAlert #Puzzles #LearnAtHome #dailymotivation #kidsathome #kidsactivities #algorithms.
0
0
1
@acadgild
ACADGILD
5 years
Solution to yesterday's puzzle!.
@codingheroai
codinghero
5 years
This can be solved in 2 weighing. Surprised? .Let's start by keeping aside one coin if N is odd and two coins if N is even. Then, divide the remaining even number of coins into two equal-size groups and put them on the opposite pans of the scale. #CodingHeroPuzzles.
0
0
0
@acadgild
ACADGILD
5 years
@codingheroai
codinghero
5 years
Today's puzzle. What technique will you use to solve this? Solve it with your kids and have fun! #Coding #CodingHeroPuzzles #ContestAlert #Puzzles #LearnAtHome #dailymotivation #kidsathome #kidsactivities #algorithms.
Tweet media one
0
0
0
@acadgild
ACADGILD
5 years
Answer to yesterday's puzzle! Did you get it right?.
@codingheroai
codinghero
5 years
The right answer is 11 and 19. How? .(a) In the worst case, before you get at least one matching pair, you will select 5 black, 3 brown, and 2 gray gloves all for the same hand the next glove will have to be a matching pair. Thus, the answer is 11. #CodingHeroPuzzles #Coding.
0
0
1
@acadgild
ACADGILD
5 years
@codingheroai
codinghero
5 years
Today's puzzle. What technique will you use to solve this? Solve it with your kids and have fun! #Coding #CodingHeroPuzzles #ContestAlert #Puzzles #dailymotivation #kidsathome #kidsactivities.
Tweet media one
0
0
1
@acadgild
ACADGILD
5 years
RT @codingheroai: 1 is the right answer. We use a technique called Transform-and-Conquer to solve this. Ready for today's puzzle? #Coding #….
0
3
0
@acadgild
ACADGILD
5 years
RT @codingheroai: How can you use Decrease-and-Conquer to solve this #puzzle? Lucky winners will get free access for their child to CodingH….
0
2
0
@acadgild
ACADGILD
5 years
RT @codingheroai: 14 is the right answer. What strategy did we use to solve this?We used a strategy called Decrease-and-Conquer. In this, w….
0
1
0
@acadgild
ACADGILD
5 years
RT @codingheroai: Has your child solved this puzzle?Get them to solve it now. Forward it to your friends who have kids. Post the solution a….
0
3
0
@acadgild
ACADGILD
5 years
RT @codingheroai: Today's puzzle. What technique will you use to solve this? Solve it with your kids and have fun! #Coding #CodingHeroPuzzl….
0
5
0
@acadgild
ACADGILD
6 years
15.5% of the global population is affected by mental illnesses, and those numbers are rising. To deal with it, researchers are testing different ways that #artificialintelligence can help screen, diagnose and treat #mentalillness. #AI #Technology.
1
0
2
@acadgild
ACADGILD
6 years
Information security breaches are getting increasingly common around the world, across all domains. Here are some data thefts of the last decade which left the world shocked. Click to read more: #Acadgild #DataBreach #DataPrivacy.
0
0
1