names = ['arun', 'vinod', 'karthik', 'sita', 'ramu', 'arvind', 'abinav', 'malu', 'prakash']
for i in names:
if len(i) in d:
text = "data science and data analytics "
for i in text.split():
for k in d:
print(k,' = ',d[k])
string='python programming is fun'
for i in string:
for i in d:
if i!=' ' and d[i]!=1:
print(i,' - ',d[i])
list1 = [1, 5, 8, 10, 50]
list2 = [3, 4, 29, 41, 45, 49]
while i < len(list1) and j<len(list2):
if list1[i] < list2[j]:
while i < len(list1):
while j < len(list2):
return [i**3 for i in range(n)]
for x in f(5):
What are the building blocks of an android app
Explain briefly about the lifecycle of android app
Which android component handles background jobs like network downloads, playing music
Which android component allows multiple apps to share data
Which android component handles system wide events like arrival of SMS
You can either attach an android device or use an emulator (AVD) to see the result of your program. This tutorial tells how to create an AVD (android virtual device) and launch the main activity (this is like hello world application )
Maven is a project management tool used for project build, dependencies, and documentation.Maven does the following jobs
Easy to build a project
Provide uniform build process
Provide project information
Easy migration to Maven updates
Maven plugins are reusable.
Maven is build automation tool used mainly for Java projects
Maven assists in project workflow like issue tracking and release management
Simple project setup following best practice
Consistent usage for all projects
Manage dependencies, Automatic updating etc
Work on multiple projects simultaneously
Easy to write plugins in Java or other languages
Release management and distribution publication
To begin your journey for Competition programming, below are some tips which would help to get into the competition programming.
Learn a programming language(like C,C++,JAVA etc) you are going to use in all competitions. C++ is predominant in programming contests and competitions because of its speed, available data structures / algorithms in STL library and because all the competitions support it.
Participation and practice is the ultimate mantra. Start with easy problems then move on complex problems and topic wise problems. Also check initial submissions of good coders and editorials, this will make you learn a lot.
Avoid time limit exceeded error, always consider worst cases before you start coding. Do proper order analysis of your solution because sometimes a little optimization is to be done but sometime there is a need of totally new and efficient algorithm.
Must learn works, proof, code and analysis of basic and well known algorithms. A book “Introduction to Algorithms”, written by Cormen, is considered Bible on this topic. Some of the well known algorithms to be worth of learning are-
Sieve of Eratosthenes, or another prime number sieve
Either Kruskal's or Prim's algorithm
Some implementation of topological sorting, such as by using DFS
Convex hull (like Monotone Chains algorithm)
Edmonds--Karp, or another implementation of the Ford--Fulkerson method; or a preflow-push algorithm; or
To get good at writing fast codes and improving your implementation follow this:
On Topcoder, start with Div2 250 master it then start with Div2 500 master it then move to Div1 250. Meanwhile keep learning algorithms and keep practicing them on SPOJ or Codechef or Codeforces . And do read the tutorials, after a time you will realize that the tricks and methods to solve are repeating themselves.