Create a Responsive Website Using HTML5 and CSS3 

www.leafyishere.nl

CreatineJunk That isn't your website 😂😂

"I am a makeup artist", who the fuck cares?

Well, you cared enough to comment about it.

+Tallis Mcawesome You're awesome! :D

i did but they still dont go to the side :'(

Its still not working....what should I do ?

omg lol, thanks man. I was stuck for a minute!

I am stuck too just as you.

no coalition needed, just don't test on IE and I guarantee it won't work by the end

Html5 is out now, is grew, if you sell non html5 to a company now they won't be happy forever to say the least. All you need to do us to take care about compatibility which is possible and not that hard

if you do not like the tutorial then get lost

@@moswardvunagi5214 😂 what's your issue here ?

Explain to make it simpler

+Sanam Shrestha It just might be his style/way to do things. Different developers code differently :)

@@RahulS-sfdc That's true . But you don't you think is uncessary? And try to code more efficiently instead..

wow youre fabulous!

I just began I hope to get to where you are in a few months time.

Jones Quartey good luck with your journey 🔥

@@nodirbeksharipov458 Thank you

James Davidson

It doesn´t matter :)

Meta tags come first YES

i usely but the meta tags in the head part of the html.

please someone send me this code.i am messed up. email id is angadsmiles@gmail.com

yes. You can style a specific page by adding classes to the body. in Wordpress body classes are dynamically generated for the page that you are on. it displays a variety of different classes such as the page id and/or the template name. this tutorial is not Wordpress but its an example of it being done.

and i need to delete topsidebar margin-top :D ty

+Oleg Milosevic how .top-sidebar got top margin without any css instruction for it like margin-top:2px or something. please reply now its driving me nuts

+Pankaj kumar margin: -2px;

Change the damn px lol 😂

It doesn't crack that often!

Agree, I can't do this any longer! Cya.

His beard is rubbing the microphone or something, otherwise I can't explain it... It's annoying af !!!! Schimba-ti microfonul, maestre, te rog mult! :)

how can i have an email to write to him?

import java.util.LinkedList; import java.lang.reflect.Array; public class UnsortedHashSet { private static final double LOAD_FACTOR_LIMIT = 0.7; private int size; private LinkedList[] con; public UnsortedHashSet() { con = (LinkedList[])(new LinkedList[10]); } public boolean add(E obj) { int oldSize = size; int index = Math.abs(obj.hashCode()) % con.length; if(con[index] == null) con[index] = new LinkedList(); if(!con[index].contains(obj)) { con[index].add(obj); size++; } if(1.0 * size / con.length > LOAD_FACTOR_LIMIT) resize(); return oldSize != size; } private void resize() { UnsortedHashSet temp = new UnsortedHashSet(); temp.con = (LinkedList[])(new LinkedList[con.length * 2 + 1]); for(int i = 0; i < con.length; i++){ if(con[i] != null) for(E e : con[i]) temp.add(e); } con = temp.con; } public int size() { return size; } }

import java.util.LinkedList; import java.lang.reflect.Array; public class UnsortedHashSet { private static final double LOAD_FACTOR_LIMIT = 0.7; private int size; private LinkedList[] con; public UnsortedHashSet() { con = (LinkedList[])(new LinkedList[10]); } public boolean add(E obj) { int oldSize = size; int index = Math.abs(obj.hashCode()) % con.length; if(con[index] == null) con[index] = new LinkedList(); if(!con[index].contains(obj)) { con[index].add(obj); size++; } if(1.0 * size / con.length > LOAD_FACTOR_LIMIT) resize(); return oldSize != size; } private void resize() { UnsortedHashSet temp = new UnsortedHashSet(); temp.con = (LinkedList[])(new LinkedList[con.length * 2 + 1]); for(int i = 0; i < con.length; i++){ if(con[i] != null) for(E e : con[i]) temp.add(e); } con = temp.con; } public int size() { return size; } } import java.util.LinkedList; import java.lang.reflect.Array; public class UnsortedHashSet { private static final double LOAD_FACTOR_LIMIT = 0.7; private int size; private LinkedList[] con; public UnsortedHashSet() { con = (LinkedList[])(new LinkedList[10]); } public boolean add(E obj) { int oldSize = size; int index = Math.abs(obj.hashCode()) % con.length; if(con[index] == null) con[index] = new LinkedList(); if(!con[index].contains(obj)) { con[index].add(obj); size++; } if(1.0 * size / con.length > LOAD_FACTOR_LIMIT) resize(); return oldSize != size; } private void resize() { UnsortedHashSet temp = new UnsortedHashSet(); temp.con = (LinkedList[])(new LinkedList[con.length * 2 + 1]); for(int i = 0; i < con.length; i++){ if(con[i] != null) for(E e : con[i]) temp.add(e); } con = temp.con; } public int size() { return size; } } import java.util.LinkedList; import java.lang.reflect.Array; public class UnsortedHashSet { private static final double LOAD_FACTOR_LIMIT = 0.7; private int size; private LinkedList[] con; public UnsortedHashSet() { con = (LinkedList[])(new LinkedList[10]); } public boolean add(E obj) { int oldSize = size; int index = Math.abs(obj.hashCode()) % con.length; if(con[index] == null) con[index] = new LinkedList(); if(!con[index].contains(obj)) { con[index].add(obj); size++; } if(1.0 * size / con.length > LOAD_FACTOR_LIMIT) resize(); return oldSize != size; } private void resize() { UnsortedHashSet temp = new UnsortedHashSet(); temp.con = (LinkedList[])(new LinkedList[con.length * 2 + 1]); for(int i = 0; i < con.length; i++){ if(con[i] != null) for(E e : con[i]) temp.add(e); } con = temp.con; } public int size() { return size; } } import java.util.LinkedList; import java.lang.reflect.Array; public class UnsortedHashSet { private static final double LOAD_FACTOR_LIMIT = 0.7; private int size; private LinkedList[] con; public UnsortedHashSet() { con = (LinkedList[])(new LinkedList[10]); } public boolean add(E obj) { int oldSize = size; int index = Math.abs(obj.hashCode()) % con.length; if(con[index] == null) con[index] = new LinkedList(); if(!con[index].contains(obj)) { con[index].add(obj); size++; } if(1.0 * size / con.length > LOAD_FACTOR_LIMIT) resize(); return oldSize != size; } private void resize() { UnsortedHashSet temp = new UnsortedHashSet(); temp.con = (LinkedList[])(new LinkedList[con.length * 2 + 1]); for(int i = 0; i < con.length; i++){ if(con[i] != null) for(E e : con[i]) temp.add(e); } con = temp.con; } public int size() { return size; } } import java.util.LinkedList; import java.lang.reflect.Array; public class UnsortedHashSet { private static final double LOAD_FACTOR_LIMIT = 0.7; private int size; private LinkedList[] con; public UnsortedHashSet() { con = (LinkedList[])(new LinkedList[10]); } public boolean add(E obj) { int oldSize = size; int index = Math.abs(obj.hashCode()) % con.length; if(con[index] == null) con[index] = new LinkedList(); if(!con[index].contains(obj)) { con[index].add(obj); size++; } if(1.0 * size / con.length > LOAD_FACTOR_LIMIT) resize(); return oldSize != size; } private void resize() { UnsortedHashSet temp = new UnsortedHashSet(); temp.con = (LinkedList[])(new LinkedList[con.length * 2 + 1]); for(int i = 0; i < con.length; i++){ if(con[i] != null) for(E e : con[i]) temp.add(e); } con = temp.con; } public int size() { return size; } }

+David Aravon Technically this is not so good, I would take a better look for a good tutorial.

So, it shorten it???