| html, | |
| body { | |
| height: 100%; | |
| background-color: #ffffff; | |
| font-family: 'Open Sans','Sans-serif'; | |
| } | |
| .container { | |
| position: relative; | |
| border-radius: 30px; | |
| height: 90%; |
| # Definition for a binary tree node. | |
| class TreeNode: | |
| def __init__(self, x): | |
| self.val = x | |
| self.left = None | |
| self.right = None | |
| class Solution: | |
| def inorderTraversal(self, root: TreeNode) -> List[int]: | |
| l = [] |
| starting zookeeper: | |
| bin\windows\zookeeper-server-start.bat .\config\zookeeper.properties | |
| starting Kafka on root folder: | |
| bin\windows\kafka-server-start.bat .\config\server.properties | |
| start a topic in bin\windows: | |
| kafka-topics.bat --create --zookeeper localhost:2181 --replication-factor 1 --partitions 1 --topic test | |
| start producer: |
| /* | |
| A UniValued Binary Tree is a tree that has only 1 value for all its node. If its not return false; | |
| */ | |
| class Solution { | |
| public boolean isEqual(TreeNode root, TreeNode n){ | |
| if(n == null){ | |
| return true; | |
| } | |
| if(root.val != n.val){ |
| class Solution { | |
| public int removeDuplicates(int[] nums) { | |
| //if the list is empty return 1. | |
| if(nums.length == 0) return 0; | |
| //Fast Pointer. | |
| int j = 0; | |
| //to maintain the length. | |
| int count = 1; | |
| //Looping through the array: | |
| for(int i = 0; i < nums.length; i++) |
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.
###Array ####Definition:
