woonketwong

CreativeDecorator.java

@Override
        @SneakyThrows
        public void mapBtoA(CreativeDecorated b, Creative a, MappingContext mappingContext) {
        ...
// layout is mandatory for display third party and
            String layoutName = b.getLayout();
            if (isThirdPartyDisplay || isHostedDisplay) {
                if (isCreateOperation) {

woonketwong

<?xml version="1.0" encoding="UTF-8"?>

<VAST version="2.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="oxml.xsd">
	<Ad id="1">
		<InLine>
			<AdSystem version="1.0">Adap.tv</AdSystem>

			<AdTitle><![CDATA[Adap.tv Ad Unit]]></AdTitle>

			<Impression>			</Impression>

woonketwong

function findLocalMin(array, start, end){
    var mid = Math.floor( (start + end)/2 );
    
    if (((mid - 1) < 0) || ((mid + 1) >= array.length)) return null;
    
    if (array[mid - 2] > array[mid - 1] && array[mid - 1] < array[mid]){
        return array[mid-1];
    } else if ( (array[mid-1] >= array[mid-2])){
        return findLocalMin(array, start, mid);
    } else {

woonketwong

function breadthFirstSearch(node){
    
    // build a queue
    var q = [];
    
    // initialize q
    q.push(node);
    
    var currentNode = null;
    

woonketwong

function depthFirstSearch(node){
    if (node === null) return;
    
    // visit node
    console.log(node.value);
    node.visited = true;
    
    for (var i = 0; i < node.children.length; i++){
        if (node.children[i].visited === false){
            depthFirstSearch(node.children[i]);

woonketwong

function quickSort(array, start, end){

   var leftIndex = partition(array, start, end);
   
   if (start < leftIndex-1){
       quickSort(array, start, leftIndex-1);
   }
   
   if (start > leftIndex){
       quickSort(array, leftIndex, end);

woonketwong

function covers(root, node){
    if (root === null ) return false;
    if (root === node ) return true;
    return covers(root.left, node) || covers(root.right, node);
}

function commonAncestorHelper(root, node1, node2){
    if (root === null ) return false;
    if (root === node1 || root === node2 ) return root;
    

woonketwong

function createMinimalBST(array, start, end){
    if (end < start){
        return null;
    }   
    
    var mid = Math.floor( (start + end) / 2 );
    
    var node = {val: array[mid], left: null, right: null};
    node.left = createMinimalBST(array, start, mid-1);
    node.right = createMinimalBST(array, mid+1, end);

woonketwong

function containTrees(tree1, tree2){
  if (tree2 === null){
      return true;
  }
  
  return subTree(tree1, tree2);
}

function subTree(tree1, tree2){

woonketwong

function checkBST(node){

  lastVisited = null;

  function checkBSTRecurse (node){
      if (node === null) return true;
    
      if ( !checkBSTRecurse(node.left) ) return false;
    
      if (node.val < lastVisited) return false;