Girl in IT-wolrd

Everything has been downloaded. Quit download loop.

Protected: Google Interview

This content is password protected. To view it please enter your password below:

Google Polymer [10 Google Polymer Tutorials – From Basic To Advanced]

Learn complete Google Polymer with these tutorial series that take you from beginner to advanced level.

Google Polymer has taken component-based software engineering to a whole new level. The Polymer library makes it faster and easier to build spectacular applications, and since it has been built on the Web Components, it provides us with new composability over the web.

If you are a fan of material design, then you might already know that Polymer played a key role in material design development. Although both Polymer and Material design are still “under development”, what has already been made available to designers and developers is nothing less than amazing. Thanks to Polymer, we don’t have to worry about browser support since Polymer provides us with a set of “polyfills” that are easily compatible with non-compliant browser.

Since this is a new-age technology that has added an interesting twist to development, it becomes crucial for every futuristic-minded programmer to learn whatever there is to know about Google Polymer.js. Here are a few resources that should help you on your way to mastering the Polymer.

Level Up Tuts Polymer Tutorial

Level UpTuts has always done a great job when it comes to “instructional documentation”. With the Polymer Tutorials you can start as a beginner by learning what Polymer is, how to install it, how to create your first element, and so on. Then you can move on to more complicated techniques such as binding and iteration, layout attributes, using core elements, and material designing with paper elements.
Read more of this post

Technical Development Guide [Google]

Чудова підбірка лінків курсів та лекцій, якщо ви вирішите працювати в Гуглі.

Technical Development Guide

This guide provides tips and resources to help you develop your technical skills (academically and non-academically) through self-paced, hands-on learning.

This guide is intended to target Computer Science students seeking an internship or university grad role at Google.  Read more of this post

Basic Git commands

in-case-of-fire-1-git-commit-2-git-push-3-leave-building2

Here is a list of some basic Git commands to get you going with Git.
For more detail, check out the Atlassian Git Tutorials for a visual introduction to Git commands and workflows, including examples.

Read more of this post

Abstract class vs Interface (c)JavaRush

fullscreen252520capture252520118201625252051539252520pm-bmp

Java Collections Advanced. Video Lectures

Чудова серія лекцій від Юрія по темам
HashSet и TreeSet
Реализации интерфейса Map
Queue и приоритетная очередь
Многопоточные коллекции
Блокирующая очередь

Відкрити лекції –> Read more of this post

Java Generics Advanced. Video Lectures

Відео Лекції з тем
Сырые типы – Generics
Наследование и расширители обобщений
Рекурсивное расширение типа

Дивитися відео –> Read more of this post

Java Generics & Collections. Video Lectures

Колекції початок. Відео лекції
Теорія та практика

Дивитися відео  Read more of this post

Java Multithreading. Video Lectures.

Multithreading. Відео курс
Deadlock
Неблокирующая синхронизация
Сервис запуска потоков
Синхронизаторы
ThreadLocal

Дивитися відео лекції Read more of this post

Java. Work with DataBases. Videos.

Бази Данних.JDBC

Дивитися відео лекції Read more of this post

JUnit – must have

JUnit Tutorials
1. Java JUnit. Часть 1 — Введение http://javaxblog.ru/article/java-junit-1/

2. Tutorials Point JUnit http://www.tutorialspoint.com/junit/index.htm

JUnit video lectures

Read more of this post

Java Web. Video Lectures.

Выдео лекції по Java web by Sergey Nemchinskyi

Дивитися відео  Read more of this post

Maven. Where to start

1. Apache Maven — основы http://habrahabr.ru/post/77382/

2. Maven — автоматизация сборки проекта http://habrahabr.ru/post/77333/

3. Apache Maven Project http://www.apache-maven.ru/index.html

4. IntelliJ IDEA Getting Started with Maven https://www.jetbrains.com/idea/help/getting-started-with-maven.html

5. Maven Tutorials Point  http://www.tutorialspoint.com/maven/index.htm 

6. Видео Лекции по мавен  Read more of this post

Sorting in Java

In this section we discuss four different ways to sort data in Java.

Arrays of primitives

An array of primitives is sorted by direct invocation of Arrays.sort method

int[] a1 = {3,4,1,5,2,6};
Arrays.sort(a1);

Arrays of objects

In order to sort an array of abstract object, we have to make sure that objects are mutually comparable. The idea of comparable is extension of equals in a sence than we need to know not only that two objects are not equal but which one is larger or smaller. This is supported by the Comparable interface. This interface contains only one method with the following signature:

	public int compareTo(Object obj);

Read more of this post

[ALGO] Quick sort

Quicksort or partition-exchange sort, is a fast sorting algorithm, which is using divide and conquer algorithm. Quicksort first divides a large list into two smaller sub-lists: the low elements and the high elements. Quicksort can then recursively sort the sub-lists.

Steps to implement Quick sort:

1) Choose an element, called pivot, from the list. Generally pivot can be the middle index element.
2) Reorder the list so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it (equal values can go either way). After this partitioning, the pivot is in its final position. This is called the partition operation.
3) Recursively apply the above steps to the sub-list of elements with smaller values and separately the sub-list of elements with greater values.

Read more of this post

[ALGO] Merge Sort

Mergesort

Merge-sort is based on the divide-and-conquer paradigm. It involves the following three steps:

  • Divide the array into two (or more) subarrays
  • Sort each subarray (Conquer)
  • Merge them into one (in a smart way!)

Read more of this post

[ALGO] Insertion Sort

Insertion Sort

To sort unordered list of elements, we remove its entries one at a time and then insert each of them into a sorted part (initially empty):

void insertionSort(int[] ar)
{
   for (int i=1; i ‹ ar.length; i++)
   {
      int index = ar[i]; int j = i;
      while (j > 0 && ar[j-1] > index)
      {
           ar[j] = ar[j-1];
           j--;
      }
      ar[j] = index;
} }

Example. We color a sorted part in green, and an unsorted part in black. Here is an insertion sort step by step. We take an element from unsorted part and compare it with elements in sorted part, moving form right to left. Read more of this post

[ALGO] Selection Sort

Selection Sort

The algorithm works by selecting the smallest unsorted item and then swapping it with the item in the next position to be filled.

The selection sort works as follows: you look through the entire array for the smallest element, once you find it you swap it (the smallest element) with the first element of the array. Then you look for the smallest element in the remaining array (an array without the first element) and swap it with the second element. Then you look for the smallest element in the remaining array (an array without first and second elements) and swap it with the third element, and so on. Here is an example,

void selectionSort(int[] ar){
   for (int i = 0; i ‹ ar.length-1; i++)
   {
      int min = i;
      for (int j = i+1; j ‹ ar.length; j++)
            if (ar[j] ‹ ar[min]) min = j;
      int temp = ar[i];
      ar[i] = ar[min];
      ar[min] = temp;
} }

Example. Read more of this post

[ALGO] Bubble sort

Bubble Sort

  1. The algorithm works by comparing each item in the list with the item next to it, and swapping them if required. In other words, the largest element has bubbled to the top of the array. The algorithm repeats this process until it makes a pass all the way through the list without swapping any items.
void bubbleSort(int ar[])
{
   for (int i = (ar.length - 1); i >= 0; i--)
   {
      for (int j = 1; j ≤ i; j++)
      {
         if (ar[j-1] > ar[j])
         {
              int temp = ar[j-1];
              ar[j-1] = ar[j];
              ar[j] = temp;
   } } } }

Example. Here is one step of the algorithm. The largest element – 7 – is bubbled to the top: Read more of this post

Java Interview. Вопросы и ответы

1. Что такое класс Object? Какие в нем есть методы?
Object это базовый класс для всех остальных объектов в Java. Каждый класс наследуется от Object. Соответственно все классы наследуют методы класса Object.
Методы класса Object:

  • public final native Class getClass()
  • public native int hashCode()
  • public boolean equals(Object obj)
  • protected native Object clone() throws CloneNotSupportedException
  • public String toString()
  • public final native void notify()
  • public final native void notifyAll()
  • public final native void wait(long timeout) throws InterruptedException
  • public final void wait(long timeout, int nanos) throws InterruptedException
  • public final void wait() throws InterruptedException
  • protected void finalize() throws Throwable

Замечание: Для полноты обзора можно сказать, что существует ещё один метод private static native void registerNatives().
Read more of this post