hatefpalizgar

<script>		
  $.ajax({
    url: 'URL',
    type: '',
    cache: false,
    data: {
    //Dữ liệu gửi đi
    },
 success: function(data){

hatefpalizgar

MySQL Cheat Sheet

Help with SQL commands to interact with a MySQL database

MySQL Locations

• Mac /usr/local/mysql/bin
• Windows /Program Files/MySQL/MySQL version/bin
• Xampp /xampp/mysql/bin

Add mysql to your PATH

hatefpalizgar

Chapter 1 - Object Oriented Design

The purpose of design is to allow you to do design later, and it's primary goal is to reduce the cost of change.

SOLID Design:

• Single Responsibility Principle: a class should have only a single responsibility
• Open-Closed Principle: Software entities should be open for extension, but closed for modification (inherit instead of modifying existing classes).
• Liskov Substitution: Objects in a program should be replaceable with instances of their subtypes without altering the correctness of that program.
• Interface Segregation: Many client-specific interfaces are better than one general-purpose interface.

hatefpalizgar

Code is clean if it can be understood easily – by everyone on the team. Clean code can be read and enhanced by a developer other than its original author. With understandability comes readability, changeability, extensibility and maintainability.

---

General rules

1. Follow standard conventions.
2. Keep it simple stupid. Simpler is always better. Reduce complexity as much as possible.
3. Boy scout rule. Leave the campground cleaner than you found it.
4. Always find root cause. Always look for the root cause of a problem.

Design rules

hatefpalizgar

Table Of Contents

• Data Structures
  • Linked Lists
  • Trees
    • Binary Trees
    • Binary Search Tree
    • Red-Black Tree
    • AVL Tree
• Tries

hatefpalizgar

Studying for a Tech Interview Sucks, so Here's a Cheat Sheet to Help

This list is meant to be a both a quick guide and reference for further research into these topics. It's basically a summary of that comp sci course you never took or forgot about, so there's no way it can cover everything in depth. It also will be available as a gist on Github for everyone to edit and add to.

Data Structure Basics

###Array ####Definition:

• Stores data elements based on an sequential, most commonly 0 based, index.
• Based on tuples from set theory.

hatefpalizgar

/*
	QUEUE using array
	0 based indexing
	Save File as Queue.java
*/

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
 

hatefpalizgar

/*
	Linked List
	dynamic memory allocation
	Save File as LinkedMain.java
*/

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

hatefpalizgar

/*
	LINEAR SEARCH
	0 based indexing
	array as iterable
	iterative method
	Save File as LinearSearch.java
*/

import java.io.BufferedReader;
import java.io.IOException;

hatefpalizgar

/*
	MAX MIN in array
	0 based indexing
	Save File as Maxmin.java
*/

class Maxmin_wrapper{
	/* Since java's call by reference needs a reference to a object, this class will be used as a wrapper */
	public int maximum;
	public int minimum;