codinghangover.wordpress.com
coding hangover | eat pray code :)eat pray code :)
http://codinghangover.wordpress.com/
eat pray code :)
http://codinghangover.wordpress.com/
TODAY'S RATING
>1,000,000
Date Range
HIGHEST TRAFFIC ON
Wednesday
LOAD TIME
3.6 seconds
16x16
32x32
PAGES IN
THIS WEBSITE
7
SSL
EXTERNAL LINKS
4
SITE IP
192.0.78.13
LOAD TIME
3.563 sec
SCORE
6.2
coding hangover | eat pray code :) | codinghangover.wordpress.com Reviews
https://codinghangover.wordpress.com
eat pray code :)
codinghangover.wordpress.com
Spoj (QUE1) Queue (Rookie) | coding hangover
https://codinghangover.wordpress.com/2015/03/25/spoj-que1-queue-rookie
Eat pray code :). Spoj (QUE1) Queue (Rookie). March 25, 2015. Problem link – http:/ www.spoj.com/problems/QUE1/. Vector of pairs is used to store the height and count of taller person standing before. This problem can be solved by sorting the vector based on height. Assign the final position for each person i in the answer array by moving them C empty positions from the index 0 where. C = count of taller person who are standing before person i. Detailed explanation is in the comments of the code below.
Codeforces #224 (Div. 2) C. Arithmetic Progression | coding hangover
https://codinghangover.wordpress.com/2015/03/21/codeforces-224-div-2-c-arithmetic-progression
Eat pray code :). Codeforces #224 (Div. 2) C. Arithmetic Progression. March 21, 2015. Problem link – http:/ codeforces.com/problemset/problem/382/C. Codeforces Beta Round #84 (Div. 1) A. Lucky Sum of Digits. Solving K-Palindrome problem using Edit distance algorithm →. Leave a Reply Cancel reply. Enter your comment here. Fill in your details below or click an icon to log in:. Address never made public). You are commenting using your WordPress.com account. ( Log Out. Notify me of new comments via email.
Spoj( ONEZERO ) – Ones and zeros | coding hangover
https://codinghangover.wordpress.com/2015/05/01/spoj-onezero-ones-and-zeros
Eat pray code :). Spoj( ONEZERO ) – Ones and zeros. May 1, 2015. Problem link: http:/ www.spoj.com/problems/ONEZERO/. Suppose the number that you want is X. X mod N = 0. So you need to store only N states i.e. 0 to n-1. Start with 1. Implement bfs approach. If the current state modulo is Y, append 0 to it i.e calculate Y*10 0 and find its modulo which will lead you to a new modulo state. Similary append 1 to Y. i.e calculate Y*10 1 and find its modulo. Consisting only of digits 1 and 0 beginning with 1).
Solving K-Palindrome problem using Edit distance algorithm | coding hangover
https://codinghangover.wordpress.com/2015/03/22/solving-k-palindrome-problem-using-edit-distance-algorithm
Eat pray code :). Solving K-Palindrome problem using Edit distance algorithm. March 22, 2015. A k-palindrome is a string which transforms into a palindrome on removing at most k characters. Given a string S, and an interger K, print “YES” if S is a k-palindrome; otherwise print “NO”. S has at most 20,000 characters. Input – abxa 1. Output – YES. Input – abdxa 1. Output – No. A string S is K-palindrome if editDistance(S,reverse(S) =2*K. This will be more clear with an example. Let S=madtam and K=1. Now th...
vishnujayvel | coding hangover
https://codinghangover.wordpress.com/author/vishnujayvel
Eat pray code :). Spoj( ONEZERO ) – Ones and zeros. May 1, 2015. Problem link: http:/ www.spoj.com/problems/ONEZERO/. Suppose the number that you want is X. X mod N = 0. So you need to store only N states i.e. 0 to n-1. Start with 1. Implement bfs approach. If the current state modulo is Y, append 0 to it i.e calculate Y*10 0 and find its modulo which will lead you to a new modulo state. Similary append 1 to Y. i.e calculate Y*10 1 and find its modulo. Consisting only of digits 1 and 0 beginning with 1).
TOTAL PAGES IN THIS WEBSITE
7
Welcome codinghacking.com - BlueHost.com
Web Hosting - courtesy of www.bluehost.com.
Welcome codinghacking.org - BlueHost.com
Web Hosting - courtesy of www.bluehost.com.
Coding Hamster Studio | The brains of a hamster... but a lot of cheek!
The brains of a hamster. but a lot of cheek! Welcome to Coding Hamster Studio. Mobile development for Android phones and tablets. First application released: Gem Genie. This casual game is a traditional “match 3″ game, where you have to move beautiful gems on a board to align 3 or more of the same colour, either vertically or horizontally. If you like the classic Bejeweled or Candy Crush, give Gem Genie a try! Gem Genie is 100% free, with no ads and no in app purchases. It is safe for everyone.
Блог Coding Hamster
Body записки о программировании, интернет-технологиях и немного о жизни /body /html. Обновление старых проектов до CodeIgniter 3. Если вам, так же как и мне, иногда приходится поддерживать проекты, написанные на фреймворке CodeIgniter версии. То возможно эта статья сможет облегчить вам жизнь. Дело в том, что последняя стабильная версия фреймворка была выпущена очень давно и многие даже успели его похоронить. Однако разработка, хоть и медленно, но продолжается. Более того, версия. Исходя из той логики, чт...
Coding Handyman
Sign up for a FREE. House Call" and we'll talk tech for all your big ideas. Custom code with a smile. Set up a free “House Call”. Set up a free “House Call”. You have big dreams. Don’t let technology hold you back. You have a vision for your business. Plans and ideas you know your clients will adore. But the technical side of it… sometimes you’re not sure how to make it all happen. Fix your website (quick! Get more details here. Convert your designs into websites. Not just WordPress, either).
coding hangover | eat pray code :)
Eat pray code :). Spoj( ONEZERO ) – Ones and zeros. May 1, 2015. Problem link: http:/ www.spoj.com/problems/ONEZERO/. Suppose the number that you want is X. X mod N = 0. So you need to store only N states i.e. 0 to n-1. Start with 1. Implement bfs approach. If the current state modulo is Y, append 0 to it i.e calculate Y*10 0 and find its modulo which will lead you to a new modulo state. Similary append 1 to Y. i.e calculate Y*10 1 and find its modulo. Consisting only of digits 1 and 0 beginning with 1).
Codinghappy.com
This domain may be for sale. Backorder this Domain. This Domain Name Has Expired - Renewal Instructions.
DK's Blog | Blogging down what I have learned and built…
FinanTrak – iPhone is Now Available. FinanTrak iPhone version is now available for download. Http:/ itunes.apple.com/us/app/finantrak/id491256295? FinanTrak – An Android App. I’ve developed a personal finance tracking application named FinanTrak. Its features include:. Multiple accounts, 4 account types. Charts, monthly budget, transactions verification. Backup and restore, export to CSV. Both full and free versions are available in the Android Market. Tags: 2d barcode validation. Android has a built-in ...
Coding Hard Knocks
The purpose and focus of this blog is capture years of lessons from my time spent doing and observing software development. I've spent years reading about OOP, Open Source, and Software Engineering. This blog is here to serve as a way to post random musings I wish somebody would have told me when I started out. Monday, November 10, 2008. There is no magic, only technology. A quote of Arthur C. Clark seems apropos:. Any sufficiently advanced technology is indistinguishable from magic. When your software c...
CodingHat » Which hat do you put on?
Which hat do you put on? I wrote “Resolved” on the fly, in a single session at the piano. Unlike some of my other songs, there was no preparation or planning, it just was the result of whatever came out. This made the song less cohesive and more sporadic than others, which is the feeling I was going for. I recorded it via …. Interestingly enough, this doesn’t apply to my life currently. It was just the image that came to mind at the time I played it. And the Graphene Theme.
SOCIAL ENGAGEMENT