{
  "block": 106145453,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "5703.333938 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2026-05-18T01:55:57",
  "trx_id": "140ca1868b93a384e814731135327d4a6b2ce5c4",
  "trx_in_block": 2,
  "virtual_op": 0
}

{
  "block": 105983880,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "2991.123533 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2026-05-12T10:39:42",
  "trx_id": "40119d91eb37a8b1e8596e78e77631fcd257ef56",
  "trx_in_block": 0,
  "virtual_op": 0
}

{
  "block": 105513056,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "5715.849694 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2026-04-26T01:14:09",
  "trx_id": "72f8b01eaf5ea9fd8c09bcd875663d7706aaf061",
  "trx_in_block": 0,
  "virtual_op": 0
}

{
  "block": 102857215,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "3032.670352 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2026-01-23T12:18:39",
  "trx_id": "48a29cf437731b9de6cf4e1034110b132991f0bb",
  "trx_in_block": 1,
  "virtual_op": 0
}

{
  "block": 91303565,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "3196.889549 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2024-12-17T07:35:21",
  "trx_id": "26f2ac5ebfeaf9966bf61189989cb8116e155b3c",
  "trx_in_block": 2,
  "virtual_op": 0
}

{
  "block": 79857751,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "3366.023081 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2023-11-13T23:17:24",
  "trx_id": "4e8dfb94417cc92d74cb8d64141bb486343499ab",
  "trx_in_block": 2,
  "virtual_op": 0
}

{
  "block": 78350203,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "6303.301867 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2023-09-21T23:48:48",
  "trx_id": "7727a5502f80cadc0177fb0b8e67cd7ec0b25627",
  "trx_in_block": 1,
  "virtual_op": 0
}

{
  "block": 69115227,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "6524.983305 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2022-11-03T13:21:00",
  "trx_id": "72c536df3586ead1bb1bf56b732ee36e6b662764",
  "trx_in_block": 0,
  "virtual_op": 0
}

{
  "block": 60816320,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "6745.218441 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2022-01-17T16:44:27",
  "trx_id": "5e3fe470b13440f4b6c22ae12d2008c2ecb5ffa0",
  "trx_in_block": 9,
  "virtual_op": 0
}

{
  "block": 54609531,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "6929.285194 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2021-06-14T02:19:48",
  "trx_id": "a280524f563e7f0292112dac8d52304b759aeffb",
  "trx_in_block": 4,
  "virtual_op": 0
}

{
  "block": 49356929,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "7116.707168 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2020-12-11T12:36:33",
  "trx_id": "ba7f2b443cbcba5f8c6c3de0fc7efef813109f9a",
  "trx_in_block": 8,
  "virtual_op": 0
}

{
  "block": 49208485,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "1912.543513 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2020-12-06T06:13:21",
  "trx_id": "6f0cacc50288f8610569ba22bad980969f1e6849",
  "trx_in_block": 1,
  "virtual_op": 0
}

{
  "block": 49192027,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "7122.915022 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2020-12-05T16:14:45",
  "trx_id": "c72ddff08ed8d41ff3d18dce43aaa9be3abb1f4f",
  "trx_in_block": 0,
  "virtual_op": 0
}

{
  "block": 48261407,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "1920.017158 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2020-11-02T18:41:54",
  "trx_id": "b5fb2a06bce82c5114d2256b0e42398e8f38768f",
  "trx_in_block": 1,
  "virtual_op": 0
}

{
  "block": 43218751,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "7325.720381 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2020-05-09T07:12:12",
  "trx_id": "f80a67c9009e38c0c0a4a4573b767d46aca65650",
  "trx_in_block": 12,
  "virtual_op": 0
}

{
  "block": 43195106,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "1953.311140 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2020-05-08T11:01:39",
  "trx_id": "9dce3f4b9c1dfc7cf0b326136debf3e87badfb07",
  "trx_in_block": 11,
  "virtual_op": 0
}

{
  "block": 42081791,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "7347.355091 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2020-03-29T20:28:06",
  "trx_id": "f947cc1c5357b538c63b90d0bb9cfc38d7e68b81",
  "trx_in_block": 19,
  "virtual_op": 0
}

