“Life is not a race, but a journey to be savoured each step of the way” by Brian Dyson
ns-3 configuration and ofswitch13 module - Tutorial
I had deployed the ns-3 simulation with ofswitch13 successfully. I've been struggling to solve the simulation platform a lot of time. So, my experience is quite valuable and self-giving sharing for the ns-3 beginners.
The following procedure can be deployed on VMware/Virtual machine or cloud instance.
If your want to know how to deploy ns-3 on remote cloud instance easily, I will post an article to demonstrate full steps.
Tutorial - Google Chrome Web Browser in Ubuntu
If you are working on the Ubuntu environment and not used to using FireFox browser, Google Chrome maybe is your first choice.
Here, I shared my experience of installing Google Chrome on Ubuntu 16.04. You can implement it rapidly and easily.
Let coding interview become easy - Find second largest element
Maybe you will face it problem when you have an interview for a job with Tech. company.
The problem is "How to find second largest element?", it seems very easy to get result, but you must propose an efficient approach.
107. Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
104. Maximum Depth of Binary Tree
Given the root of a binary tree, return its maximum depth.
A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
101. Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
100. Same Tree
Given the roots of two binary trees p and q, write a function to check if they are the same or not.
Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.88. Merge Sorted Array
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note:
83. Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once.
70. Climbing Stairs
You are climbing a staircase. It takes n steps to reach the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?