Google coding competition

-

Google coding competition

1. Kickstart

Kickstart is a coding competition hosted by google which offers coding challenges to programmers all over the world. It involves a three-hour round of algorithmic challenges, developed by Google engineers. On each round you will be provided with a set of challenges, on solving each challenge you will be awarded certain points and the ranking will be based on the total points you scored. The rounds are held regularly throughout the year. With this, you can get a taste of the technical skills needed for a career at Google. You might be contacted by google for a direct interview if you perform well in these challenges.

How to prepare?

  • Get familiarized with at least one programming language.
  • Develop your knowledge about data structures like list, stack, queue, heap, etc.
  • Learn basic and complex algorithms.
  • Try past year problems and view submissions of top scorers.
  • Practice catching bugs and creating tests.
  • Do time bound practice.
Eligibility :

You should be at least 18 years for participating in kickstart.

Prizes:

You will get a participation certificate as long as you make one competitive attempt.

The winner gets $15,000 and the runner gets smaller prizes.


To participate in kickstart - Register here!

Try past problems - Click here


2. Code Jam

Code Jam is another coding competition organized by google every year. It is the longest coding challenge that is open for programmers all over the world which occurs for 30 hours. It involves three rounds. The programmers compete by solving the algorithmic challenge and the contestants will be shortlisted for the next round based on their scores. Finally, 25 participants will compete for the code jam world finals.

How to prepare?

  • Get familiarized with at least one programming language like python, C, C++, java.
  • Learn about data structures like list, stack, queue, heap, etc.
  • Have knowledge of basic and complex algorithms.
  • Try past year problems and view submissions of top scorers.
  • Practice catching bugs and creating tests.
  • Do time bound practice.

Eligibility :

You should be at least 18 years for participating in code jam.

Prizes:

You will get a participation certificate if you make at least one competitive attempt.

  • 1st place : $15,000
  • 2nd place : $2,000
  • 3rd place : $1,000
  • 4th - 25th place : $100

To participate in code jam - Register here!

Try past problems - Click here

3. Hash code :

Hash code is again a famous coding competition organized by Google. It is a team event. Here the team is asked to solve a real Google engineering problem for the online qualification round. The round holds for 4 hours. The top performed teams will enter the virtual world finals. In the virtual world finals, the team has to solve another challenge and compete for cash prizes.

How to prepare?

  • Get familiarized with at least one programming language like python, C, C++, java.
  • Learn about data structures like list, stack, queue, heap, hashtable, etc.
  • Learn file operations
  • Get familiarized with exception handling
  • Have knowledge of basic and complex algorithms.
  • Try past year problems and view submissions of top scorers.
  • Practice catching bugs and creating tests.
  • Do time bound practice.

Eligibility :

You should be at least 18 years for participating in code jam.

You should have a team with 2-4 members.

Prizes:

You will get a participation certificate if you score at least one point.

  • 1st place : $4,000
  • 2nd place : $2,000
  • 3rd place : $1,000
To participate in hashcode - Register here!

Try past problems - Click here


Comments

Post a Comment

Popular posts from this blog

Finding the percentage in python - HackerRank solution

-
Solution for hackerRank problem Finding the percentage in python Problem : The provided code stub will read in a dictionary containing key/value pairs of name:[marks] for a list of students. Print the average of the marks array for the student name provided, showing 2 places after the decimal. Example The  query_name  is 'beta'. beta's average score is  . Input Format The first line contains the integer  , the number of students' records. The next lines contain the names and marks obtained by a student, each value separated by a space. The final line contains  query_name , the name of a student to query. Constraints 2<=n<=10 0<=marks[i]<=100 length of marks arrays = 3 Output Format Print one line: The average of the marks obtained by the particular student correct to 2 decimal places. Sample Input 0 3 Krishna 67 68 69 Arjun 70 98 63 Malika 52 56 60 Malika Sample Output 0 56.00 Explanation 0 Explanation 0 Marks for Malika are   whose average is  Sample Input
Read more

HackerRank challenges with solutions (Rearrangement, Formula, Word sorting, Numbers, Sentence)

-
Image
  1.  Rearrangement Given a list A elements of length n , ranging from 1 to n. All elements may not be present in the array. If the element is not present then there will be -1 present in the array. Rearrange the array such that A[i]=i and if i is not present display -1 at that place. Input format : The first line contains a n numbers with each number separated by space. Output format : Print the elements of the list after modification. Sample input : -1 -1 6 1 9 3 2 -1 4 -1 Sample Output : -1 1 2 3 4 -1 6 -1 -1 9 Explanation : The modified list contains elements such that A[i]=i . Code : Output :   2.  Formula Write a program that calculates and prints the value according to the given formula , Q=square root of [(2*C*D)/H]. Following are the fixed values of C and H , C=50 ,H=30. D is the variable whose values should be input to your program in a comma separated sequence. Input format : A sequence of values for D with each value separated by comma. Output format : Print the sequence of
Read more

ginortS in Python - HackerRank solution

-
Solution for hackerRank problem ginortS in Python Problem : You are given a string S.  S contains alphanumeric characters only.  'SORTING' Your task is to sort the string S in the following manner: All sorted lowercase letters are ahead of uppercase letters. All sorted uppercase letters are ahead of digits. All sorted odd digits are ahead of sorted even digits. Input Format A single line of input contains the string S. Constraints 0 < len(S) < 1000 Output Format Output the sorted string S. Sample Input Sorting1234 Sample Output ginortS1324 Code : s = str(input()) Upper = [] lower = [] odd_no = [] even_no = [] for i in s:     if(i.isupper()):         Upper += [i]     if(i.islower()):         lower += [i]     if(i.isnumeric()):         if(int(i)%2 == 0):             even_no += [i]         else :             odd_no += [i] Upper.sort() lower.sort() odd_no.sort() even_no.sort() Upper = "".join(Upper) lower = "".join(lower) odd = "".join(odd_no) ev
Read more