{
  "block": 37513995,
  "op": [
    "comment",
    {
      "author": "steemitboard",
      "body": "Congratulations @jkazuto! You received a personal award!\n\n<table><tr><td>https://steemitimages.com/70x70/http://steemitboard.com/@jkazuto/birthday2.png</td><td>Happy Birthday! - You are on the Steem blockchain for 2 years!</td></tr></table>\n\n<sub>_You can view [your badges on your Steem Board](https://steemitboard.com/@jkazuto) and compare to others on the [Steem Ranking](https://steemitboard.com/ranking/index.php?name=jkazuto)_</sub>\n\n\n**Do not miss the last post from @steemitboard:**\n<table><tr><td><a href=\"https://steemit.com/steemfest/@steemitboard/steemfest-commemorative-badge-refactored\"><img src=\"https://steemitimages.com/64x128/https://files.steempeak.com/file/steempeak/arcange/YqQV5Tbj-image.png\"></a></td><td><a href=\"https://steemit.com/steemfest/@steemitboard/steemfest-commemorative-badge-refactored\">SteemFest⁴  commemorative badge refactored</a></td></tr></table>\n\n###### [Vote for @Steemitboard as a witness](https://v2.steemconnect.com/sign/account-witness-vote?witness=steemitboard&approve=1) to get one more award and increased upvotes!",
      "json_metadata": "{\"image\":[\"https://steemitboard.com/img/notify.png\"]}",
      "parent_author": "jkazuto",
      "parent_permlink": "i-m-at-the-worst-part-in-my-life-please-i-really-need-your-help",
      "permlink": "steemitboard-notify-jkazuto-20191022t185336000z",
      "title": ""
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-10-22T18:53:36",
  "trx_id": "27eaec879d0c664a370924ac831b6793263b676c",
  "trx_in_block": 5,
  "virtual_op": 0
}

{
  "block": 32411532,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "7543.151664 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-04-27T13:04:12",
  "trx_id": "473aeab62531b0c1ad90eca7df1eb5a3209a2c2c",
  "trx_in_block": 14,
  "virtual_op": 0
}

{
  "block": 30669664,
  "op": [
    "comment",
    {
      "author": "partiko",
      "body": "Hello @jkazuto! This is a friendly reminder that you have 3000 Partiko Points unclaimed in your Partiko account!\n\nPartiko is a fast and beautiful mobile app for Steem, and it’s the most popular Steem mobile app out there! Download Partiko using the link below and login using SteemConnect to claim your 3000 Partiko points! You can easily convert them into Steem token!\n\nhttps://partiko.app/referral/partiko",
      "json_metadata": "{\"app\":\"partiko\"}",
      "parent_author": "jkazuto",
      "parent_permlink": "i-m-at-the-worst-part-in-my-life-please-i-really-need-your-help",
      "permlink": "partiko-re-jkazuto-i-m-at-the-worst-part-in-my-life-please-i-really-need-your-help-20190225t231706099z",
      "title": ""
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-02-25T23:17:06",
  "trx_id": "b9b8f1af536787d617d9c4d981c2cef026f776c6",
  "trx_in_block": 27,
  "virtual_op": 0
}

{
  "block": 29964443,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "...",
      "json_metadata": "{\"tags\":[\"life\"],\"image\":[\"https://cdn.steemitimages.com/DQmZMS4mn5eRtrvnS1Y7Tu4YjP4zAKL6U9dZmaP2wFN9nW3/IMG_20180604_135456.jpg\"],\"app\":\"esteem/2.0.0-mobile\",\"format\":\"markdown+html\",\"community\":\"esteem.app\"}",
      "parent_author": "",
      "parent_permlink": "life",
      "permlink": "i-m-at-the-worst-part-in-my-life-please-i-really-need-your-help",
      "title": "..."
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-02-01T11:07:12",
  "trx_id": "5786a42872043522dcafd39f85de07080e4eb915",
  "trx_in_block": 28,
  "virtual_op": 0
}

{
  "block": 29866919,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "i-m-at-the-worst-part-in-my-life-please-i-really-need-your-help",
      "voter": "nainamata",
      "weight": 10000
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-29T01:47:54",
  "trx_id": "b9db4c32f43358e0c5ce009783d4530f0874a149",
  "trx_in_block": 13,
  "virtual_op": 0
}

{
  "block": 29825402,
  "op": [
    "transfer",
    {
      "amount": "0.001 SBD",
      "from": "crypto-n-custard",
      "memo": "Get a 0.1-0.5 SBD upvote and resteem - Send 0.25 SBD or STEEM to @crypto-n-custard, put your post's url in the memo - Upvote covers your costs - Have a great day and follow us for more promotional specials",
      "to": "jkazuto"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-27T15:09:45",
  "trx_id": "b341cc99b6ae051d4346b17cf261989889c1b159",
  "trx_in_block": 44,
  "virtual_op": 0
}

{
  "block": 29792423,
  "op": [
    "transfer",
    {
      "amount": "0.001 STEEM",
      "from": "raise-me-up",
      "memo": "Now more than 33,000+ Followers! Promote your new post with the biggest resteem service @raise-me-up. Send 1 SBD/1.5 STEEM or more. Invest in your account to succeed! Find new friends/voters who will vote your posts daily. Put post's url in memo and @raise-me-up will resteem your post + 100% upvote. Weekly subscribe 6 SBD or 8 STEEM. 365 days Active.[Return 'stop' as memo if you don't want to receive message like this.]",
      "to": "jkazuto"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-26T11:38:39",
  "trx_id": "74ec23d0c5b427536a01ae64ffa6137f14b3d7ad",
  "trx_in_block": 15,
  "virtual_op": 0
}

{
  "block": 29792422,
  "op": [
    "transfer",
    {
      "amount": "0.001 STEEM",
      "from": "obaku",
      "memo": "This is small gift from me. Share your post with more than 13.000+ followers and get 50+ upvote from me and my followers. The price is 0.7 SBD / 0.8 STEEM. ",
      "to": "jkazuto"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-26T11:38:36",
  "trx_id": "c9a66e28e952e20e34901fd07581dd1ed53e1a09",
  "trx_in_block": 16,
  "virtual_op": 0
}

{
  "block": 29792312,
  "op": [
    "transfer",
    {
      "amount": "0.600 SBD",
      "from": "jkazuto",
      "memo": "@jkazuto/i-m-at-the-worst-part-in-my-life-please-i-really-need-your-help",
      "to": "null"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-26T11:33:06",
  "trx_id": "262d28ccc5383b724cdc3a39c10624b6d828d419",
  "trx_in_block": 21,
  "virtual_op": 0
}

{
  "block": 29792167,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "i-m-at-the-worst-part-in-my-life-please-i-really-need-your-help",
      "voter": "jkazuto",
      "weight": 10000
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-26T11:25:51",
  "trx_id": "4f3bc1a27875c91746072878b290416945fbf85e",
  "trx_in_block": 8,
  "virtual_op": 0
}

{
  "block": 29792040,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "![IMG_20180604_135456.jpg](https://cdn.steemitimages.com/DQmZMS4mn5eRtrvnS1Y7Tu4YjP4zAKL6U9dZmaP2wFN9nW3/IMG_20180604_135456.jpg)\n\nCompletely broken, undergraduate, no job, diagnosed with Pulmonary Tuberculosis(PTB), broken family I must say and have a rude attitude step-grandfather. It sound ridiculous and unrealistic right? I know but damn that's my current life is. Our family timeline is like gaussian distribution, it started from low and hard life then rises to the peek where everything is good and happy, and falls down as quickly as jumping from the top of the mountain head first.\n\nSo you probably asking why and what happened, it all began with my father being unfaithful to my mother, my mother finds out he has many girls so the war begins, my mother wants to move to our grandmother's house leaving our father alone and I'm on my 12th grade that time and things are not going pretty well. My mother losed weight because of stress our family is facing, I am a late enrollee in my 3rd semester because of financial problem, and our electrical has been disconnected due to unpaid bills that we can't pay anymore because of too many debts. Fast forward to the current situation, With the help of my auntie on my father-side financially I've graduated from Senior high and I'm so happy about that! But we can't beg for another help financially and we will never do ask for it anymore too. Right now we, my mother, me and my little brother moved here in Calamba and are living in our old and own small house. My father and old brother stayed where we used to lived before because of my brother's work there, he can't go far from his working place, and my father... He's a damn lazy ass avoiding his responsibility as a father to us. Many months have passed since we left and he can't even give us the support, the maintenance and the financial that we need for our daily lives. He is a tricycle driver, he earn less than a normal salary of an average person but that doesn't mean he will forget about us, his family.\n\nDecember 2018 I've been diagnosed with PTB, I've losed weight and very skinny. Fortunately there is a free health medication for tuberculosis supported by the department of health so we didn't spend any money at all for my medicine. It is a 6 month medication so that's why I didn't enrolled to college. While I was in medication I keep on studying about programming little by little using my mobile phone, many months focusing on javascript language since I only need a browser and a text editor on it. I don't want to waste this whole year doing nothing and I really want to be a programmer and a game developer so I'll do anything to make it happen not just for me but I can help my family too if I have a decent job in the future. Though its still not enough, I can't do much more than a display in canvas on my phone. There is no good game engine that can be installed on a phone for game developing, I wish I have a laptop to start exploring the game developing side, like Unity, Godot, or Unreal. Some people believes that you can be a successful person even if you are poor if you pursue your dream and is hardworking, what I think is you need money to earn more money. What I mean is I am a programmer, a programmer needs a computer, my knowledge is useless if I cannot used it at all. I'm not qualified for work since I don't have work experience and because of my health issue but I can still earn money by publishing a game or an app with an ads in it on playstore, but guess what, developer license is not free!\n\nMy mother is jobless too unfortunately, she only finished 5th grade. So how come we are still alive if we are financially broken? Its because of our step-grandfather and grandmother, they don't have a proper work too so they only beg beside the church here in Calamba. They are beggars and penhandlers. We live because of money that came from begging.\n\nAs time passes by, my grandparents are showing signs that we are a burden to them, a waste of money. Especially the way they treat me, they think of me as useless piece of trash since I can't do any work because of my PTB, they are blaming that all I do is staring at my mobile phone yet what I'm doing is learning and studying, they didn't understand it at all! I wish I can prove to them that I'm useful but then a phone can't do any better than for learning stuff as a programmer.\n\nMy grandparents are planning to rent a new house only for them so when that happened, I don't know now what will happen to us after that.\n\nI don't want this to be so long so if you have anymore to ask feel free to say it and I'm willingly answer it, I don't have anyone to share what's on my chest all along and I feel a little bit better sharing this to you, if anyone is actually interested on reading this then what should we do? I need help to be honest, and any help will do!",
      "json_metadata": "{\"tags\":[\"life\",\"health\",\"help\",\"poverty\"],\"image\":[\"https://cdn.steemitimages.com/DQmZMS4mn5eRtrvnS1Y7Tu4YjP4zAKL6U9dZmaP2wFN9nW3/IMG_20180604_135456.jpg\"],\"app\":\"steemit/0.1\",\"format\":\"markdown\"}",
      "parent_author": "",
      "parent_permlink": "life",
      "permlink": "i-m-at-the-worst-part-in-my-life-please-i-really-need-your-help",
      "title": "I'M AT THE WORST PART IN MY LIFE PLEASE I REALLY NEED YOUR HELP!"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-26T11:19:30",
  "trx_id": "6fca851e6f522ca32f26f02c2b71aff4d07110b8",
  "trx_in_block": 4,
  "virtual_op": 0
}

{
  "block": 29762391,
  "op": [
    "account_witness_vote",
    {
      "account": "jkazuto",
      "approve": true,
      "witness": "isnochys"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-25T10:36:06",
  "trx_id": "fbcce81bd67a68b20d4f3a590d8bee53374f138e",
  "trx_in_block": 8,
  "virtual_op": 0
}

{
  "block": 29762100,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "@@ -6654,8 +6654,254 @@\n  upvote!\n+%0A%0APART 2: %5Bhttps://steemit.com/programming/@jkazuto/custom-variant-and-optimization-of-depth-first-search-maze-algorithm-part-2%5D(https://steemit.com/programming/@jkazuto/custom-variant-and-optimization-of-depth-first-search-maze-algorithm-part-2)\n",
      "json_metadata": "{\"tags\":[\"programming\",\"maze\",\"depth-first\",\"javascript\",\"mobile\"],\"image\":[\"https://img.esteem.ws/cdx8ox80i9.gif\",\"https://img.esteem.ws/wsn2j4d5ku.gif\",\"https://img.esteem.ws/bxjqfh3nvt.gif\",\"https://img.esteem.ws/nmetb2a7rk.gif\",\"https://img.esteem.ws/i22drukyu8.gif\",\"https://cdn.steemitimages.com/DQmQygLB544CgkmPucgvgdZVjWUjAjFRBeuir2CXb3YYe7b/20190125_100731.gif\"],\"links\":[\"https://youtu.be/HyK_Q5rrcr4\",\"https://en.wikipedia.org/wiki/Maze_generation_algorithm\",\"https://steemit.com/programming/@jkazuto/custom-variant-and-optimization-of-depth-first-search-maze-algorithm-part-2\"],\"app\":\"steemit/0.1\",\"format\":\"markdown\"}",
      "parent_author": "",
      "parent_permlink": "programming",
      "permlink": "custom-variant-and-optimization-of-depth-first-search-maze-algorithm",
      "title": "Custom variant and optimization of depth-first search maze algorithm part 1"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-25T10:21:30",
  "trx_id": "8d002f4316f396a73352b4f98f3be61e37c341fa",
  "trx_in_block": 14,
  "virtual_op": 0
}

{
  "block": 29762081,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "Hello World! Its been a long time since my last visit here and lots of thing have happened while I'm gone but enough of the talk and lets get to the real topic.\n\nSo for the last few days I've been watching many Coding Train videos on YouTube to know more things about programming especially in javascript, then I stumbled upon one [video]( https://youtu.be/HyK_Q5rrcr4) of creating a maze on processing framework using depth-first search algorithm and I enjoy watching it so I made one myself.\n\n![cdx8ox80i9.gif](https://img.esteem.ws/cdx8ox80i9.gif)\n\nThe GIF you see above is the depth-first search algorithm creating a maze. So what is depth-first search maze generation?\n\nAs stated on [Wikipedia](https://en.wikipedia.org/wiki/Maze_generation_algorithm),\n> This algorithm is a randomized version of the depth-first search algorithm. Frequently implemented with a stack, this approach is one of the simplest ways to generate a maze using a computer. Consider the space for a maze being a large grid of cells (like a large chess board), each cell starting with four walls. Starting from a random cell, the computer then selects a random neighbouring cell that has not yet been visited. The computer removes the wall between the two cells and marks the new cell as visited, and adds it to the stack to facilitate backtracking. The computer continues this process, with a cell that has no unvisited neighbours being considered a dead-end. When at a dead-end it backtracks through the path until it reaches a cell with an unvisited neighbour, continuing the path generation by visiting this new, unvisited cell (creating a new junction). This process continues until every cell has been visited, causing the computer to backtrack all the way back to the beginning cell. We can be sure every cell is visited.\n\n--- \n\nMost of you probably didn't read all of it so here is the general instruction of depth-first search algorithm:\n1. Make the initial cell the current cell and mark it as visited\n2. While there are unvisited cells\n\t1. If the current cell has any neighbours which have not been visited\n\t\t1. Choose randomly one of the unvisited neighbours\n\t\t2. Push the current cell to the stack\n\t\t3. Remove the wall between the current cell and the chosen cell\n\t\t4. Make the chosen cell the current cell and mark it as visited\n\t2. Else if stack is not empty\n\t\t1. Pop a cell from the stack\n\t\t2. Make it the current cell\n\n![wsn2j4d5ku.gif](https://img.esteem.ws/wsn2j4d5ku.gif)\n\n> Visualization of the above instruction\n* Brown cells are the visited cells\n* Peach cells are all unvisited cells\n* Maroon cell is the current cell\n* Blue cell is the next cell to visit\n* Green cells are other available neighbor cells\n\n---\nThe noticeable problem with this algorithm is that you can't choose your own exit cell because it always look for possible cell to visit anywhere. Commonly the exit cell of this algorithm is the longest path, like for the example above the exit cell is on the 2nd column on the 5th row. What I want is to have the starting cell on the top left corner of the room and the exit cell is on the bottom right corner.\n\nSo what I did was simple, I've created two maze generator in one single room, one for the starting cell and one for the exit cell;\n\n![bxjqfh3nvt.gif](https://img.esteem.ws/bxjqfh3nvt.gif)\n\nProblem has now been solved, I can set the starting and exit cell anywhere I want with two maze generator. But a new problem has been arised, the two random mazes in this room are not connnected to each other, so we need a way to make them a one single maze. \n\nThis is what I've come up:\n1. Loop through every cell in the first maze\n\t1. If this cell is adjacent to the cell of the second maze\n\t\t- Add this cell to the stack\n2. Randomly pick a cell from the stack\n3. Remove the wall between this cell and its adjacent cell\n\n---\n\n![nmetb2a7rk.gif](https://img.esteem.ws/nmetb2a7rk.gif)\n\nSo there you go! My customized depth-first search algorithm! But wait, we're not done yet! There is still one more thing that bothers me with this algorithm. Its the way that most of the time it creates a long corridor until it found a dead end, means there are chances that it will generate a less branches of paths with long corridors but what I want is more branches with a decent length of corridors per branches. A simple way to fix it is by creating a step counter that increments every time a current cell visited a new cell then once we reached a maximum step, we will go back to the previous visited cell nth times and resetting the step counter back to zero.\n\n\n\n![i22drukyu8.gif](https://img.esteem.ws/i22drukyu8.gif)\n> Maximum of 10 steps before going back by 5 steps\n\nAs you can see above, even if there is a cell to visit, once it reaches a maximum of 10 steps it will backtrack 5 times and will start looking for another path to go. Finding the right maximum steps is the key for making hard random mazes.\n\nAnd thats all for my own customized Depth-first search maze generator! Nothing fancy and anyone can do even better than this too.\n\n## TL;DR\nA custom variation of Depth-first search consisting of two mazes in one room merged into one single big maze. One maze is initialized as starting cell and the second maze is initialized as the exit cell, both of them can be set anywhere in a room, in my example the starting cell is at the top left corner of the room and the exit cell is at the bottom right corner. The depth-first search is known to have a lot of long corridors but in this variation you can set the maximum length of corridor before it backtracks and find another branch of paths.\n\nThe algorithm is the same as the original depth-first but with the addition of new a condition maximum steps before visiting a new cell, if its steps are greater than the maximum step then go backtrack nth times as specified by the user then reset the step counter to zero.\n\nTo merge two mazes as one, the program will loop into all of the cells within the first maze and if that cell is adjacent or next to a cell within the second maze then remove a wall from this cell and its adjacent cell from the second maze. This need to be run onced to prevent a looping maze. \n\n![20190125_100731.gif](https://cdn.steemitimages.com/DQmQygLB544CgkmPucgvgdZVjWUjAjFRBeuir2CXb3YYe7b/20190125_100731.gif)\n> 91x41 cells with a 132 maximum steps, checking 60 cells per frame.\n\nI am not really good on explaining things and stuffs so if you have any feedbacks feel free to comment it out below. Also the source code and the explanation of my codes in javascript language will be on my next blog so stay tuned and if you like this idea feel free to share and upvote!",
      "json_metadata": "{\"tags\":[\"programming\",\"maze\",\"depth-first\",\"javascript\",\"mobile\"],\"image\":[\"https://img.esteem.ws/cdx8ox80i9.gif\",\"https://img.esteem.ws/wsn2j4d5ku.gif\",\"https://img.esteem.ws/bxjqfh3nvt.gif\",\"https://img.esteem.ws/nmetb2a7rk.gif\",\"https://img.esteem.ws/i22drukyu8.gif\",\"https://cdn.steemitimages.com/DQmQygLB544CgkmPucgvgdZVjWUjAjFRBeuir2CXb3YYe7b/20190125_100731.gif\"],\"links\":[\"https://youtu.be/HyK_Q5rrcr4\",\"https://en.wikipedia.org/wiki/Maze_generation_algorithm\"],\"app\":\"steemit/0.1\",\"format\":\"markdown\"}",
      "parent_author": "",
      "parent_permlink": "programming",
      "permlink": "custom-variant-and-optimization-of-depth-first-search-maze-algorithm",
      "title": "Custom variant and optimization of depth-first search maze algorithm part 1"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-25T10:20:33",
  "trx_id": "ce6cd35424bd805ecb8987e16ea8a3b1502d167f",
  "trx_in_block": 32,
  "virtual_op": 0
}

{
  "block": 29762075,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "custom-variant-and-optimization-of-depth-first-search-maze-algorithm-part-2",
      "voter": "microbot",
      "weight": 500
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-25T10:20:15",
  "trx_id": "e176187e1014a1fef5aeb7e4b15b2711ca5f0f7d",
  "trx_in_block": 7,
  "virtual_op": 0
}

{
  "block": 29762035,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "This is the link for the part 1 if you're interested:\n[https://steemit.com/programming/@jkazuto/custom-variant-and-optimization-of-depth-first-search-maze-algorithm](https://steemit.com/programming/@jkazuto/custom-variant-and-optimization-of-depth-first-search-maze-algorithm)\n\n![20190125_163319.gif](https://cdn.steemitimages.com/DQmdoSXbSagLb4EieYPftUV42mG9g1nDafbSfNxNxdnQbB3/20190125_163319.gif)\n\nIn this post we will explore the code behind my simple variant of depth-first search which was made with javascript and [p5js](http://p5js.org) framework for rendering in canvas.\n\n1. [Variables](#variables)\n2. [setup()](#setup)\n3. [draw()](#draw)\n4. [depthFirst()](#depthfirst)\n   a. [this.start()](#dfstart)\n   b. [this.run()](#dfrun)\n   c. [this.merge()](#dfmerge)\n\nYou can download the source code here: [https://github.com/jepsuCoded/Optimized-Depth-first-Search-Maze-Algorithm](https://github.com/jepsuCoded/Optimized-Depth-first-Search-Maze-Algorithm)\n\n## What I've used\n- Javascript\n- [p5js](p5js.org)\n- Spck Editor (Android App)\n\n---\n\n<h2 id=\"variables\">Variables</h2>\nGlobal variables before the setup <br>\n\n---\n\ncellX is the number of cells in the x-axis and cellY in the y-axis\n`let cellX = 91, cellY = 41;`\n<br>\nThe size of each cells\n`let s = 7;`\n<br>\nMaximum steps before backtracking\n`let maxStep = cellX+cellY;`\n<br>\nNumbers of cell to check per frame\n`let cycle = 60;`\n<br>\nStroke weight of the cell walls\n`let strokeSize = 1;`\n<br>\nColor variables for displaying\nFORMAT: [Red, Green, Blue, Alpha];\n```\nlet bg = [60, 47, 47, 255];\nlet color_cellWalls = [255, 244, 230, 255];\nlet color_movingCell = [133, 68, 66, 255];\nlet color_unvisited = [190, 155, 123, 255];\n```\n<br>\nOther variables that must not be touched\n```\nlet _width = s*cellX, _height = s*cellY;\nlet grid = [];\nlet cols, rows;\nlet startPos;\nlet endPos;\n```\n\n<br>\n\n<h2 id=\"setup\">Setup</h2>\nThis setup function is part of the p5js and will run once, upon starting the javascript file.\n\n---\n\nIn this setup function, \n1. The canvas will be created based on the computed width and height. \n2. All of the cell will be created and stored in a one dimensional array list called grid.\n3. Create two algorithms/maze runner, one for the starting cell and one for the exit cell.\n\n```\nfunction setup() {\n  createCanvas(_width, _height);\n  \n  cols = floor(width/floor(width/cellX));\n  rows = floor(height/floor(height/cellY));\n  \n  // Initialized all cells in an array called grid\n  for (let j = 0; j < rows; j++) {\n    for (let i = 0; i < cols; i++) {\n      grid.push(new Cell(i, j));\n    }\n  }\n  \n  // First maze generator\n  startPos = new depthFirst();\n  // This is the starting cell\n  startPos.start(grid[0], \"start\");\n  \n  // Second maze generator\n  endPos = new depthFirst();\n  // This is the ending cell\n  endPos.start(grid[grid.length-1], \"end\");\n}\n```\n\n<br>\n\n<h2 id=\"draw\">Draw</h2>\nThe draw function is also part of the p5js and will run a set of frames per second.\n\n---\n\nIn this draw function,\n1. If one of the two maze runners is not yet finished\n   1. Draw each walls of all the cells\n   2. Loop for `cycle` times and run the algorithm for two maze runners\n2. If all of the cells are visited and are done running\n   1. Connect the two maze together to create one whole maze\n   2. Draw everything again\n   3. Stop this function, forever\n\n```\nfunction draw() {\n  if (startPos.done === 0 || endPos.done === 0) {\n    // Draw every cells per frame\n    background(bg[0], bg[1], bg[2], bg[3]);\n    grid.forEach(item => item.show());\n    \n    // For every cycle per frame\n    for(let i = 0; i < cycle; i++) {\n      // Run the depth-first search algorithm\n      startPos.run();\n      endPos.run();\n    }\n  }\n  // If everything is done and all cells are visited\n  else if (startPos.done === 1 && endPos.done === 1) {\n    // Combine two generated mazes\n    startPos.merge(endPos);\n    \n    // Draw every frame\n    background(bg[0], bg[1], bg[2], bg[3]);\n    grid.forEach(item => item.show());\n  }\n}\n```\n\n<h2 id=\"depthfirst\">DepthFirst</h2>\nThis is where the algorithm run everytime the `run()` function begins\n\n---\n\nThe top part of this function is the declaration of variables.\n\n```\nfunction depthFirst() {\n  \n  // Group of cells\n  this.group;\n  \n  // List of visited cells used for backtracking\n  this.stack = [];\n  \n  // List of all visited cell used for merge function\n  this.track = [];\n  \n  // Current position of running cell\n  this.pos;\n  \n  // Starting cell\n  this.startPos;\n  \n  this.done = 0;\n  \n  // Current steps made\n  this.steps = 0;\n\n  // . . .\n}\n```\n\n\n\n\n<h3 id=\"dfstart\">DepthFirst.start()</h3>\n\n```\n// Initialization\n  this.start = function(pos, name) {\n    this.pos = pos;\n    this.startPos = pos;\n    this.stack.push(pos);\n    this.group = name;\n  };\n```\n\n\n\n<h3 id=\"dfrun\">DepthFirst.run()</h3>\n1. Store all unvisited neighbor cells in the `unvisited` array variable\n2. Set this current cell as visited\n3. If the steps are greater than the maximum step\n   1. Reset `this.steps` to zero\n   2. Backtrack `maxStep/2` times\n4. Else Pick a random cell in `unvisited`\n   1. Store that cell to the `next` variable\n   2. Add that cell to the group maze\n   3. Remove wall between the current cell and the `next` cell\n   4. Set this cell to `next` cell\n   5. Push this cell to the `stack` and `tracks`\n   6. Increment `this.steps`\n5. Else if there is no available cell to visit\n   1. Decrement `this.steps`\n   2. Backtrack one step\n   3. Pop the `stack`\n6. Else set `done` to 1 since there is no more cell to visit\n```\n// Start the algorithm\n  this.run = function() {\n    \n    // If not done then proceed\n    if(this.done === 0) {\n      // Draw current position of running cell\n      fill(color_movingCell[0], color_movingCell[1], color_movingCell[2], color_movingCell[3]);\n      noStroke();\n      rect(this.pos.a*s, this.pos.b*s, s, s);\n      \n      // Return all unvisited neighbor of current cell\n      let unvisited = checkNeighbors(this.pos.a, this.pos.b);\n      \n      // Make this cell visited\n      this.pos.visited = true;\n      \n      // If maximum steps are reached then\n      if(this.steps >= maxStep - 1) {\n        // Reset steps to zero\n        this.steps = 0;\n        // Go back to old cell to find another path\n        this.pos = this.stack[this.stack.length-(floor(maxStep*0.5))-1];\n      }\n      // Else randomly choose new cell to visit\n      else if(unvisited && this.steps < maxStep) {\n        \n        // Pick a new cell randomly\n        let next = unvisited[floor(random(0, unvisited.length))];\n        \n        // Set this cell to this group\n        next.group = this.group;\n        \n        // Remove wall between this cell and the chosen cell to visit\n        removeWalls(this.pos, next);\n        \n        /* this.pos.show(); */\n        \n        //Set the chosen cell as the current cell\n        this.pos = next;\n        \n        // Add this new cell into the tracking list\n        this.track.push(this.pos);\n        this.stack.push(this.pos);\n        \n        this.steps++;\n      }\n      // Else if there is no neighbor cell to visit\n      else if(this.stack.length > 1) { // Also checking for the length of stack array to prevent out of bound error\n        this.steps--;\n        \n        // Set the current cell to previous visited cell\n        this.pos = this.stack[this.stack.length-2];\n        \n        // Remove the last visited cell on the stack\n        this.stack.pop();\n      }\n      // Else everything is visited and is now done\n      else if (this.done === 0) this.done = 1;\n    }\n    \n  };\n```\n\n\n\n<h3 id=\"dfmerge\">DepthFirst.merge()</h3>\nThis function is responsible for connecting two mazes together with one argument needed, a `path` maze to connect with this maze.\n```\n// Merge two generated maze as one whole maze\n  this.merge = function(path) {\n    let cells = [];\n    \n    // Set all cells as unvisited\n    for (let i = 0; i < grid.length; i++) {\n      grid[i].visited = false;\n    }\n    \n    // Loop through all cells in a generated maze\n    for(let i = path.track.length-1; i > 0; i--) {\n      let current = path.track[i];\n      \n      // Return neighbors\n      let possible = checkNeighbors(current.a, current.b);\n      if (possible) {\n        for(let j = 0; j < possible.length; j++) {\n          \n          // If that cell is not in this group then\n          if(possible[j].group == this.group) {\n            // Add that cell to possible cells\n            cells.push([current, possible[j]]);\n          }\n        }\n      }\n    }\n    \n    for (let i = 0; i < grid.length; i++) {\n      grid[i].visited = true;\n    }\n    \n    let r = floor(random(0, cells.length));\n    \n    // Remove wall between that cell in this group and another cell from the given other group\n    removeWalls(cells[r][0], cells[r][1]);\n    \n    // Done, this function will not run anymore\n    this.done++;\n  };\n```\n\n---\n\nAnd that is all the main functionality of this variation of depth-first search, I hope you understand most of it even though I didn't explain it very very well :3\n\nYou can see more of the other functions I've used on the source code link given above.\n\nIf you enjoy reading this please upvote, share and leave a comment for any feedback!",
      "json_metadata": "{\"tags\":[\"programming\",\"maze\",\"depth-first\",\"javascript\",\"mobile\"],\"image\":[\"https://cdn.steemitimages.com/DQmdoSXbSagLb4EieYPftUV42mG9g1nDafbSfNxNxdnQbB3/20190125_163319.gif\"],\"links\":[\"https://steemit.com/programming/@jkazuto/custom-variant-and-optimization-of-depth-first-search-maze-algorithm\",\"http://p5js.org\",\"#variables\",\"#setup\",\"#draw\",\"#depthfirst\",\"#dfstart\",\"#dfrun\",\"#dfmerge\",\"https://github.com/jepsuCoded/Optimized-Depth-first-Search-Maze-Algorithm\",\"p5js.org\"],\"app\":\"steemit/0.1\",\"format\":\"markdown\"}",
      "parent_author": "",
      "parent_permlink": "programming",
      "permlink": "custom-variant-and-optimization-of-depth-first-search-maze-algorithm-part-2",
      "title": "Custom Variant and Optimization of Depth-first Search Maze Algorithm Part 2"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-25T10:18:15",
  "trx_id": "9371f9703921f210012f9d875ad482c7882afac3",
  "trx_in_block": 14,
  "virtual_op": 0
}

{
  "block": 29760519,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "27669.274735 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-25T09:02:27",
  "trx_id": "36d855e675ccec302a0011ef4c0b1c4c70386ec6",
  "trx_in_block": 10,
  "virtual_op": 0
}

{
  "block": 29759291,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "custom-variant-and-optimization-of-depth-first-search-maze-algorithm",
      "voter": "steemitboard",
      "weight": 100
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-25T08:01:03",
  "trx_id": "917e530d829131402ef07e9a0117ddfc5d7f1cbe",
  "trx_in_block": 10,
  "virtual_op": 0
}

{
  "block": 29759290,
  "op": [
    "comment",
    {
      "author": "steemitboard",
      "body": "Congratulations @jkazuto! You have completed the following achievement on the Steem blockchain and have been rewarded with new badge(s) :\n\n<table><tr><td>https://steemitimages.com/60x70/http://steemitboard.com/@jkazuto/votes.png?201901250721</td><td>You made more than 10 upvotes. Your next target is to reach 50 upvotes.</td></tr>\n</table>\n\n<sub>_[Click here to view your Board](https://steemitboard.com/@jkazuto)_</sub>\n<sub>_If you no longer want to receive notifications, reply to this comment with the word_ `STOP`</sub>\n\n\nTo support your work, I also upvoted your post!\n\n\n> Support [SteemitBoard's project](https://steemit.com/@steemitboard)! **[Vote for its witness](https://v2.steemconnect.com/sign/account-witness-vote?witness=steemitboard&approve=1)** and **get one more award**!",
      "json_metadata": "{\"image\":[\"https://steemitboard.com/img/notify.png\"]}",
      "parent_author": "jkazuto",
      "parent_permlink": "custom-variant-and-optimization-of-depth-first-search-maze-algorithm",
      "permlink": "steemitboard-notify-jkazuto-20190125t080102000z",
      "title": ""
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-25T08:01:00",
  "trx_id": "45406f35a5186c219aefaeed15c11f0e3885d92d",
  "trx_in_block": 25,
  "virtual_op": 0
}

{
  "block": 29756090,
  "op": [
    "vote",
    {
      "author": "yehey",
      "permlink": "yehey-witness---upvoting-authors-with-good-content--01252019-000016-reports",
      "voter": "jkazuto",
      "weight": 500
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-25T05:20:57",
  "trx_id": "6284302c092ae32bd5f3b07f97dd171ad91c9d9f",
  "trx_in_block": 10,
  "virtual_op": 0
}

{
  "block": 29755111,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "custom-variant-and-optimization-of-depth-first-search-maze-algorithm",
      "voter": "jkazuto",
      "weight": 10000
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-25T04:31:54",
  "trx_id": "b4331fe2bc312d29f9a3d613ada6b64edeedd086",
  "trx_in_block": 30,
  "virtual_op": 0
}

{
  "block": 29754823,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "custom-variant-and-optimization-of-depth-first-search-maze-algorithm",
      "voter": "pinoy",
      "weight": 1000
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-25T04:17:30",
  "trx_id": "4dcd953b6dd2f790004b3a0ca46a2d3a4219363a",
  "trx_in_block": 9,
  "virtual_op": 0
}

{
  "block": 29754516,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "custom-variant-and-optimization-of-depth-first-search-maze-algorithm",
      "voter": "yehey",
      "weight": 1000
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-25T04:02:09",
  "trx_id": "58108a42363866dadbcdb6a6873793f6ec7a5597",
  "trx_in_block": 3,
  "virtual_op": 0
}

{
  "block": 29753958,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "custom-variant-and-optimization-of-depth-first-search-maze-algorithm",
      "voter": "devsup",
      "weight": 69
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-25T03:34:09",
  "trx_id": "ed76d2dd337ada6500b27c83daaeca4bfc84d043",
  "trx_in_block": 19,
  "virtual_op": 0
}

{
  "block": 29753659,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "Hello World! Its been a long time since my last visit here and lots of thing have happened while I'm gone but enough of the talk and lets get to the real topic.\n\nSo for the last few days I've been watching many Coding Train videos on YouTube to know more things about programming especially in javascript, then I stumbled upon one [video]( https://youtu.be/HyK_Q5rrcr4) of creating a maze on processing framework using depth-first search algorithm and I enjoy watching it so I made one myself.\n\n![cdx8ox80i9.gif](https://img.esteem.ws/cdx8ox80i9.gif)\n\nThe GIF you see above is the depth-first search algorithm creating a maze. So what is depth-first search maze generation?\n\nAs stated on [Wikipedia](https://en.wikipedia.org/wiki/Maze_generation_algorithm),\n> This algorithm is a randomized version of the depth-first search algorithm. Frequently implemented with a stack, this approach is one of the simplest ways to generate a maze using a computer. Consider the space for a maze being a large grid of cells (like a large chess board), each cell starting with four walls. Starting from a random cell, the computer then selects a random neighbouring cell that has not yet been visited. The computer removes the wall between the two cells and marks the new cell as visited, and adds it to the stack to facilitate backtracking. The computer continues this process, with a cell that has no unvisited neighbours being considered a dead-end. When at a dead-end it backtracks through the path until it reaches a cell with an unvisited neighbour, continuing the path generation by visiting this new, unvisited cell (creating a new junction). This process continues until every cell has been visited, causing the computer to backtrack all the way back to the beginning cell. We can be sure every cell is visited.\n\n--- \n\nMost of you probably didn't read all of it so here is the general instruction of depth-first search algorithm:\n1. Make the initial cell the current cell and mark it as visited\n2. While there are unvisited cells\n\t1. If the current cell has any neighbours which have not been visited\n\t\t1. Choose randomly one of the unvisited neighbours\n\t\t2. Push the current cell to the stack\n\t\t3. Remove the wall between the current cell and the chosen cell\n\t\t4. Make the chosen cell the current cell and mark it as visited\n\t2. Else if stack is not empty\n\t\t1. Pop a cell from the stack\n\t\t2. Make it the current cell\n\n![wsn2j4d5ku.gif](https://img.esteem.ws/wsn2j4d5ku.gif)\n\n> Visualization of the above instruction\n* Brown cells are the visited cells\n* Peach cells are all unvisited cells\n* Maroon cell is the current cell\n* Blue cell is the next cell to visit\n* Green cells are other available neighbor cells\n\n---\nThe noticeable problem with this algorithm is that you can't choose your own exit cell because it always look for possible cell to visit anywhere. Commonly the exit cell of this algorithm is the longest path, like for the example above the exit cell is on the 2nd column on the 5th row. What I want is to have the starting cell on the top left corner of the room and the exit cell is on the bottom right corner.\n\nSo what I did was simple, I've created two maze generator in one single room, one for the starting cell and one for the exit cell;\n\n![bxjqfh3nvt.gif](https://img.esteem.ws/bxjqfh3nvt.gif)\n\nProblem has now been solved, I can set the starting and exit cell anywhere I want with two maze generator. But a new problem has been arised, the two random mazes in this room are not connnected to each other, so we need a way to make them a one single maze. \n\nThis is what I've come up:\n1. Loop through every cell in the first maze\n\t1. If this cell is adjacent to the cell of the second maze\n\t\t- Add this cell to the stack\n2. Randomly pick a cell from the stack\n3. Remove the wall between this cell and its adjacent cell\n\n---\n\n![nmetb2a7rk.gif](https://img.esteem.ws/nmetb2a7rk.gif)\n\nSo there you go! My customized depth-first search algorithm! But wait, we're not done yet! There is still one more thing that bothers me with this algorithm. Its the way that most of the time it creates a long corridor until it found a dead end, means there are chances that it will generate a less branches of paths with long corridors but what I want is more branches with a decent length of corridors per branches. A simple way to fix it is by creating a step counter that increments every time a current cell visited a new cell then once we reached a maximum step, we will go back to the previous visited cell nth times and resetting the step counter back to zero.\n\n\n\n![i22drukyu8.gif](https://img.esteem.ws/i22drukyu8.gif)\n> Maximum of 10 steps before going back by 5 steps\n\nAs you can see above, even if there is a cell to visit, once it reaches a maximum of 10 steps it will backtrack 5 times and will start looking for another path to go. Finding the right maximum steps is the key for making hard random mazes.\n\nAnd thats all for my own customized Depth-first search maze generator! Nothing fancy and anyone can do even better than this too.\n\n## TL;DR\nA custom variation of Depth-first search consisting of two mazes in one room merged into one single big maze. One maze is initialized as starting cell and the second maze is initialized as the exit cell, both of them can be set anywhere in a room, in my example the starting cell is at the top left corner of the room and the exit cell is at the bottom right corner. The depth-first search is known to have a lot of long corridors but in this variation you can set the maximum length of corridor before it backtracks and find another branch of paths.\n\nThe algorithm is the same as the original depth-first but with the addition of new a condition maximum steps before visiting a new cell, if its steps are greater than the maximum step then go backtrack nth times as specified by the user then reset the step counter to zero.\n\nTo merge two mazes as one, the program will loop into all of the cells within the first maze and if that cell is adjacent or next to a cell within the second maze then remove a wall from this cell and its adjacent cell from the second maze. This need to be run onced to prevent a looping maze. \n\n![20190125_100731.gif](https://cdn.steemitimages.com/DQmQygLB544CgkmPucgvgdZVjWUjAjFRBeuir2CXb3YYe7b/20190125_100731.gif)\n> 91x41 cells with a 132 maximum steps, checking 60 cells per frame.\n\nI am not really good on explaining things and stuffs so if you have any feedbacks feel free to comment it out below. Also the source code and the explanation of my codes in javascript language will be on my next blog so stay tuned and if you like this idea feel free to share and upvote!",
      "json_metadata": "{\"tags\":[\"programming\",\"maze\",\"depth-first\",\"javascript\",\"mobile\"],\"image\":[\"https://img.esteem.ws/cdx8ox80i9.gif\",\"https://img.esteem.ws/wsn2j4d5ku.gif\",\"https://img.esteem.ws/bxjqfh3nvt.gif\",\"https://img.esteem.ws/nmetb2a7rk.gif\",\"https://img.esteem.ws/i22drukyu8.gif\",\"https://cdn.steemitimages.com/DQmQygLB544CgkmPucgvgdZVjWUjAjFRBeuir2CXb3YYe7b/20190125_100731.gif\"],\"links\":[\"https://youtu.be/HyK_Q5rrcr4\",\"https://en.wikipedia.org/wiki/Maze_generation_algorithm\"],\"app\":\"steemit/0.1\",\"format\":\"markdown\"}",
      "parent_author": "",
      "parent_permlink": "programming",
      "permlink": "custom-variant-and-optimization-of-depth-first-search-maze-algorithm",
      "title": "Custom variant and optimization of depth-first search maze algorithm"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2019-01-25T03:19:12",
  "trx_id": "e58d184df7e1ac26c64adcca11e10cb65c3554f6",
  "trx_in_block": 18,
  "virtual_op": 0
}

{
  "block": 27055049,
  "op": [
    "comment",
    {
      "author": "steemitboard",
      "body": "Congratulations @jkazuto! You have received a personal award!\n\n[![](https://steemitimages.com/70x70/http://steemitboard.com/@jkazuto/birthday1.png)](http://steemitboard.com/@jkazuto)  1 Year on Steemit\n<sub>_Click on the badge to view your Board of Honor._</sub>\n\n\n**Do not miss the last post from @steemitboard:**\n<table><tr><td><a href=\"https://steemit.com/steemitboard/@steemitboard/steemitboard-ranking-update-resteem-and-resteemed-added\"><img src=\"https://steemitimages.com/64x128/https://cdn.steemitimages.com/DQmfRVpHQhLDhnjDtqck8GPv9NPvNKPfMsDaAFDE1D9Er2Z/header_ranking.png\"></a></td><td><a href=\"https://steemit.com/steemitboard/@steemitboard/steemitboard-ranking-update-resteem-and-resteemed-added\">SteemitBoard Ranking update - Resteem and Resteemed added</a></td></tr></table>\n\n> Support [SteemitBoard's project](https://steemit.com/@steemitboard)! **[Vote for its witness](https://v2.steemconnect.com/sign/account-witness-vote?witness=steemitboard&approve=1)** and **get one more award**!",
      "json_metadata": "{\"image\":[\"https://steemitboard.com/img/notify.png\"]}",
      "parent_author": "jkazuto",
      "parent_permlink": "30-days-of-coding-java-day-1-introduction",
      "permlink": "steemitboard-notify-jkazuto-20181023t085144000z",
      "title": ""
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2018-10-23T08:51:45",
  "trx_id": "fcdb48ed2766bd59f21a80f5623f4e791dba930b",
  "trx_in_block": 6,
  "virtual_op": 0
}

{
  "block": 23058904,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "7723.388613 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2018-06-05T14:55:09",
  "trx_id": "59fda18c37d2551f1ca115cf2c453ccc33db73f3",
  "trx_in_block": 28,
  "virtual_op": 0
}

{
  "block": 21771196,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "28121.842080 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2018-04-21T20:45:24",
  "trx_id": "9ddc6b90f8a080c47aa81107adf409496cd15679",
  "trx_in_block": 43,
  "virtual_op": 0
}

{
  "block": 20440255,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "@@ -1285,17 +1285,26 @@\n w!%3C/p%3E%0A%3C\n-p\n+h2%3E%3Ccenter\n %3EDay 1: \n@@ -1337,17 +1337,34 @@\n vowels%3C/\n-p\n+center%3E%3C/h2%3E%0A%3Chr /\n %3E%0A%3Cp%3EI'v\n@@ -7712,25 +7712,34 @@\n code%3E.%3C/p%3E%0A%3C\n-p\n+h2%3E%3Ccenter\n %3EThe Result%3C\n@@ -7739,17 +7739,34 @@\n Result%3C/\n-p\n+center%3E%3C/h2%3E%0A%3Chr /\n %3E%0A%3Cpre%3E%3C\n",
      "json_metadata": "{\"tags\":[\"java\",\"programming\",\"thirtydaychallenge\",\"day1\"],\"links\":[\"https://www.spelfabet.com.au/2015/04/the-difference-between-consonants-and-vowels/\",\"https://www.up-4ever.com/cx45a6btvccb\"],\"app\":\"steemit/0.1\",\"format\":\"html\"}",
      "parent_author": "",
      "parent_permlink": "java",
      "permlink": "30-days-of-coding-java-day-1-introduction",
      "title": "30 Days of Coding - Java: Day 1, Introduction"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2018-03-06T14:25:09",
  "trx_id": "d3b8510bff651742cd038132d81212c1429a75a4",
  "trx_in_block": 34,
  "virtual_op": 0
}

{
  "block": 20440205,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "@@ -5,179 +5,18 @@\n l%3E%0A%3C\n-p%3ESource: %3Ca href=%22https://www.spelfabet.com.au/2015/04/the-difference-between-consonants-and-vowels/%22%3EVowels and Consonants are sounds, not letters %7C Spelfabet%3C/a%3E%3C/p%3E%0A%3Cp\n+h1%3E%3Ccenter\n %3EMy \n@@ -49,17 +49,34 @@\n lenge!%3C/\n-p\n+center%3E%3C/h1%3E%0A%3Chr /\n %3E%0A%3Cp%3ESo \n@@ -2462,16 +2462,186 @@\n kquote%3E%0A\n+%3Cp%3ESource: %3Ca href=%22https://www.spelfabet.com.au/2015/04/the-difference-between-consonants-and-vowels/%22%3EVowels and Consonants are sounds, not letters %7C Spelfabet%3C/a%3E%3C/p%3E%0A\n %3Cp%3EBut l\n@@ -2960,20 +2960,16 @@\n /strong%3E\n-%3Cbr%3E\n %0AScanner\n@@ -2975,20 +2975,16 @@\n r input;\n-%3Cbr%3E\n %0AString \n@@ -2987,36 +2987,32 @@\n ing inputString;\n-%3Cbr%3E\n %0AString groupOfV\n@@ -3017,20 +3017,16 @@\n fVowels;\n-%3Cbr%3E\n %0AString \n@@ -3043,20 +3043,16 @@\n sonants;\n-%3Cbr%3E\n %0Achar le\n@@ -3060,38 +3060,10 @@\n ter;\n-%3Cbr%3E%0A%3C/code%3E%3C/pre%3E%0A%3Cpre%3E%3Ccode%3E\n+%0A%0A\n %3Cstr\n@@ -3098,20 +3098,16 @@\n /strong%3E\n-%3Cbr%3E\n %0Achar%5B%5D \n@@ -3113,20 +3113,16 @@\n  vowels;\n-%3Cbr%3E\n %0Achar%5B%5D \n@@ -3136,38 +3136,10 @@\n nts;\n-%3Cbr%3E%0A%3C/code%3E%3C/pre%3E%0A%3Cpre%3E%3Ccode%3E\n+%0A%0A\n %3Cstr\n@@ -3173,20 +3173,16 @@\n /strong%3E\n-%3Cbr%3E\n %0Aint pos\n@@ -3205,17 +3205,26 @@\n %3C/pre%3E%0A%3C\n-p\n+h2%3E%3Ccenter\n %3EMethod \n@@ -3226,17 +3226,34 @@\n thod 1%3C/\n-p\n+center%3E%3C/h2%3E%0A%3Chr /\n %3E%0A%3Cp%3EIn \n@@ -3545,33 +3545,24 @@\n (System.in);\n-%3Cbr%3E%0A%3Cbr%3E\n %0AString inpu\n@@ -3561,36 +3561,32 @@\n ing inputString;\n-%3Cbr%3E\n %0AString groupOfV\n@@ -3588,36 +3588,32 @@\n upOfVowels = %22%22;\n-%3Cbr%3E\n %0AString groupOfC\n@@ -3623,33 +3623,25 @@\n onants = %22%22;\n-%3Cbr%3E%0A%3Cbr%3E\n+%0A\n %0Achar letter\n@@ -3641,20 +3641,16 @@\n  letter;\n-%3Cbr%3E\n %0Achar%5B%5D \n@@ -3684,20 +3684,16 @@\n ', 'u'%7D;\n-%3Cbr%3E\n %0Achar%5B%5D \n@@ -3811,20 +3811,16 @@\n ', 'z'%7D;\n-%3Cbr%3E\n %0A%3C/code%3E\n@@ -4043,20 +4043,16 @@\n ring:%22);\n-%3Cbr%3E\n %0AinputSt\n@@ -4075,20 +4075,16 @@\n tLine();\n-%3Cbr%3E\n %0AinputSt\n@@ -4116,20 +4116,16 @@\n rCase();\n-%3Cbr%3E\n %0A%3C/code%3E\n@@ -4289,20 +4289,16 @@\n  proceed\n-%3Cbr%3E\n %0A// with\n@@ -4353,20 +4353,16 @@\n sonants.\n-%3Cbr%3E\n %0Afor (in\n@@ -4401,28 +4401,24 @@\n th(); i++) %7B\n-%3Cbr%3E\n %0A  &nbs\n@@ -4501,20 +4501,16 @@\n ng%3C/em%3E.\n-%3Cbr%3E\n %0A  \n@@ -4552,20 +4552,16 @@\n arAt(i);\n-%3Cbr%3E\n %0A  \n@@ -4610,20 +4610,16 @@\n  a vowel\n-%3Cbr%3E\n %0A  \n@@ -4670,28 +4670,24 @@\n ngth; j++) %7B\n-%3Cbr%3E\n %0A  &nbs\n@@ -4740,28 +4740,24 @@\n vowels%5Bj%5D) %7B\n-%3Cbr%3E\n %0A  &nbs\n@@ -4882,36 +4882,32 @@\n s%3C/em%3E variable.\n-%3Cbr%3E\n %0A   &n\n@@ -4985,20 +4985,16 @@\n wels%5Bj%5D;\n-%3Cbr%3E\n %0A  \n@@ -5051,36 +5051,32 @@\n bsp; break;\n-%3Cbr%3E\n %0A   &n\n@@ -5096,36 +5096,32 @@\n sp;  %7D\n-%3Cbr%3E\n %0A   &n\n@@ -5117,36 +5117,32 @@\n sp;  %7D\n-%3Cbr%3E\n %0A   &n\n@@ -5187,20 +5187,16 @@\n onsonant\n-%3Cbr%3E\n %0A  \n@@ -5251,28 +5251,24 @@\n ngth; k++) %7B\n-%3Cbr%3E\n %0A  &nbs\n@@ -5329,20 +5329,16 @@\n ts%5Bk%5D) %7B\n-%3Cbr%3E\n %0A  \n@@ -5479,20 +5479,16 @@\n ariable.\n-%3Cbr%3E\n %0A  \n@@ -5582,20 +5582,16 @@\n ants%5Bk%5D;\n-%3Cbr%3E\n %0A  \n@@ -5656,20 +5656,16 @@\n p;break;\n-%3Cbr%3E\n %0A  \n@@ -5701,20 +5701,16 @@\n ; %7D\n-%3Cbr%3E\n %0A  \n@@ -5722,26 +5722,18 @@\n ; %7D\n-%3Cbr%3E%0A%7D%3Cbr%3E\n+%0A%7D\n %0A%3C/code%3E\n@@ -6067,17 +6067,26 @@\n g.%3C/p%3E%0A%3C\n-p\n+h2%3E%3Ccenter\n %3EMethod \n@@ -6088,17 +6088,34 @@\n thod 2%3C/\n-p\n+center%3E%3C/h2%3E%0A%3Chr /\n %3E%0A%3Cp%3EIn \n@@ -6361,25 +6361,16 @@\n tem.in);\n-%3Cbr%3E%0A%3Cbr%3E\n %0AString \n@@ -6381,20 +6381,16 @@\n tString;\n-%3Cbr%3E\n %0AString \n@@ -6408,20 +6408,16 @@\n ls = %22%22;\n-%3Cbr%3E\n %0AString \n@@ -6443,17 +6443,9 @@\n  %22%22;\n-%3Cbr%3E%0A%3Cbr%3E\n+%0A\n %0Acha\n@@ -6453,20 +6453,16 @@\n  letter;\n-%3Cbr%3E\n %0Aint pos\n@@ -6470,20 +6470,16 @@\n fLetter;\n-%3Cbr%3E\n %0A%3C/code%3E\n@@ -6703,20 +6703,16 @@\n ; l++) %7B\n-%3Cbr%3E\n %0A  \n@@ -6754,20 +6754,16 @@\n arAt(l);\n-%3Cbr%3E\n %0A  \n@@ -6837,20 +6837,16 @@\n  %22aeiou%22\n-%3Cbr%3E\n %0A  \n@@ -6887,38 +6887,40 @@\n indexOf(letter);\n-%3Cbr%3E%0A \n+%0A  \n   // C\n@@ -6988,20 +6988,16 @@\n et to -1\n-%3Cbr%3E\n %0A  \n@@ -7023,36 +7023,32 @@\n fLetter >= 0)\n-%3Cbr%3E\n %0A   &n\n@@ -7112,36 +7112,32 @@\n At(posOfLetter);\n-%3Cbr%3E\n %0A   &n\n@@ -7146,20 +7146,16 @@\n p;else %7B\n-%3Cbr%3E\n %0A  \n@@ -7240,28 +7240,24 @@\n xOf(letter);\n-%3Cbr%3E\n %0A  &nbs\n@@ -7312,20 +7312,16 @@\n >= 0)\n-%3Cbr%3E\n %0A  \n@@ -7445,20 +7445,16 @@\n Letter);\n-%3Cbr%3E\n %0A  \n@@ -7470,18 +7470,10 @@\n sp;%7D\n-%3Cbr%3E%0A%7D%3Cbr%3E\n+%0A%7D\n %0ASys\n@@ -7542,20 +7542,16 @@\n Vowels);\n-%3Cbr%3E\n %0A%3C/code%3E\n@@ -7733,20 +7733,16 @@\n  string:\n-%3Cbr%3E\n %0ALorem i\n@@ -7790,20 +7790,16 @@\n ng elit.\n-%3Cbr%3E\n %0AResult:\n@@ -7847,20 +7847,16 @@\n euaiiiei\n-%3Cbr%3E\n %0A%3C/code%3E\n",
      "json_metadata": "{\"tags\":[\"java\",\"programming\",\"thirtydaychallenge\",\"day1\"],\"links\":[\"https://www.spelfabet.com.au/2015/04/the-difference-between-consonants-and-vowels/\",\"https://www.up-4ever.com/cx45a6btvccb\"],\"app\":\"steemit/0.1\",\"format\":\"html\"}",
      "parent_author": "",
      "parent_permlink": "java",
      "permlink": "30-days-of-coding-java-day-1-introduction",
      "title": "30 Days of Coding - Java: Day 1, Introduction"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2018-03-06T14:22:39",
  "trx_id": "5df558d6f9c35859fca2c0cdabb279c1ea3f7d3b",
  "trx_in_block": 2,
  "virtual_op": 0
}

{
  "block": 20439966,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "@@ -5,18 +5,179 @@\n l%3E%0A%3C\n-h1%3E%3Ccenter\n+p%3ESource: %3Ca href=%22https://www.spelfabet.com.au/2015/04/the-difference-between-consonants-and-vowels/%22%3EVowels and Consonants are sounds, not letters %7C Spelfabet%3C/a%3E%3C/p%3E%0A%3Cp\n %3EMy \n@@ -214,26 +214,9 @@\n e!%3C/\n-center%3E%3C/h1%3E%0A%3Chr /\n+p\n %3E%0A%3Cp\n@@ -304,16 +304,17 @@\n  of this\n+ \n challeng\n@@ -1429,26 +1429,17 @@\n w!%3C/p%3E%0A%3C\n-h2%3E%3Ccenter\n+p\n %3EDay 1: \n@@ -1472,34 +1472,17 @@\n vowels%3C/\n-center%3E%3C/h2%3E%0A%3Chr /\n+p\n %3E%0A%3Cp%3EI'v\n@@ -1601,18 +1601,28 @@\n %3Cp%3E%3C\n-b\n+strong\n %3EName:%3C/\n-b\n+strong\n %3E Di\n@@ -1634,22 +1634,25 @@\n weler%3Cbr\n- /\n %3E%0A%3C\n-b\n+strong\n %3EDescrip\n@@ -1658,19 +1658,24 @@\n ption:%3C/\n-b%3E%0A\n+strong%3E \n This pro\n@@ -1843,18 +1843,20 @@\n  it.\n- \n %3Cbr\n- /\n %3E%0A%3C\n-b\n+strong\n %3EExa\n@@ -1866,15 +1866,18 @@\n e:%3C/\n-b\n+strong\n %3E%3Cbr\n- /\n %3E%0AIn\n@@ -1904,18 +1904,16 @@\n %3C/em%3E%3Cbr\n- /\n %3E%0AOutput\n@@ -1939,23 +1939,16 @@\n em%3E%3C/p%3E%0A\n-%3Chr /%3E%0A\n %3Cp%3ESo wh\n@@ -2428,16 +2428,21 @@\n ou know,\n+%3C/p%3E%0A\n %3Cblockqu\n@@ -2610,175 +2610,8 @@\n te%3E%0A\n-Source: %3Ca href=%22https://www.spelfabet.com.au/2015/04/the-difference-between-consonants-and-vowels/%22%3EVowels and Consonants are sounds, not letters %7C Spelfabet%3C/a%3E%3C/p%3E%0A\n %3Cp%3EB\n@@ -2888,27 +2888,34 @@\n ion%3C/p%3E%0A\n-%0A\n %3Cp\n-%3E%3Cpre%3E%3Cb\n+re%3E%3Ccode%3E%3Cstrong\n %3EGeneral\n@@ -2927,25 +2927,28 @@\n ables:%3C/\n-b%3E%0A%3Ccode%3E\n+strong%3E%3Cbr%3E%0A\n Scanner \n@@ -2953,16 +2953,20 @@\n r input;\n+%3Cbr%3E\n %0AString \n@@ -2969,32 +2969,36 @@\n ing inputString;\n+%3Cbr%3E\n %0AString groupOfV\n@@ -3003,16 +3003,20 @@\n fVowels;\n+%3Cbr%3E\n %0AString \n@@ -3033,16 +3033,20 @@\n sonants;\n+%3Cbr%3E\n %0Achar le\n@@ -3046,24 +3046,28 @@\n char letter;\n+%3Cbr%3E\n %0A%3C/code%3E%3C/pr\n@@ -3066,38 +3066,41 @@\n ode%3E%3C/pre%3E%0A%3C\n-/p%3E%0A%3Cp%3E%3Cpre%3E%3Cb\n+pre%3E%3Ccode%3E%3Cstrong\n %3EVariables f\n@@ -3113,25 +3113,28 @@\n hod 1:%3C/\n-b%3E%0A%3Ccode%3E\n+strong%3E%3Cbr%3E%0A\n char%5B%5D v\n@@ -3139,16 +3139,20 @@\n  vowels;\n+%3Cbr%3E\n %0Achar%5B%5D \n@@ -3162,16 +3162,20 @@\n sonants;\n+%3Cbr%3E\n %0A%3C/code%3E\n@@ -3186,22 +3186,25 @@\n e%3E%0A%3C\n-/p%3E%0A%3Cp%3E%3Cpre%3E%3Cb\n+pre%3E%3Ccode%3E%3Cstrong\n %3EVar\n@@ -3228,17 +3228,20 @@\n 2:%3C/\n-b%3E%0A%3Ccode%3E\n+strong%3E%3Cbr%3E%0A\n int \n@@ -3271,53 +3271,21 @@\n e%3E%0A%3C\n-/\n p%3E\n-%0A%0A%3Ch2%3E%3Ccenter%3EMethod 1%3C/center%3E%3C/h2%3E%0A%3Chr /\n+Method 1%3C/p\n %3E%0A%3Cp\n@@ -3577,33 +3577,41 @@\n nner(System.in);\n-%0A\n+%3Cbr%3E%0A%3Cbr%3E\n %0AString inputStr\n@@ -3606,32 +3606,36 @@\n ing inputString;\n+%3Cbr%3E\n %0AString groupOfV\n@@ -3637,32 +3637,36 @@\n upOfVowels = %22%22;\n+%3Cbr%3E\n %0AString groupOfC\n@@ -3672,33 +3672,41 @@\n Consonants = %22%22;\n-%0A\n+%3Cbr%3E%0A%3Cbr%3E\n %0Achar letter;%0Ach\n@@ -3702,16 +3702,20 @@\n  letter;\n+%3Cbr%3E\n %0Achar%5B%5D \n@@ -3749,16 +3749,20 @@\n ', 'u'%7D;\n+%3Cbr%3E\n %0Achar%5B%5D \n@@ -3880,16 +3880,20 @@\n ', 'z'%7D;\n+%3Cbr%3E\n %0A%3C/code%3E\n@@ -4063,25 +4063,24 @@\n %3C/code%3E%3C/p%3E%0A\n-%0A\n %3Cpre%3E%3Ccode%3ES\n@@ -4116,16 +4116,20 @@\n ring:%22);\n+%3Cbr%3E\n %0AinputSt\n@@ -4152,16 +4152,20 @@\n tLine();\n+%3Cbr%3E\n %0AinputSt\n@@ -4197,16 +4197,20 @@\n rCase();\n+%3Cbr%3E\n %0A%3C/code%3E\n@@ -4310,25 +4310,24 @@\n riable.%3C/p%3E%0A\n-%0A\n %3Cpre%3E%3Ccode%3E/\n@@ -4374,16 +4374,20 @@\n  proceed\n+%3Cbr%3E\n %0A// with\n@@ -4442,16 +4442,20 @@\n sonants.\n+%3Cbr%3E\n %0Afor (in\n@@ -4465,17 +4465,20 @@\n  = 0; i \n-%3C\n+<\n  inputSt\n@@ -4498,21 +4498,40 @@\n ; i++) %7B\n-%0A    \n+%3Cbr%3E%0A    \n // Get t\n@@ -4598,21 +4598,40 @@\n ng%3C/em%3E.\n-%0A    \n+%3Cbr%3E%0A    \n letter =\n@@ -4653,21 +4653,40 @@\n arAt(i);\n-%0A    \n+%3Cbr%3E%0A    \n // Check\n@@ -4715,21 +4715,40 @@\n  a vowel\n-%0A    \n+%3Cbr%3E%0A    \n for (int\n@@ -4757,17 +4757,20 @@\n  = 0; j \n-%3C\n+<\n  vowels.\n@@ -4787,214 +4787,507 @@\n +) %7B\n-%0A        if (letter == vowels%5Bj%5D) %7B%0A            // If true then concatenate the letter in the %3Cem%3EgroupOfVowels%3C/em%3E variable.%0A            groupOfVowels += vowels%5Bj%5D;%0A            break;%0A        %7D%0A    %7D%0A    \n+%3Cbr%3E%0A        if (letter == vowels%5Bj%5D) %7B%3Cbr%3E%0A            // If true then concatenate the letter in the %3Cem%3EgroupOfVowels%3C/em%3E variable.%3Cbr%3E%0A            groupOfVowels += vowels%5Bj%5D;%3Cbr%3E%0A            break;%3Cbr%3E%0A        %7D%3Cbr%3E%0A    %7D%3Cbr%3E%0A    \n // C\n@@ -5324,21 +5324,40 @@\n onsonant\n-%0A    \n+%3Cbr%3E%0A    \n for (int\n@@ -5366,17 +5366,20 @@\n  = 0; k \n-%3C\n+<\n  consona\n@@ -5400,227 +5400,509 @@\n +) %7B\n-%0A        if (letter == consonants%5Bk%5D) %7B%0A            // If true then concatenate the letter in the %3Cem%3EgroupOfConsonants%3C/em%3E variable.%0A            groupOfConsonants += consonants%5Bk%5D;%0A            break;%0A        %7D%0A    %7D%0A%7D\n+%3Cbr%3E%0A        if (letter == consonants%5Bk%5D) %7B%3Cbr%3E%0A            // If true then concatenate the letter in the %3Cem%3EgroupOfConsonants%3C/em%3E variable.%3Cbr%3E%0A            groupOfConsonants += consonants%5Bk%5D;%3Cbr%3E%0A            break;%3Cbr%3E%0A        %7D%3Cbr%3E%0A    %7D%3Cbr%3E%0A%7D%3Cbr%3E\n %0A%3C/c\n@@ -6187,17 +6187,16 @@\n pre%3E%0A%3Cp%3E\n- \n And fina\n@@ -6243,49 +6243,22 @@\n /p%3E%0A\n-%0A%3Ch2%3E%3Ccenter%3EMethod 2%3C/center%3E%3C/h2%3E%0A%3Chr /\n+%3Cp%3EMethod 2%3C/p\n %3E%0A%3Cp\n@@ -6508,17 +6508,25 @@\n tem.in);\n-%0A\n+%3Cbr%3E%0A%3Cbr%3E\n %0AString \n@@ -6537,16 +6537,20 @@\n tString;\n+%3Cbr%3E\n %0AString \n@@ -6568,16 +6568,20 @@\n ls = %22%22;\n+%3Cbr%3E\n %0AString \n@@ -6603,17 +6603,25 @@\n ts = %22%22;\n-%0A\n+%3Cbr%3E%0A%3Cbr%3E\n %0Achar le\n@@ -6625,16 +6625,20 @@\n  letter;\n+%3Cbr%3E\n %0Aint pos\n@@ -6646,16 +6646,20 @@\n fLetter;\n+%3Cbr%3E\n %0A%3C/code%3E\n@@ -6821,17 +6821,16 @@\n e%3E.%3C/p%3E%0A\n-%0A\n %3Cpre%3E%3Cco\n@@ -6850,17 +6850,20 @@\n  = 0; l \n-%3C\n+<\n  inputSt\n@@ -6883,21 +6883,40 @@\n ; l++) %7B\n-%0A    \n+%3Cbr%3E%0A    \n letter =\n@@ -6938,21 +6938,40 @@\n arAt(l);\n-%0A    \n+%3Cbr%3E%0A    \n // Get t\n@@ -7025,21 +7025,40 @@\n  %22aeiou%22\n-%0A    \n+%3Cbr%3E%0A    \n posOfLet\n@@ -7087,20 +7087,34 @@\n letter);\n-%0A   \n+%3Cbr%3E%0A   \n // Check\n@@ -7182,204 +7182,424 @@\n o -1\n-%0A    if(posOfLetter %3E= 0)%0A        groupOfVowels += %22aeiou%22.charAt(posOfLetter);%0A    else %7B%0A        posOfLetter = %22bcdfghjklmnpqrstvwxyz%22.indexOf(letter);%0A        if (posOfLetter %3E= 0)%0A            \n+%3Cbr%3E%0A    if(posOfLetter >= 0)%3Cbr%3E%0A        groupOfVowels += %22aeiou%22.charAt(posOfLetter);%3Cbr%3E%0A    else %7B%3Cbr%3E%0A        posOfLetter = %22bcdfghjklmnpqrstvwxyz%22.indexOf(letter);%3Cbr%3E%0A        if (posOfLetter >= 0)%3Cbr%3E%0A            \n grou\n@@ -7663,16 +7663,43 @@\n er);\n-%0A    %7D%0A%7D\n+%3Cbr%3E%0A    %7D%3Cbr%3E%0A%7D%3Cbr%3E\n %0ASys\n@@ -7768,16 +7768,20 @@\n Vowels);\n+%3Cbr%3E\n %0A%3C/code%3E\n@@ -7923,20 +7923,10 @@\n /p%3E%0A\n-%0A%3Ch2%3E%3Ccenter\n+%3Cp\n %3EThe\n@@ -7938,26 +7938,9 @@\n lt%3C/\n-center%3E%3C/h2%3E%0A%3Chr /\n+p\n %3E%0A%3Cp\n@@ -7963,16 +7963,20 @@\n  string:\n+%3Cbr%3E\n %0ALorem i\n@@ -8024,16 +8024,20 @@\n ng elit.\n+%3Cbr%3E\n %0AResult:\n@@ -8085,16 +8085,20 @@\n euaiiiei\n+%3Cbr%3E\n %0A%3C/code%3E\n@@ -8709,14 +8709,16 @@\n get=\n+%22\n _blank\n+%22\n %3EPra\n",
      "json_metadata": "{\"tags\":[\"java\",\"programming\",\"thirtydaychallenge\",\"day1\"],\"links\":[\"https://www.spelfabet.com.au/2015/04/the-difference-between-consonants-and-vowels/\",\"https://www.up-4ever.com/cx45a6btvccb\"],\"app\":\"steemit/0.1\",\"format\":\"html\"}",
      "parent_author": "",
      "parent_permlink": "java",
      "permlink": "30-days-of-coding-java-day-1-introduction",
      "title": "30 Days of Coding - Java: Day 1, Introduction"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2018-03-06T14:10:42",
  "trx_id": "f71b8a6b10c3c384e67f4a0ddbd201cc75c49165",
  "trx_in_block": 2,
  "virtual_op": 0
}

{
  "block": 20439948,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "30-days-of-coding-java-day-1-introduction",
      "voter": "jkazuto",
      "weight": 10000
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2018-03-06T14:09:48",
  "trx_id": "a77c00babc057a2743a148e265e24abb13a7e00a",
  "trx_in_block": 21,
  "virtual_op": 0
}

{
  "block": 20439948,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "<html>\n<h1><center>My own 30 days of coding challenge!</center></h1>\n<hr />\n<p>So today, I will start my own personal 30 day challenge and hopefully at the end of thischallenge I will learn even more and get even better in programming.</p>\n<p>For 30 days, I will create a piece of code everyday using Java programming language and NetBeans IDE for a total of 30 programs within this challenge (or more depending on my mood). I will explain what codes and stuff I've wrote and I will also share the codes with you and I will also upload the source project.</p>\n<p>I am doing this challenge to learn even more in the world of Java language, because it's been a year since I code using Java so I'm back to square zero(and I only know the basic of Java so this might start confusing at first because I forgot some syntax of it) and as what The great Roman leader Julius Caesar said,</p>\n<blockquote>Experience is the teacher of all things</blockquote>\n<p>and the good thing about it is that you don't have to pay this teacher of yours, absolutely free. I can't promise to post everyday since this month is so very busy for a graduating student like me but I will do my best to post everyday until the last day.</p>\n<p>So without further ado, let's get started with the first day right now!</p>\n<h2><center>Day 1: Segregating consonants to vowels</center></h2>\n<hr />\n<p>I've decided that for the first week of this challenge I'll do something easy, so I came up with disemvoweler!</p>\n<p><b>Name:</b> Disemvoweler<br />\n<b>Description:</b>\nThis program removes every vowels and whitespace found in a string. It should output the resulting disemvoweled string with the removed vowels concatenated to the end of it. <br />\n<b>Example:</b><br />\nInput: <em>Hello world</em><br />\nOutput: <em>hllwrld eoo</em></p>\n<hr />\n<p>So what I need to do for this to work is, to set the user-inputted string into the variable and have a for-loop for every letter of the strings(this excludes whitespaces and any other special characters) and check if it's a vowel or a consonant. Then after determining the letter's speech sounds, concatenate that letter into its corresponding consonant or vowel group variable. And Lastly, after the for-loop, print out the consonant and vowel group variables.</p>\n<p>Just so you know,<blockquote>vowels and consonants are sounds, not letters. Depending on your accent and how thinly you slice them, there are about 20 vowels and 24 consonants.</blockquote>\nSource: <a href=\"https://www.spelfabet.com.au/2015/04/the-difference-between-consonants-and-vowels/\">Vowels and Consonants are sounds, not letters | Spelfabet</a></p>\n<p>But let's stick to what we've used to know when we're on kindergarten, five vowels and the remaining are consonants. So yeah back to the topic!</p>\n<p>There are two methods that I came up with, one is the manual or the longer version and the second one is the easier version</p>\n\n<p><pre><b>General Variables:</b>\n<code>Scanner input;\nString inputString;\nString groupOfVowels;\nString groupOfConsonants;\nchar letter;\n</code></pre>\n</p>\n<p><pre><b>Variables for method 1:</b>\n<code>char[] vowels;\nchar[] consonants;\n</code></pre>\n</p>\n<p><pre><b>Variable for method 2:</b>\n<code>int posOfLetter;</code></pre>\n</p>\n\n<h2><center>Method 1</center></h2>\n<hr />\n<p>In this method we will manually checking whether the current selected letter in the given string is vowel or consonant using for-loop for every letter and another for-loop inside it for the checking and saving it into its corresponding variable.</p>\n<pre><code>Scanner input = new Scanner(System.in);\n\nString inputString;\nString groupOfVowels = \"\";\nString groupOfConsonants = \"\";\n\nchar letter;\nchar[] vowels = {'a', 'e', 'i', 'o', 'u'};\nchar[] consonants = {'b', 'c', 'd', 'f', 'g', 'h', 'j', 'k', 'l', 'm', 'n', 'p', 'q', 'r', 's', 't', 'v', 'w', 'x', 'y', 'z'};\n</code></pre>\n<p>We first initialized the variables that we will going to use. Please do note that we need to import the scanner first with <code>import java.util.Scanner</code></p>\n\n<pre><code>System.out.println(\"Enter a string:\");\ninputString = input.nextLine();\ninputString = inputString.toLowerCase();\n</code></pre>\n<p>This will let the user enter a string and save it in an <code>inputString</code> variable.</p>\n\n<pre><code>// Get every character in inputString and proceed\n// with another for-loop inside for both vowels and consonants.\nfor (int i = 0; i < inputString.length(); i++) {\n    // Get the character positioned at <em>i</em>th in the <em>inputString</em>.\n    letter = inputString.charAt(i);\n    // Check if <em>letter</em> is a vowel\n    for (int j = 0; j < vowels.length; j++) {\n        if (letter == vowels[j]) {\n            // If true then concatenate the letter in the <em>groupOfVowels</em> variable.\n            groupOfVowels += vowels[j];\n            break;\n        }\n    }\n    // Check if <em>letter</em> is a consonant\n    for (int k = 0; k < consonants.length; k++) {\n        if (letter == consonants[k]) {\n            // If true then concatenate the letter in the <em>groupOfConsonants</em> variable.\n            groupOfConsonants += consonants[k];\n            break;\n        }\n    }\n}\n</code></pre>\n<p>The <code>for-loop</code> and <code>if-condition</code> are used to check and compare the letter with each item in array list of <em>vowels/consonants</em> variables.</p>\n<pre><code>System.out.println(\"Result: \" + groupOfConsonants + \" \" + groupOfVowels);</code></pre>\n<p> And finally, print out the disemvoweled string.</p>\n\n<h2><center>Method 2</center></h2>\n<hr />\n<p>In this method, we will going to use the <code>indexOf()</code> method of Java. In this way we won't be needing the <em>char</em> variable for vowels and consonants and the <code>for-loop</code>.</p>\n<pre><code>Scanner input = new Scanner(System.in);\n\nString inputString;\nString groupOfVowels = \"\";\nString groupOfConsonants = \"\";\n\nchar letter;\nint posOfLetter;\n</code></pre>\n<p>Same as before but the different is we replaced the <code>char[] vowels</code> and <code>char[] consonants</code> with <code>int posOfLetter</code>.</p>\n\n<pre><code>for (int l = 0; l < inputString.length(); l++) {\n    letter = inputString.charAt(l);\n    // Get the position of compared letter in the string of \"aeiou\"\n    posOfLetter = \"aeiou\".indexOf(letter);\n   // Check if an index is found, if none, <em>posOfLetter</em> is set to -1\n    if(posOfLetter >= 0)\n        groupOfVowels += \"aeiou\".charAt(posOfLetter);\n    else {\n        posOfLetter = \"bcdfghjklmnpqrstvwxyz\".indexOf(letter);\n        if (posOfLetter >= 0)\n            groupOfConsonants += \"bcdfghjklmnpqrstvwxyz\".charAt(posOfLetter);\n    }\n}\nSystem.out.println(\"Result: \" + groupOfConsonants + \" \" + groupOfVowels);\n</code></pre>\n<p>As you can see, with the use of <code>indexOf()</code> we make our codes shorter and we only used one <code>for-loop</code>.</p>\n\n<h2><center>The Result</center></h2>\n<hr />\n<pre><code>Enter a string:\nLorem ipsum dolor sit amet, consectetur adipiscing elit.\nResult: lrmpsmdlrstmtcnscttrdpscnglt oeiuooiaeoeeuaiiiei\n</code></pre>\n<p>Note: In the result, only alphabets were shown and converted into lowercase. If you want to increase the difficulty, you can add another conditions for including special characters and concatenating it after the vowels.</p>\n<p>And that's it for the first day of the challenge! If you've come this far then a big thank you for you! Let me know in the comment of what should I do next and share your own version of disemvoweler if you can. Please upvote and resteem if you enjoy reading my post thank you.</p>\n<p>Download link for this project: <a href=\"https://www.up-4ever.com/cx45a6btvccb\" target=_blank>Practice 1 - Disemvoweler.rar - 16 KB</a></p>\n</html>",
      "json_metadata": "{\"tags\":[\"java\",\"programming\",\"thirtydaychallenge\",\"day1\"],\"links\":[\"https://www.spelfabet.com.au/2015/04/the-difference-between-consonants-and-vowels/\",\"https://www.up-4ever.com/cx45a6btvccb\"],\"app\":\"steemit/0.1\",\"format\":\"html\"}",
      "parent_author": "",
      "parent_permlink": "java",
      "permlink": "30-days-of-coding-java-day-1-introduction",
      "title": "30 Days of Coding - Java: Day 1, Introduction"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2018-03-06T14:09:48",
  "trx_id": "a77c00babc057a2743a148e265e24abb13a7e00a",
  "trx_in_block": 21,
  "virtual_op": 0
}

{
  "block": 18032644,
  "op": [
    "delegate_vesting_shares",
    {
      "delegatee": "jkazuto",
      "delegator": "steem",
      "vesting_shares": "28325.674132 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-12-12T22:23:03",
  "trx_id": "500c1ab2bb8974e373d1f7b210749b3a5e419086",
  "trx_in_block": 2,
  "virtual_op": 0
}

{
  "block": 16886675,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "the-story-of-my-life-life-in-the-philippines",
      "voter": "davidwilliams",
      "weight": 500
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-11-03T02:56:24",
  "trx_id": "13cdaa4e8c54edf08b9637229e343efeeeeabeff",
  "trx_in_block": 8,
  "virtual_op": 0
}

{
  "block": 16876273,
  "op": [
    "claim_reward_balance",
    {
      "account": "jkazuto",
      "reward_sbd": "0.662 SBD",
      "reward_steem": "0.000 STEEM",
      "reward_vests": "1412.076768 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-11-02T18:16:12",
  "trx_id": "b85f319adea4db3c3572677c4210401f309f7038",
  "trx_in_block": 1,
  "virtual_op": 0
}

{
  "block": 16870220,
  "op": [
    "author_reward",
    {
      "author": "jkazuto",
      "permlink": "re-surpassinggoogle-re-jkazuto-the-story-of-my-life-life-in-the-philippines-20171026t131315232z",
      "sbd_payout": "0.195 SBD",
      "steem_payout": "0.000 STEEM",
      "vesting_payout": "419.294779 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-11-02T13:13:27",
  "trx_id": "0000000000000000000000000000000000000000",
  "trx_in_block": 4294967295,
  "virtual_op": 3
}

{
  "block": 16847676,
  "op": [
    "author_reward",
    {
      "author": "jkazuto",
      "permlink": "the-story-of-my-life-life-in-the-philippines",
      "sbd_payout": "0.467 SBD",
      "steem_payout": "0.000 STEEM",
      "vesting_payout": "992.781989 VESTS"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-11-01T18:26:15",
  "trx_id": "0000000000000000000000000000000000000000",
  "trx_in_block": 4294967295,
  "virtual_op": 29
}

{
  "block": 16723328,
  "op": [
    "comment",
    {
      "author": "kromosoom",
      "body": "Hello! I can see that you have signed up recently so I thought I'd send my regards. There is an upvote for you and I hope you will some day do the same!\nAs you only recently joined the steemit community it can be hard to recieve lots of steem power so I suggest you to try out @MinnowPowerUp as you can earn up to 30% more steem power than just powering up with steem directly! It's a subscription based daily upvote bot that draws its power from a delegation pool. I have more info on my experience with the system in [__this post__](https://steemit.com/steemit/@kromosoom/how-to-invest-smartly-into-steem-power-and-how-to-buy-steem) where I explain how I earn over $1 a day from upvotes.",
      "json_metadata": "{\"app\": \"pysteem/0.5.4\"}",
      "parent_author": "jkazuto",
      "parent_permlink": "the-story-of-my-life-life-in-the-philippines",
      "permlink": "re-the-story-of-my-life-life-in-the-philippines-20171028t104752",
      "title": ""
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-28T10:47:51",
  "trx_id": "08b25e804063bee8294061907b7c69759716c9c2",
  "trx_in_block": 20,
  "virtual_op": 0
}

{
  "block": 16723328,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "the-story-of-my-life-life-in-the-philippines",
      "voter": "kromosoom",
      "weight": 100
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-28T10:47:51",
  "trx_id": "814b7dc4b93d984268e40636bcd7f364a2a40d8d",
  "trx_in_block": 12,
  "virtual_op": 0
}

{
  "block": 16674952,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "do-hyip-sites-are-all-but-scammers",
      "voter": "jkazuto",
      "weight": 10000
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-26T18:25:30",
  "trx_id": "b19c2e7028de91733e9719cdc78a20a62cf69f73",
  "trx_in_block": 22,
  "virtual_op": 0
}

{
  "block": 16674952,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "![](https://steemitimages.com/DQmRZ5D1KtZWhMZSV2AXUoYnt413jhr3k2KS6Jc9JJWyp2S/image.png)\n\nTo start things up, let's all first define HYIP shall we?\n\n### Google said that: ###\n> A high-yield investment program (HYIP) is a type of Ponzi scheme, an investment scam that promises an unsustainably high return on investment by paying previous investors with the money invested by new investors.\n\nMany people especially investors with less experience are not aware of that kind of scheme, they just invest money on a promising site that convinced them with high return in a shortest possible time but in reality will most likely to be scammed.\n\n---\n<center><h1>Pros and Cons of HYIP sites </h1></center>\n\n**Pros:**\n- The shortest possible way of earning money, big or small.\n- If you invest early you'll gonna milk plenty of money after the ROI.\n- Earn without investing, with the help of the magical **REFERRALS**. Let others throw some money at your hands while doing absolutely nothing!\n\n**Cons:**\n- You may never know when an HYIP site will be dead while running away with your money in their pockets.\n- Very risky! If you don't know what you're into then stop and go to a safer zone.\n\n---\n<center><h1>Risk taker? Get the most out of every HYIP sites </h1></center>\nIf you are one of the so-called *Risk Taker*, then I have some tips to share with you(and I also guess you already know it, if then, just pretend that you didn't).\n\n### When is the good time to invest in such HYIP site? ###\nFirst is to check the running days of an HYIP site, if it's running within 0-5 days and there are proofs that it's paying, go and invest on that site and take full advantage of its high profits. For example, let us say you saw a newly launched site on its 2nd day that offers a daily profit of 10%(A common offer of a common scam site) and it turns out that this site is actually paying in that time. You invested 0.01 BTC in it and then somehow it runs for a total of 30 days before it becomes dead and not paying anymore, your total profit plus the initial investment is a total of 0.03 BTC, not bad because it tripled your money. One thing to remember is to do a personal research of that site before investing.\n\n### When is the bad time to invest on HYIP? ###\nYou should not invest when a site is running beyond 10 days because the more the site lives the higher the risk it gets.\n\n### Refer many people as many as you can! ###\nThe best and old trick of an HYIP is through referrals, why? It encourages people to join on their site so that many new investors invest on it to have a larger money to run. If they have enough money or the registering user are getting lower than before, their site will collapse. Referrals are the best thing to get free money(yes, there are free money) if you want to be safe from getting scammed. \n> *With Great Active Referrals Comes Great Amount Of Money*\n\n---\n<center><h1>Do HYIP sites are all but scammers?</h1></center>\nMost of them are scammers, some of them are just listed as HYIP but actually was a sustainable site(I know one site that is living for almost 3 months and listed as the best HYIP out there and some say that it will live for many more months too). Just take this in mind that all HYIPs are risky if you don't know what you're doing then better to stop it right there before you regret it after. Many people still invest on it even though they are aware of HYIP because everyone has there own strategy to get extra money, risking what they have in order to have more than what they have(lol).\n\nSo to end this post, I would like to give you a piece of advice and a common one too;\n<center><i>\"Invest what you can afford to lose\"</i></center>\n\nThat's all for today! Thanks for taking time to read my post and also don't forget to upvote, comment and resteem this so that many people get aware with this kind of scheme. Hanggang sa muli! (See you next time!)",
      "json_metadata": "{\"tags\":[\"hyip\",\"invest\",\"risk\",\"information\",\"profit\"],\"image\":[\"https://steemitimages.com/DQmRZ5D1KtZWhMZSV2AXUoYnt413jhr3k2KS6Jc9JJWyp2S/image.png\"],\"app\":\"steemit/0.1\",\"format\":\"markdown\"}",
      "parent_author": "",
      "parent_permlink": "hyip",
      "permlink": "do-hyip-sites-are-all-but-scammers",
      "title": "Do HYIP sites are all but scammers?"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-26T18:25:30",
  "trx_id": "b19c2e7028de91733e9719cdc78a20a62cf69f73",
  "trx_in_block": 22,
  "virtual_op": 0
}

{
  "block": 16672939,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "@@ -4636,351 +4636,210 @@\n h3%3E%0A\n-Link: http://icounlimited.com/?ref=bestbtc%0ATo conclude, I suggest that you invest here while it's still early and also It will be very helpful for me if you sign up under me using my referral, they have a nice and quality looking site protected and secured from attacks, not cloud mining but ICO investing and only supports bitcoin as payment.\n+UPDATE: Unfortunately, this site was down way early than the common life span of HYIP sites(25-30 days)%0ASo to conclude. SCAM! Anyways I will not gonna delete the content of this post for a remembrance:)\n %0A%0A%3Cb\n",
      "json_metadata": "{\"tags\":[\"bitcoin\",\"invest\",\"ico\",\"unlimited\",\"scam\"],\"image\":[\"https://steemitimages.com/DQmVg4TLHR4Fs2yHNrYb9rr5tP4XqEC6GtbKHpfhG8FZAAe/image.png\",\"https://steemitimages.com/DQmQuRzQ6tGRwuqkfYpM623QhiCVi1aBAk5yd5Hsk11yG7F/image.png\",\"https://steemitimages.com/DQmRRkAfYDRhQkUVUJMEUknRT3ZVxkbo8uhwCFkypTAYoP9/image.png\",\"https://steemitimages.com/DQmP8ivmPLdoaeBscs3zFJXPuMTeSppmz7fxJRqdysk625j/image.png\",\"https://steemitimages.com/DQmZUDQb42LEyLtXmfhj5BoBcpWQgRTMReRFhCaBkKxTeze/image.png\",\"https://steemitimages.com/DQmboXo5jGddPSZQvKrqhRvQRytzAT42rC1gHSmGKSxaPeX/image.png\"],\"links\":[\"https://icounlimited.com/certificate.pdf\",\"https://beta.companieshouse.gov.uk/company/10980329\"],\"app\":\"steemit/0.1\",\"format\":\"markdown\"}",
      "parent_author": "",
      "parent_permlink": "bitcoin",
      "permlink": "ico-unlimited-another-btc-investment-program-10-15-daily-profit",
      "title": "ICO Unlimited Review Scam or Legit? - Another BTC Investment program, 10-15% Daily Profit!"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-26T16:44:51",
  "trx_id": "1d86f62f2d5bd5f4c2463c4804bf937b7e8fea4d",
  "trx_in_block": 0,
  "virtual_op": 0
}

{
  "block": 16672919,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "@@ -4636,351 +4636,210 @@\n h3%3E%0A\n-Link: http://icounlimited.com/?ref=bestbtc%0ATo conclude, I suggest that you invest here while it's still early and also It will be very helpful for me if you sign up under me using my referral, they have a nice and quality looking site protected and secured from attacks, not cloud mining but ICO investing and only supports bitcoin as payment.\n+UPDATE: Unfortunately, this site was down way early than the common life span of HYIP sites(25-30 days)%0ASo to conclude. SCAM! Anyways I will not gonna delete the content of this post for a remembrance:)\n %0A%0A%3Cb\n",
      "json_metadata": "{\"tags\":[\"bitcoin\",\"invest\",\"ico\",\"unlimited\",\"legit\"],\"image\":[\"https://steemitimages.com/DQmVg4TLHR4Fs2yHNrYb9rr5tP4XqEC6GtbKHpfhG8FZAAe/image.png\",\"https://steemitimages.com/DQmQuRzQ6tGRwuqkfYpM623QhiCVi1aBAk5yd5Hsk11yG7F/image.png\",\"https://steemitimages.com/DQmRRkAfYDRhQkUVUJMEUknRT3ZVxkbo8uhwCFkypTAYoP9/image.png\",\"https://steemitimages.com/DQmP8ivmPLdoaeBscs3zFJXPuMTeSppmz7fxJRqdysk625j/image.png\",\"https://steemitimages.com/DQmZUDQb42LEyLtXmfhj5BoBcpWQgRTMReRFhCaBkKxTeze/image.png\",\"https://steemitimages.com/DQmboXo5jGddPSZQvKrqhRvQRytzAT42rC1gHSmGKSxaPeX/image.png\"],\"links\":[\"https://icounlimited.com/certificate.pdf\",\"https://beta.companieshouse.gov.uk/company/10980329\"],\"app\":\"steemit/0.1\",\"format\":\"markdown\"}",
      "parent_author": "",
      "parent_permlink": "bitcoin",
      "permlink": "ico-unlimited-another-btc-investment-program-10-15-daily-profit",
      "title": "ICO Unlimited Review Scam or Legit? - Another BTC Investment program, 10-15% Daily Profit!"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-26T16:43:51",
  "trx_id": "7a6ea40cc4fb91d1373bba12296e4803a2b1e087",
  "trx_in_block": 17,
  "virtual_op": 0
}

{
  "block": 16672593,
  "op": [
    "vote",
    {
      "author": "surpassinggoogle",
      "permlink": "re-jkazuto-the-story-of-my-life-life-in-the-philippines-20171025t210659028z",
      "voter": "jkazuto",
      "weight": 10000
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-26T16:27:33",
  "trx_id": "0662e7bc4b4130f06664ae760be252419a9c5c75",
  "trx_in_block": 4,
  "virtual_op": 0
}

{
  "block": 16672571,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "@@ -380,16 +380,124 @@\n lippines\n+, I am not a sporty guy but I do love chess, playing guitar, practicing programming and playing Rubik's cube\n .  I am \n@@ -5880,127 +5880,8 @@\n ha. \n-Please upvote and also write your comment if you have any suggestion on what to post next XD or just a comment.. yeah. \n Than\n@@ -5900,9 +5900,25 @@\n  reading\n+ my introduction\n !\n",
      "json_metadata": "{\"tags\":[\"blog\",\"personal\",\"poverty\",\"philippines\",\"introduceyourself\"],\"app\":\"steemit/0.1\",\"format\":\"markdown\"}",
      "parent_author": "",
      "parent_permlink": "blog",
      "permlink": "the-story-of-my-life-life-in-the-philippines",
      "title": "Hello Everyone! This is the Story of My Life #introduceyourself"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-26T16:26:27",
  "trx_id": "2bccabdf66c8b4545e1a1e7ff24af8443c008f20",
  "trx_in_block": 7,
  "virtual_op": 0
}

{
  "block": 16669156,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "re-surpassinggoogle-re-jkazuto-the-story-of-my-life-life-in-the-philippines-20171026t131315232z",
      "voter": "surpassinggoogle",
      "weight": 100
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-26T13:35:42",
  "trx_id": "ecad4b3a0a21493b212044a7686764238f29daa0",
  "trx_in_block": 2,
  "virtual_op": 0
}

{
  "block": 16668711,
  "op": [
    "comment",
    {
      "author": "jkazuto",
      "body": "Thanks I will take a look on it!",
      "json_metadata": "{\"tags\":[\"blog\"],\"app\":\"steemit/0.1\"}",
      "parent_author": "surpassinggoogle",
      "parent_permlink": "re-jkazuto-the-story-of-my-life-life-in-the-philippines-20171025t210659028z",
      "permlink": "re-surpassinggoogle-re-jkazuto-the-story-of-my-life-life-in-the-philippines-20171026t131315232z",
      "title": ""
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-26T13:13:27",
  "trx_id": "d713d33ac913a63925363f7c064f80aa1e3fcbee",
  "trx_in_block": 2,
  "virtual_op": 0
}

{
  "block": 16649405,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "the-story-of-my-life-life-in-the-philippines",
      "voter": "raphaelle",
      "weight": 300
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-25T21:07:51",
  "trx_id": "32a45883f9453f0a9dba61e8dee93568a3ad0c03",
  "trx_in_block": 9,
  "virtual_op": 0
}

{
  "block": 16649388,
  "op": [
    "comment",
    {
      "author": "surpassinggoogle",
      "body": "People care and a lot too. Please visit my last post for some tips on how to perfect you #introduceyourself post",
      "json_metadata": "{\"tags\":[\"blog\",\"introduceyourself\"],\"app\":\"steemit/0.1\"}",
      "parent_author": "jkazuto",
      "parent_permlink": "the-story-of-my-life-life-in-the-philippines",
      "permlink": "re-jkazuto-the-story-of-my-life-life-in-the-philippines-20171025t210659028z",
      "title": ""
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-25T21:07:00",
  "trx_id": "e5cabaca530b20e27b3e31fee224a99e4278f56d",
  "trx_in_block": 19,
  "virtual_op": 0
}

{
  "block": 16649383,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "the-story-of-my-life-life-in-the-philippines",
      "voter": "arcange",
      "weight": 300
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-25T21:06:45",
  "trx_id": "8af832e05db2210e42735725d50cec83fb7f2a53",
  "trx_in_block": 16,
  "virtual_op": 0
}

{
  "block": 16649362,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "the-story-of-my-life-life-in-the-philippines",
      "voter": "surpassinggoogle",
      "weight": 300
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-25T21:05:42",
  "trx_id": "672472297ba10f82fdc86fedc3247e2f46d291f0",
  "trx_in_block": 13,
  "virtual_op": 0
}

{
  "block": 16647271,
  "op": [
    "vote",
    {
      "author": "jkazuto",
      "permlink": "the-story-of-my-life-life-in-the-philippines",
      "voter": "jeffdud",
      "weight": 500
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-25T19:21:09",
  "trx_id": "6b141f469eab610b9397726e96588886e98ce7c5",
  "trx_in_block": 6,
  "virtual_op": 0
}

{
  "block": 16646541,
  "op": [
    "vote",
    {
      "author": "surfermarly",
      "permlink": "4tehmd-what-would-you-attempt-to-do-if-you-knew-you-couldn-t-fail",
      "voter": "jkazuto",
      "weight": 10000
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-25T18:44:39",
  "trx_id": "4d84da57b7928b1836f7f7c6e18f55ca499a4afa",
  "trx_in_block": 20,
  "virtual_op": 0
}

{
  "block": 16646521,
  "op": [
    "vote",
    {
      "author": "exyle",
      "permlink": "babysitting-baby-sam-next-level-reached",
      "voter": "jkazuto",
      "weight": 10000
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-25T18:43:39",
  "trx_id": "a1c6428358bfc2951525b4e014c8c068355ecd1f",
  "trx_in_block": 5,
  "virtual_op": 0
}

{
  "block": 16646488,
  "op": [
    "vote",
    {
      "author": "papa-pepper",
      "permlink": "guess-who-s-coming-to-dinner",
      "voter": "jkazuto",
      "weight": 10000
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-25T18:42:00",
  "trx_id": "c102a88a28f86e3ea77d320152b2163001772d5e",
  "trx_in_block": 19,
  "virtual_op": 0
}

{
  "block": 16646355,
  "op": [
    "account_update",
    {
      "account": "jkazuto",
      "json_metadata": "{\"profile\":{\"name\":\"Mr. Kirito\",\"about\":\"Uhm, I don't know what to write here.\",\"location\":\"the Philippines\",\"profile_image\":\"https://orig00.deviantart.net/57fd/f/2014/231/2/e/kirito_by_shawnyall-d7vsiox.png\",\"cover_image\":\"http://www.baltana.com/files/wallpapers-5/Programmer-Wallpaper-17582.png\"}}",
      "memo_key": "STM8BHSTnAw89jHfMDkBWPToADCKSs7Rsvz3zYQfrh3hi2mrNUqkK"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-25T18:35:21",
  "trx_id": "df4ce611e7c4862954ae28ef94546da685e84d19",
  "trx_in_block": 4,
  "virtual_op": 0
}

{
  "block": 16646268,
  "op": [
    "account_update",
    {
      "account": "jkazuto",
      "json_metadata": "{\"profile\":{\"name\":\"Mr. Kirito\",\"about\":\"Uhm, I don't know what to write here.\",\"location\":\"the Philippines\"}}",
      "memo_key": "STM8BHSTnAw89jHfMDkBWPToADCKSs7Rsvz3zYQfrh3hi2mrNUqkK"
    }
  ],
  "op_in_trx": 0,
  "timestamp": "2017-10-25T18:31:00",
  "trx_id": "cd68ae0cf036e5db1aa23b4082e7effe8a6843d1",
  "trx_in_block": 2,
  "virtual_op": 0
}