<?xml version="1.0" encoding="utf-8" standalone="yes"?><urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:xhtml="http://www.w3.org/1999/xhtml"><url><loc>https://kodeknight.k5kc.com/page/array-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/backtracking-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/dnc-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/double-linkedlist-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/dp-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/graph-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/greedy-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/hashtable-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/heap-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/linkedlist-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/</loc><lastmod>2020-08-12T01:11:08+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/queue-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/randomized-algorithm-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/recursion-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/searching-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/singly-linkedlist-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/sorting-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/stack-index/</loc><lastmod>2020-08-12T01:11:08+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/tree-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/trie-index/</loc><lastmod>2020-08-12T01:06:05+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/about/</loc><lastmod>2020-08-06T00:50:37+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/algorithm-index/</loc><lastmod>2020-08-06T00:50:37+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/page/pagedown-resume/</loc><lastmod>2020-08-06T00:58:31+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/</loc><lastmod>2020-08-06T01:23:32+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2016/03/30/convert-string-to-zigzag-bottom-up/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/leetcode/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/post/</loc><lastmod>2020-08-12T01:11:08+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/string/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/</loc><lastmod>2020-08-12T01:11:08+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/zigzag/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/algorithmanalysis/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/algorithms/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2016/03/11/asymptotic-notation/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2016/03/11/growth-rate-importance-of-asymptotics/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/binary-search-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/bst/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/09/04/given-bst-with-2-nodes-swapped-fix-it/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/inorder/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/bank-bazaar/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/count/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/09/04/given-binary-search-tree-with-2-nodes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/inorder-traversal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/binary-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/bt/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/distance/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/09/04/for-given-node-of-binary-tree-print-k/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/k-distance/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/kodeknight/</loc><lastmod>2020-08-12T01:11:08+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/09/04/print-all-nodes-that-are-at-distance-k/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/09/04/find-distance-between-2-nodes-in-binary-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/09/04/find-distance-between-2-nodes-in-binary/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/lca/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/least-common-ancestor/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/09/04/program-to-count-leaf-nodes-in-binary/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/06/26/friend-circle-hackerrank/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/hackerrank/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/incomplete/</loc><lastmod>2020-08-12T01:11:08+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/interview-question/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/06/10/lazy-caterer/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/mathematics/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/dp/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/dynamic-programming/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/gist/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/06/02/lego-blocks-problem/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/jabong/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/05/25/k-reverse-linked-list-with-increasing-k/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/link-list/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/reverse/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/single-link-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/conversion/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/05/16/convert-binary-tree-to-doubly-linked/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/dll/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/doubly-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/directi/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/kadane/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/05/03/maximize-number-of-magical-gems-by/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/05/03/number-of-steps-required-to-convert/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/product/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/05/03/find-least-wastage-in-cutting-trees/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/05/03/implement-function-similar-to-diff/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/vmware/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/array/</loc><lastmod>2020-08-12T01:11:08+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/divide-and-conquer/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/max/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/maxima/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/04/30/maximum-single-sell-profit/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/minima/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/stock/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/04/18/reverse-doubly-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/04/18/doubly-linked-list-adt/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/04/17/find-largest-subarray-with-sum-of-0-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/sub-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/sum/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/04/17/einsteens-5-house-riddle/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/04/17/find-maximum-distance-covered-using-n/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/puzzles/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/angular/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2015/02/17/angular-js-interview-questions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/page/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/ux/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/11/21/foldable-binary-trees-given-binary-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/amazon/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/10/18/given-node-in-binary-tree-check-if-left/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/abstract-data-type/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/adt/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/queue/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/10/17/queue-adt/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/09/23/maximum-number-of-chickens-you-cannot/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/30/union-and-intersection-of-two-unsorted/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/linked-list/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/merge/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/merge-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/two-lists/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/unsorted-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/30/union-and-intersection-of-two-sorted/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/adobe/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/intersection/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/two-sorted-arrays/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/union/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/30/given-two-strings-str1-and-str2-write/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/two-string/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/unique/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/30/algorithm-interview-questions-set-1/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/interview-set/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/30/design-questions-set-1/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/29/given-array-arr-find-maximum-j-i-such-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/29/given-array-arr-find-maximum-j-i-such/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/sorting/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/27/finding-ip-address-from-hostname-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/differences/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/linux/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/skip-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/25/skiplist-vs-binary-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/unix/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/concurrency/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/data-structure/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/25/skiplists/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/crackingthecodinginterview/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/hard/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/24/max-submatrix-sum-in-matrix/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/24/find-max-subsquare-whose-border-values/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/bfs/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/graph/</loc><lastmod>2020-08-07T21:03:10+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/shortest-path/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/24/transform-one-word-into-another-by/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/pattern-matching/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/23/search-long-string-for-small-strings-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/stringalgo/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/suffix-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/23/pattern-searching-boyer-moore-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/23/searching-patterns-finite-automata/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/23/rabin-karp-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/23/suffix-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/23/suffix-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/23/longest-word-made-of-other-words-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/23/find-largest-1m-numbers-in-1b-numbers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/min/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/23/shortest-distances-between-two-words-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/22/count-number-of-2s-between-0-and-n/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/random/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/22/randomly-generate-m-integers-from-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/18/find-pairs-of-integers-in-array-that/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/moderate/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/18/implement-rand7-using-rand5/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/understand/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/18/complexity-or-analysis-of-algorithms/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/18/variables-and-data-types-introduction/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/18/encode-xml/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/18/find-frequency-of-word-in-book/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/18/generate-english-phrase-that-describes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/18/game-of-master-mind/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/bits/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/18/find-maximum-of-two-numbers-without-use/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/18/number-of-trailing-zeros-in-factorial/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/07/18/check-if-someone-has-won-tic-tac-toe/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/06/25/given-post-order-array-find-if-tree-is/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/postorder/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/06/15/skiplist-toc/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/brainteaser/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/06/13/road-race/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/06/12/sum-of-hats/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/06/12/coins-on-table-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/06/12/coins-on-table/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/06/12/40-pounds-in-balance/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/06/12/crazy-guy-in-airplane/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/level-order-traversal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/morgan-stanley/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/06/12/print-binary-tree-in-level-order-with/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/06/12/given-array-filled-with-char-elements/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/06/11/monty-hall-problem-choose-correct-door/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/cigars-on-circular-table/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/measure-45-minutes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/cards-with-vowel-even-number/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/wire-connections/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/old-monks/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/handshakes-at-party/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/key-exchange-puzzle/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/russian-roulette/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/cut-rectangular-cake/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/rope-around-earth/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/the-devil-colored-hats/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/black-and-white-hats-who-knows-what-he/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/prisoners-and-boxes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/prisoner-and-lightbulb/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/travelling-monk/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/leap-year-birthday/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/crossing-bridge-past-guard/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/newyork-hair-pigeonhole-principle/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/paying-with-rings/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/problem-king-has-100-identical-servants/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/truth-or-lies/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/engineers-managers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/worm-crawls/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/11/the-knights-tour-is-famous-chess/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/given-9-dots-draw-4-lines-without/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/putting-numbers-in-3x3-matrix-st-rows/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/robots-on-line/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/brothers-and-sisters/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/arithematicpuzzle/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/using-55555-can-you-make-37-along-with/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/make-3-3-7-7-equal-to-24-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/make-3-3-7-7-equal-to-24/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/cards-in-dark/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/islanders-with-dotted-forheads/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/get-job-puzzle/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/atm-money-withdrawal-limit/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/number-8-boxes-so-taht-no-consecutive-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/number-8-boxes-so-taht-no-consecutive/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/minimum-sips/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/aeroplanes-round-world/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/river-soldiers-boat-and-children/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/measure-weights-in-balance/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/last-ball-of-red-balls-blue-balls/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/medium/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/problem-casino-offers-card-game-using/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/honest-man-and-single-question/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/10/elephant-and-bananas/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/09/why-does-mirror-lies-sometimes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/07/average-salary-of-n-people-in-room/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/yahoo/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/coordinate-geometry/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/maths/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/microsoft/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/07/point-inside-triangle-or-not/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/07/triangle-formation/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/07/find-average-of-n-numbers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/overflow/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/07/fill-magic-square-of-size-n-n-being-odd/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/06/ctrla-ctrlc-ctrlv-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/06/ctrla-ctrlc-ctrlv/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/google/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/number-theory/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/06/guess-solution-of-selecting-4-balls/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/06/point-inside-rectangle-or-not/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/06/given-number-x-less-than-100-how-will/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/probability/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/06/given-number-123456789-two-opearators/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/06/form-circle-from-3-points/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/06/how-many-time-function-gets-called/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/number/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/06/polite-numbers-calculate-all-ways-such/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/average/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/06/find-average-of-stream-of-numbers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/stream/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/06/print-all-sequences-of-given-length/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/recursion/</loc><lastmod>2020-08-07T21:03:10+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/sequence/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/05/number-of-subsets-without-consecutive/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/permutation-and-combination/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/05/maximum-subset-of-cuboid-boxes-that-can/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/05/rest-vs-rpc/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/web/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/05/a-needle-in-haystack/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/kmp-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/game/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/05/match-two-board-configurations-of-tic/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/05/given-set-of-numbers-1-n-subsets-such/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/subset/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/05/petrol-bunk-in-circle/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/backtracking/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/04/get-sentence-from-raw-text-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/04/get-sentence-from-raw-text/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/java-code/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/parse/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/04/count-number-of-digits-in-number/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/04/finding-next-palindrome-for-given-number-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/04/finding-next-palindrome-for-given-number/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/palindrome/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/04/given-push-and-pop-sequence-on-stack/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/stack/</loc><lastmod>2020-08-12T01:11:08+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/03/data-structure-and-algorithm-interview/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/java/</loc><lastmod>2020-08-12T01:11:08+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/memory-management/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/02/memory-requirement-of-program-in-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/02/hash-functions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/hashes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/hashtable/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/02/symbol-table-data-structure/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/02/fit-12-dominos-in-2n-strip/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/02/atomicity-and-atomic-operations/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/operating-system/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/os/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/threads-and-locks/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/selection/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/01/selection-algorithms/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/01/deterministic-selection-select-i-th/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/kth-largest/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/largest/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/randomized-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/smallest/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/01/find-kth-largest-element-from-2-d/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/snapdeal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/05/01/matching-nuts-and-bolts-when-nuts/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/partition/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/quicksort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/17/cracking-coding-interview-questions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/17/solve-towers-of-hanoi-using-stack/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/17/find-nearest-numbers-that-have-same/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/15/can-two-threads-call-synchronized/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/15/scheduling-method-calls-in-sequence/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/15/thread-safe-and-exception-safe/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/15/how-to-measure-time-spent-in-context/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/inmobi/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/14/suggest-selling-time-and-buying-time-of/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/contiguous/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/13/maximum-product-sub-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/13/set-cover/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/create-rev-function-from-swap/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/is-there-multiply-function-in-8085/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/stone-thrown-from-boat/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/number-of-rectangles-in-mxn-matrix/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/three-children/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/question-completely-black-dog-was/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/inhereting-wealth-from-wise-sheikh/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/book-worm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/alarm-clock-with-snooze-interval-of-9/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/the-u2-riddle/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/eggs-on-slanted-roof/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/eye-color-of-bus-driver/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/the-missing-dollar/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/what-is-special-about-following/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/get-matching-pair-out-from-12-pair-of/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/by-moving-one-of-following-digits-make/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/companies/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/11/find-longest-oscillating-subsequence/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/greedy-algo/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/balanced-trees/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/10/find-appropriate-data-structure/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/quiz/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/10/common-routing-protocol/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/10/compare-and-contrast-ipv4-and-ipv6/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/networking/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/10/what-is-networksubnet-mask/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/09/what-happens-after-typing-url-into/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/trie/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/09/trie-tutorial/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/08/allocate-two-dimensional-array-using/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/low-level/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/08/aligned-malloc-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/08/device-fifo-queue-problem/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/08/prevent-reverse-engineering-of-dlls/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/08/how-to-make-sure-process-doesnt-access/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/08/what-happens-after-user-presses-key-on/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/08/direct-memory-accessdma/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/dynamic-allocation/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/08/branch-target-buffer/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/07/virtual-memory-page-fault-and-thrashing/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/06/how-to-swap-two-string-variables-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/swap/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/database/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/db-design/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/06/er-diagram-for-database-of-company-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/06/er-diagram-for-database-of-company/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/06/what-is-denormalization/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/05/count-number-of-calls-of-put-and-get/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/05/object-reflection-in-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/05/final-finally-and-finalize-in-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/05/finally-block-and-return-statement/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/05/private-constructor-in-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/cpp/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/05/smart-pointer-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/05/take-pointer-to-node-structure-as/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/duplicate/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/search/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/04/searching-questions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/04/find-duplicate-element-most-number-of/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/ranged-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/destructor/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/04/destructor-in-base-class-needed-to-be/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/virtual-function/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/c/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/04/volatile-keyword-in-c-and-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/04/deep-copy-and-shallow-copy-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/04/find-all-words-of-length-n-which-are/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/03/virtual-functions-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/03/compare-and-contrast-hash-table-vs-stl/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/03/print-last-k-lines-of-file-using-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/03/how-to-detect-duplicate-documents-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/limited-memory/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/system-design-and-memory-limits/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/03/design-database-with-terabytes-of-data/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/companies/</loc><lastmod>2020-08-11T08:58:52+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/difficulty/</loc><lastmod>2020-08-11T08:58:52+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/difficulty/easy/</loc><lastmod>2020-08-11T08:58:52+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/companies/fab/</loc><lastmod>2020-08-11T08:58:52+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/factorization/</loc><lastmod>2020-08-11T08:58:52+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/03/fizz-buzz/</loc><lastmod>2020-08-07T21:03:10+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/03/fizz-buzz/</loc><lastmod>2020-08-11T08:58:52+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/prime/</loc><lastmod>2020-08-11T08:58:52+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/prime-factor/</loc><lastmod>2020-08-11T08:58:52+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/celebrity/</loc><lastmod>2020-08-07T21:03:10+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/02/finding-celebrity-group/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/02/the-celebrity-problem/</loc><lastmod>2020-08-07T21:03:10+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/01/how-to-avoid-getting-into-infinite/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/01/find-duplicate-elements-in-array-with/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/bit-vector/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/01/generate-integer-which-is-not-in-file/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/external-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/01/sorting-10-gb-file-of-integer-with/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/vdopia/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/01/how-to-test-atm-in-distributed-banking/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/testing/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/01/how-to-test-pen/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/01/load-test-webpage-without-using-any/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/01/how-to-test-canmovetoint-x-int-y-method/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/04/01/find-mistakes-in-code/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/31/programming-errors-cause-program/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/31/check-if-array-contains-duplicates/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/31/find-duplicates-in-ranged-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/31/find-two-repeating-elements-in-ranged/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/31/find-two-non-repeating-elements-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/30/find-kth-number-with-prime-factors-3-5/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/30/find-line-which-passes-most-number-of/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/30/find-line-to-cut-two-squares-in-half/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/mathematical/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/30/implement-and-operators-using-only/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/implementoperatorwithconditions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/30/determine-whether-two-lines-would/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/30/one-shot-or-at-least-two-shots-in-three/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/30/three-gods-god-of-truth-lies-and-chaos/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/aptitude/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/30/labour-and-work-problem-20-women/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/29/circus-tower-sorting-problem/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/sorting-and-searching/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/binary-search/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/29/searching-in-sorted-array-of-strings/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/28/sorting-2gb-file-with-one-string-per/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/anagrams/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/compare/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/28/sort-array-of-strings-so-that-anagrams/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/28/merge-two-sorted-arrays-one-having-big/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/sorted-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/two-arrays/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/chess/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/28/eight-queen-puzzle-likewise-n-queen/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/queen/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/coin/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/28/number-of-ways-of-representing-n-cents/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/28/implement-paint-fill-function/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/28/print-all-combinations-of-n-balanced/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/parentheses/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/2darray/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/27/latin-square-and-its-implementation/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/matrix/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/permutation/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/27/permutations-of-every-subset-of-size-k/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/26/all-possible-paths-for-robot-moving/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/26/how-many-lockers-are-open-after-100/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/squares/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/26/two-egg-puzzle/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/geometric-search/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/git/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/github/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/interval/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/26/interval-search-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/26/segment-trees-vs-interval-trees-vs/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/26/merge-overlapping-intervals/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/26/how-long-does-it-take-to-remove-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/25/remove-duplicates-from-unsorted-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/remove-duplicates/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/25/number-of-unique-elements-in-sorted/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/25/get-4qt-of-water-using-5qt-jug-and-3qt/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/25/covering-chess-board-with-dominos/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/25/sieve-of-atkins/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/25/algorithm-to-find-out-number-of-factors/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/factor/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/25/program-to-print-all-prime-factors-of/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/24/to-find-list-of-primes-till-n/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/24/sieve-of-eratosthenes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/24/efficient-ways-to-check-if-number-is/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/flipkart/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/24/given-series-2345689101215-where/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/24/check-if-2-trees-are-iso-morphic/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/24/check-if-any-number-exists-in-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/24/swap-odd-and-even-bits-in-integer/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/24/avid-tv-watcher/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/24/find-missing-integer-in-array-with-only/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/23/division-without-using-or-divide-two/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/23/count-total-set-bits-in-all-numbers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/23/next-power-of-2/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/23/count-number-of-bits-to-be-flipped-to/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/xor/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/references/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/resources/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/23/some-useful-resources/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/23/explain-n-n-1-0/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/powerof2/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/zero/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/21/print-binary-representation-of-decimal-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/21/print-binary-representation-of-decimal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/21/you-have-two-very-large-binary-trees-t1/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/21/print-all-paths-in-binary-tree-which/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/21/finding-biggest-difference-between/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/21/set-all-bits-of-number-in-range-equal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/21/add-arithmetic-operators-to-make-3-1-3/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/21/find-all-pairs-x-y-in-sorted-array-so/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/19/divide-number-by-3-without-using/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/19/add-two-numbers-without-using/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/operators/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/19/divide-number-by-3-without-using-any-of/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/19/add-1-to-given-number-without/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/19/strings-index/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/maze/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/projecteuler/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/19/unique-paths-in-2d-grid/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/03/19/implement-stack-using-queue/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/27/find-local-minimum-in-unsorted-array-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/27/find-local-minimum-in-unsorted-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/local-minima/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/26/sorted-linked-list-to-balanced-bst/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/sorted-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/26/convert-sorted-array-to-bst/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/19/implement-stack-using-2-queues/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/minmax/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/o1/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/19/stack-with-find-minfind-max-in-o1-time/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/16/algorithm-introduction/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/theory/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/2dsortedarray/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/16/find-minimum-and-maximum-in-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/16/find-maximum-value-in-unsorted-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/14/find-nth-largest-in-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/14/find-out-largest-and-second-largest-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/14/find-out-largest-and-second-largest/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/second-largest/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/browserstack/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/14/how-to-find-max-and-min-in-array-using/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/13/determine-if-small-tree-t2-is-subtree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/10/create-linked-lists-of-all-nodes-at/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/connectivity/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/directed-graph/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/09/find-if-there-is-path-between-two-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/09/find-if-there-is-path-between-two/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/fibonacci/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/09/how-to-check-whether-given-number-n/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/09/find-next-higher-number-using-exact/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/next-big-number/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/08/stack-of-plates/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/07/implementing-2-stacks-in-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/binary-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/boolean/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/06/provide-algorithm-such-that-if-element/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/05/rotate-n-n-matrix-by-90-degrees-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/05/rotate-n-n-matrix-by-90-degrees/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/02/04/determine-if-string-has-all-unique/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/28/algorithm-to-find-top-10-search-terms/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/big-data/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/map-reduce/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/cache/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/28/find-k-most-frequent-words-from-file/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/24/given-binary-tree-with-extra-field-next/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/inorder-successor/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/23/data-structure-to-emulate-lru-cache/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/22/print-nodes-at-k-distance-from-root/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/22/algorithm-to-find-time-period-where/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/range/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/sweep-line/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/counting-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/22/given-array-of-100000-pixel-color/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/integer-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/bubble-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/insertion-sort-on-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/insertion-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/selection-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/selection-sort-on-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/sort-linked-list-using-bubble-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/sort-linked-list-using-quick-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/bubble-sort-on-double-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/sort-linked-list-using-merge-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/whats-fastest-algorithm-for-sorting/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/find-increasing-3-tuple-sub-sequence/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/increasing-sequence/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/subsequence/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/merge-two-arrays-efficiently-one-sorted/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/sorting-implementation-in-c_19/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/toc2/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/avl/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/rbt/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/red-black-tree-vs-avl-tree-vs-b-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/red-black-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/union-find/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/union-find/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/bottom-up/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/bottom-up-merge-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/top-down/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/bitonic/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/given-integer-array-of-which-both-first/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/amazon-questions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/19/k-way-merge-merging-k-sorted-arrays-of/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/min-heap/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/18/find-maximum-repeating-number-in-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/18/finding-max-repeated-element-in-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/encoding/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/frequency/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/18/print-letters-followed-by-their/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/18/remove-duplicate-characters-in-string/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/18/find-first-non-repeating-character-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/18/c-program-to-reverse-string/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/18/eliminate-pairs-two-same-chars-adjacent/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/18/move-spaces-to-front-of-string/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/spaces/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/calloc/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/malloc/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/replace/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/18/replace-all-spaces-in-string-with-20/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/18/how-many-possible-ways-child-can-run-up/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/17/find-row-with-maximum-number-of-1s-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/17/company-specific-interviews/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/17/find-position-of-only-set-bit/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/17/checking-if-bit-is-on-or-off-without/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/17/toggle-specified-bit-in-bit-string/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/17/divide-number-by-power-of-two-using-bit/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/17/multiply-number-by-power-of-two-using/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/17/find-largest-binary-search-tree-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/17/binary-tree-to-binary-search-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/17/write-code-to-find-nth-largest-number/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/17/given-stream-of-characters-find-kth-non-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/17/given-stream-of-characters-find-kth-non/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/2sum/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/17/find-all-pythagorean-triplets-in-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/pythagorean-triplet/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2014/01/17/3-sum-problem/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/deque/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/facebook/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/11/12/maximum-value-in-sliding-window/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/priorityqueue/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/window/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/11/09/container-with-most-water/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/11/09/arrays-index/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/11/05/maximum-weight-independent-set-wis/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/11/05/sequence-alignment-using-dynamic/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/10/21/application-of-clustering_21/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/graph-search/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/10/19/minimum-spanning-tree-mst/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/minimum-spanning-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/mst/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/spanning-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/10/05/binary-tree-level-order-traversal-using/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/dfs/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/traversal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/10/05/binary-tree-post-order-traversal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/postorder-traversal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/10/05/binary-search-tree-in-order-traversal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/10/05/find-rank-wrt-k-number-of-nodes-with/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/09/10/iterators-allowing-iteration-over-data/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/generic-classes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/09/10/generic-data-structures-in-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/application/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/09/10/evaluating-postfix-expression-using/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/09/10/converting-infix-expression-to-postfix/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/09/10/checking-whether-paranthesis-are/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/amortize/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/09/10/resizing-array-implementation-of-stack/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/time-complexity/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/09/09/introduction-of-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/30/find-four-elements-in-array-whose-sum/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/25/balanced-binary-search-tree-index/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/25/avl-tree-index-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/25/avl-tree-index/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/25/bfs-breadth-first-search-on-graph/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/25/dfs-depth-first-search-for-graph/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/25/dijkstras-algorithm-for-equal-weight/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/undirected-graph/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/24/deleting-element-from-heap/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/heap/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/24/application-of-heap-in-computer-science/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/24/building-of-heap/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/24/array-implementation-of-heap-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/24/array-implementation-of-heap/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/arraysearch/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/24/find-nth-largest-element-in-rotated-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/24/find-nth-largest-element-in-rotated/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/rotated-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/24/find-rotation-count-in-rotated-sorted/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/24/random-contraction-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/24/graph-representations/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/22/cuts-of-graphs/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/14/integer-multiplication-using-karatsuba/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/master-method/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/multiplication/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/13/red-black-tree-index/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/11/data-type-in-data-structure/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/data-types/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/11/pathological-data-sets-and-universal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/10/hash-tables/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/10/given-dictionary-of-word-group-all/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/09/splay-trees/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/09/boyer-moore-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/string-search/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/binary-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/comparison-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/radix-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/shell-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/09/sorting/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/09/tower-of-hanoi-problem/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/08/implementing-doubly-linked-list-using/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/pointers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/08/rearranging-linked-list-first-odd-next/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/07/getmin-and-getmax-in-bst/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/07/binary-tree-and-its-types/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/07/linear-search-on-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/06/randomized-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/06/bellman-ford-algorithm-one-source/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/04/strongly-connected-graph/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/04/topological-sorting/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/04/minimum-cut-problem/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/cut/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/mincut/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/04/closest-pair-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/plane/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/04/selecting-ith-smallest-element/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/04/meaning-behind-master-method/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/time/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/04/master-method-for-solving-recurrences/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/omega-time-complexity/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/04/strassens-subcubic-matrix/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/matrix-multiplication/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/inversion/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/04/inversions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/04/bfs-and-undirected-connectivity/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/04/dijkstras-shortest-path-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/adjacency/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/04/adjacency-list-represention-of-graph-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/adjacencylist/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/03/graph-search-introduction/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/03/how-do-i-check-if-number-is-palindrome-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/08/03/how-do-i-check-if-number-is-palindrome/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/integer/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/operation-time-complexity-for-linked/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/operation-time-complexity-for-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/operations/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/time-complexity-omega-of-algorithms/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/time-complexity-of-algorithms-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/asymptoticupperbound/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/big-omega/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/if-statement/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/looping-construct/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/sequential-statement/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/string-searching-algorithm-kmp-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/match-string/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/search-string/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/data-structures/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/ds/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/priority-queue/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/non-linear-datastrucutre/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/what-is-non-linear-datastructure/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/linear-datastructure/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/sorting-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/what-is-linear-datastructure/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/what-is-sorting-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/insertion-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/introduction-to-heap/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/in-place-sorting/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/what-is-selection-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/sorting-arrays/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/bucket-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/distribution-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/what-is-bucket-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/non-linear-datastructure/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/what-is-graph-data-structure/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/graph-traversal-methods/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/breadth-first-traversal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/depth-first-traversal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/find-shortest-path-using-dijkstras/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/hashing-hash-data-structure-and-hash/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/complete-binary-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/what-is-complete-binary-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/30/binary-tree-traversal-preorder-inorder/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/preorder/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/preorder-traversal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/29/data-structure-introduction/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/29/about/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/29/legal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/circular-stack/</loc><lastmod>2020-08-12T01:11:08+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2013/07/29/circular-stack-implementation/</loc><lastmod>2020-08-12T01:11:08+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/07/red-black-tree-insertion/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/07/red-black-tree-deletion/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/07/bloom-filter/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/avl-tree-deleting-node-from-avl-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/avl-tree-rotations/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/bitonic-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/bidirectional-bubble-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/priority-queue-based-on-sorted-linked/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/fun/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/sorting-in-hungarian-way/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/how-to-rotate-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/given-integer-array-and-number-x-find-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/given-integer-array-and-number-x-find/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/pair/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/printing-hello-world-to-screen-without-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/printing-hello-world-to-screen-without/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/construct-full-binary-tree-from-pre/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/converting-integers-less-than-100-to/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/find-all-subsets-of-given-set-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/find-all-subsets-of-given-set/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/bit-manipulation-tips-tricks-part-2/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/06/bit-manipulation-tips-and-tricks-part-1/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/loop/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/removing-loop-in-singly-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/finding-integer-only-1-odd-occuring/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/integer-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/find-maximum-subarray-of-integer-array-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/find-maximum-subarray-of-integer-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/andersson-trees/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/arraydeque-stack-algorithms/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/sorted-linear-hash-table/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/search-trees/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/avl-trees/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/concurrent-skip-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/huffman-codes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/convert-bst-to-double-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/double-link-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/find-first-duplicated-integer-in-array-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/find-first-duplicated-integer-in-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/sorting-array-of-three-kinds-or-dutch/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/shuffle/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/how-to-shuffle-array-or-fisher-yates/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/find-local-maximum-of-function-using/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/least-square-linear-regression-of-data/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/convert-integers-to-roman-numbers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/check-if-integers-bit-representation-is/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/convert-binary-tree-to-double-linked/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/minimum-distance-between-two-elements/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/difference-between-sums-of-odd-and-even/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/find-common-nodes-from-two-linked-lists/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/y-shaped-linked-list-algorithm-to-find/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/removing-duplicate-from-link-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/print-sum-inclusive-of-root-of-sub-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/memoization/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/print-pascals-triangle/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/what-does-flattening-list-of-items-into/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/b-tree_05/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/b-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/b-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/05/btree-in-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/04/red-black-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/04/heap-sort-in-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/04/binary-heap-introduction/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/04/min-heap-removing-min-element/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/04/heap-inserting-element-into-heap/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/03/convert-array-of-positive-numbers-to/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/03/implement-addsubtractmultiplicationdivi/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/02/k-reverse-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/02/find-point-of-transition-from-0-to-1-in-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/02/find-point-of-transition-from-0-to-1-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/02/searching-element-in-sorted-infinite/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/knapsack-problem/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/02/minimum-number-of-coins-to-get/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/02/get-maximum-sum-from-coins-in-line/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/02/find-optimal-number-of-jumps-to-reach/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/02/max-possible-sum-of-non-consecutive-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/02/max-possible-sum-of-non-consecutive/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/02/maximum-size-square-sub-matrix-with-all/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/square-matrix/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/01/find-largest-sub-matrix-with-all-1s-not/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/rectangle/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/histogram/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/01/maximum-area-rectangle-in-histogram/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/01/iterative-or-non-recursive-inorder/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2012/01/01/dfs-depth-first-search-on-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/31/bfs-breadth-first-search-in-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/dijkshtra/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/31/how-will-you-check-if-s1-is-rotated/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/blog/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/31/syntax-highlighter-for-blogs/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/31/escape-all-characters-in-string-is/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/string-udf/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/delete/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/31/remove-whitespace-from-string-in-place-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/31/remove-whitespace-from-string-in-place/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/31/implementing-strcpy/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/31/implementing-strcat/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/31/implementing-strcmp/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/31/double-linked-list-structure/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/31/first-non-repeating-element-in-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/31/find-anagrams-in-array-of-strings/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/30/gold-bar-with-7-segments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/30/implementing-strstr-indexof-function/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/30/combination-of-all-possible-characters/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/concatenate/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/30/concatenate-n-strings-with-good/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/check/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/check-if-tree-is-balanced-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/catalan/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/some-stack-question/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/implement-3-stacks-in-1-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/implement-queue-in-which-pushrear/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/find-minimum-element-in-rotated-sorted-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/find-minimum-element-in-rotated-sorted/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/search-element-in-sorted-rotated-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/reverse-string-using-bits/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/pick-random-byte/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/three-switches/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/deleting-node-from-singly-linked-link/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/link-list-datastructure/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/calculate-length-of-linked-list-that/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/add-2-large-numbers-in-form-of-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/29/sorting-very-large-file-which-cannot/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/28/stack-ds-to-implement-constant-time/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/iterative/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/27/print-binary-tree-in-zig-zag-level/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/27/finding-start-of-loop-in-circular-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/27/finding-start-of-loop-in-circular/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/27/github-setup-ssh-permission-denied/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/25/karp-rabin-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/24/given-10-digit-numberfind-greatest/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/23/wap-to-find-number-of-divisor-sum-of/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/23/wap-to-find-diameter-of-binary-tree-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/23/wap-to-find-diameter-of-binary-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/interview/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/20/flipping-coins-on-table/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/20/how-to-reverse-stack-in-place/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/19/reaching-door-of-heaven/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/19/random-selection-from-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/19/use-some-datastructure-to-get-o1-stack/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/greater/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/19/next-greater-element-in-array-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/19/next-greater-element-in-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/19/folding-bsts/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/19/diameter-of-binary-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/19/remove-character-from-string1-which-are/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/18/longest-increasing-subsequence/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/hashmap/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/18/vertical-sum-of-binary-tree-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/18/vertical-sum-of-binary-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/18/prove-that-number-between-twin-primes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/twin-prime/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/18/can-you-properly-hotel-charges/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/18/passengers-and-random-seats/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/18/find-whether-given-number-n-is-of-form/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/18/fint-out-matching-socks/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/18/minimax-minmax-search/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/12/18/searching-in-2d-array-elements-being/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/09/find-first-occurrence-of-string-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/substring/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/09/row-consisting-max-continuous-chain-of/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/09/convert-number-unknown-base-to-base-10/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/09/majority-element-in-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/compression/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/09/encodeuricomponent-and/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/09/atoi-in-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/09/in-place-character-array-compression/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/09/itoa-in-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/09/trie-complexity/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/09/trie-searching-in-trie/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/09/trie-3-inserting-in-trie/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/09/implementing-trie-adt-in-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/09/trie-is-interesting-data-structure-used/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/08/globe-walker/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/08/trains-and-birds/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/08/gold-for-7-days-of-work/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/08/the-ant-collision-problem/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/08/is-your-husband-cheat/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/07/50-trucks-with-payload/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/07/camel-and-banana/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/07/red-green-and-yellow-balls-heavy-and/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/10/01/one-duplicate-one-missing-element-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/30/given-numbers-from-1-to-n1-with-number/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/30/find-smallest-window-in-string/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/26/deleting-node-in-singly-linked-list-if-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/26/deleting-node-in-singly-linked-list-if/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/26/duplicate-removal-in-binary-search-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/programcpp/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/26/squeeze-all-multiple-spaces-in-string/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/22/given-binary-tree-print-sum-inclusive_22/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/22/leveling-sectors-in-circle/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/lcs/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/22/to-find-longest-substring-with-unique/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/formatting-needed/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/19/write-c-program-to-reverse-words-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/19/palindrome-in-singly-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/fast-pointer/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/19/spiral-printing-of-two-dimensional/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/19/sum-of-two-long-positive-numbers-each/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/19/given-binary-tree-print-sum-inclusive/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/15/k-largestor-smallest-elements-in-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/14/advantage-and-disadvantage-of/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/median/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/13/median-of-2-sorted-arrays-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/13/median-of-2-sorted-arrays/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/11/find-median-of-linked-list-or-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/11/find-longest-palindrome-in-string-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/11/find-longest-palindrome-in-string/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/11/compare-two-string-literals/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/11/anagram-checkerto-check-if-2-strings-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/11/anagram-checkerto-check-if-2-strings/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/11/find-nth-largest-value-in-bst-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/11/find-nth-largest-value-in-bst/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/xml/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/11/xml-sequence-delimiter/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/11/counting-sort-in-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/11/sorting-stack-using-pushpopisempty-and/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/10/balanced-search-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/07/avl-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/07/implement-queue-using-two-stacks/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/07/how-to-reverse-doubly-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/07/permutation-of-string-in-java-efficient-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/09/07/permutation-of-string-in-java-efficient/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/06/09/what-is-data-structure/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/20/intersection-of-two-sorted-lists/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/combination/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/20/scrabble-algorithms/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/16/what-is-bst-or-binary-search-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/14/program-to-check-rectangle-overlapping-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/14/program-to-check-rectangle-overlapping/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/common-math-functions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/sum-factorial/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/udf/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/given-two-sorted-arrays-of-size-m-and-n/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/interview-questions-on-binary-search/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/bst-improving-search-by-using-sentinel/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/nth-node-in-inorder-traversal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/isbstwhether-tree-provided-is-bst-or/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/count-treesgiven-n-nodes-how-many/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/check-whether-binary-tree-are-same-or/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/identical/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/double-tree-such-that-insert-new/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/find-mirror-of-binary-search-tree-ie/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/mirror/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/root-to-leaf-path/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/path/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/print-binary-search-tree-in-increasing-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/print-binary-search-tree-in-increasing/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/find-minimum-data-value-find-in-binary/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/compute-maximum-depth-of-binary-search/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/getting-size-of-binary-search-tree-cpp/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/size/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/05/11/create-copy-of-tree-cpp/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/03/31/aa-tree-implementation-in-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/02/17/spatial-indexing-with-quadtrees-and/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/02/17/anagram-trees-part-2/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/02/17/anagram-trees/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/cryptography/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/02/17/secure-permutations-with-block-ciphers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/02/17/bk-treesal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2011/02/06/why-is-manhole-cover-circular/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/10/22/deleting-middle-node-from-single-linked/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/10/20/stack-implementation-using-arrays/</loc><lastmod>2020-08-12T01:11:08+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/10/20/stack-implementation-using-linkedlist/</loc><lastmod>2020-08-12T01:11:08+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/cppimpl/</loc><lastmod>2020-08-12T01:11:08+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/10/19/int-atoi-char-pstr/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/10/19/reverse-string-solution/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/10/19/the-circular-lake-monster-solution/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/10/18/arrays-tip-ignoring-zeroth-row/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/java-arrays/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/enum/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/21/enums-in-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/cpp-vs-java/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/18/modifying-java-variables-wrt-c-and-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/17/constructor-in-java-1/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/constructors/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/coding-style/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/17/common-naming-convention-coding-style/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/17/improving-coding-style-into-classes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/17/improving-coding-style-into-functions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/17/java-specific-naming-convention/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/17/specific-cases-of-naming-enhancing/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/16/java-and-cpp-differences-and/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/cleaner-code/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/01/types-of-constructors/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/01/stack-and-heap/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/01/word-length-frequency/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/console-input/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/input/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/programs/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/01/taking-input-as-string-1-c-string-to/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/stl/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/01/using-stl-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/01/enum-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/09/01/beginning-with-vi/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/text-editors/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/vi-editor/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/31/use-variable-closer-to-its-use/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/variables/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/dynamic-arrays/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/31/how-to-bound-check-arrays-in-cpp-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/vectors/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/file-handling/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/31/file-io-in-c-1/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/fileio/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/fileread/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/30/operator-better-practice-in-cpp/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/13/orthogonality/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/software-engg/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/13/longest-common-substring-revisited/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/13/troubleshooting-dns-servers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/cloud-computing/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/13/cloud-computing-and-virtualization/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/virtualization/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/12/virtualization/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/12/storage-virtualization/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/12/network-virtualization/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/09/self-reproducing-program-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/09/zero-sized-allocation-using-malloc/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/exit/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/09/return-and-exit-from-main-difference/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/08/pointer-cause-decay-references-do-not/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/07/references-and-constants/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/06/how-to-create-function-polymorphism-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/polymorphism/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/06/c-strings/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/06/writing-dll-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/05/c-stl-iterators-and-containers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/data-structure-templates/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/templates/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/05/bwt-burrows-wheeler-transform-encoding/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/05/socket-programming-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/04/memory-management-basics/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/04/memory-management-in-c-and-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/04/finding-time-of-execution-of-code-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/04/reducing-space-for-lcs-lengths/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/04/reading-from-file-or-reading-integers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/errors/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/04/exit-was-not-declared-in-this-scope/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/04/comparison-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/04/hirschbergs-linear-space-algorithm-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/04/hirschbergs-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/08/03/dynamic-programming-algorithm-dpa-for/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/dynamic-programming-practise-problem-3/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/longest-common-substring-problem/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/dynamic-programming-practise-problem-2/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/matrix-chain-multiplication/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/dynamic-programming-practise-problem-1/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/prims-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/kruskals-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/dynamic-programming-algorithm-for/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/activity-selection-problem-greedy/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/dijkstras-algorithm-shortest-path/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/dynamic-programming-solution-to-0-1/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/fibonacci-sequence-dynamic-programming/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/programming-questions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/solve-rat-in-maze-problem-using/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/representing-solution-space/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/balancing-scales/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/backtracking-algorithms/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/divide-and-conquer/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/optimal-substructure/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/05/overlapping-subproblems-in-dynamic/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/02/common-characterstics-in-dynamic/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/02/dynamic-programming/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/07/01/types-of-algorithms/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/important-ds-question/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/more-dynamic-programming/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/gcd-lcm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/how-do-you-sort-million-32-bit-integers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/maximum-index-of-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/missing-integers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/print-combinations/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/trie-examples/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/scrabble-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/permutations-and-combinations-of-string/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/tries/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/find-distinct-words-from-text-file/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/superstring/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/dfs-bfs-without-recurssion/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/fix-duplicates-in-sorted-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/print-all-word-combinations-from-phone/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/optimization/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/string-matching/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/sorting-binary-array-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/26/sorting-binary-array/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/10/write-c-program-to-reverse-stack-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/10/you-are-given-datatype-say-x-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/10/what-can-be-maximum-memory-that-process/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/10/what-should-be-done-when-exception/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/10/how-do-you-know-where-memory-leaks-when/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/10/wap-to-find-number-containing-all/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/10/wo-teen-women-wali-puzzle-ka-sol/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/10/how-to-chk-if-no-is-integer-or-not/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/10/print-1-100-noswithout-loop-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/10/write-c-program-which-when-compiled-and/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/10/ugly-numbers-are-numbers-whose-only/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/series/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/ugly-number/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/10/given-string-s1-and-string-s2-write/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/09/reverse-singly-linked-listeverse-singly/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/08/remove-duplicates-from-sorted-linked/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/08/insert-nodes-into-linked-list-in-sorted/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/08/return-nth-node-from-end-of-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/08/binary-search-on-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/08/c-program-to-free-nodes-of-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/08/copy-of-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/08/compare-two-linked-lists/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/middle/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/08/how-do-you-find-middle-of-linked-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/08/basic-functions-of-link-list/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/08/function-to-add-node-to-double-link/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/08/how-would-you-detect-loop-in-linked/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/08/comparing-floats/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/floating-point-values/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/04/04/solution-104-project-euler/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/03/27/simplified-ip-addressing/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/03/06/write-recursive-function-that-given/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/remember/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/03/04/some-cardinals/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/ds-concepts/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/29/tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/29/bst/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/threaded-binary-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/25/threaded-binary-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/25/construct-tree-given-its-inorder-and/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/expressions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/25/given-expression-tree-evaluate/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/25/find-closest-ancestor-of-two-nodes-in/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/24/iterative-traversal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/18/find-median-in-continous-stream-of/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/14/circular-queue/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/14/bubble-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/programming/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/14/stack-for-int-type/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/pathological-data/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/14/quick-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/14/radix-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/14/merge-sort/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/07/fibonacci-triangular-square-cube/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/07/array-of-0-and-1-put-0-at-even-position/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/06/anagram-program-implentation/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/05/finding-whether-2-arrays-are/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/05/c-program-to-convert-decimal-number/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/05/binary-search-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/05/gcd-of-2-integers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/05/given-array-of-n-integers-from-1-to-n/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/integer-series/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/04/data-structures-interview-questions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/03/basic-mathematics-in-algorithms/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/03/given-list-of-n-numbers-from-1-to-n-1/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/ctricks/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/03/give-fast-way-to-multiply-number-by-7/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/03/bresenhams-circle-algorithm/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/graphics/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/03/line-drawing-algorithms/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/03/routine-to-draw-circle-x-2-y-2-r-2/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/03/reversing-number/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/03/to-reverse-bits-in-interger/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/03/check-if-20th-bit-of-32-bit-integer-is/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2010/01/03/c-program-to-count-bits-set-in-integer/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/beautiful-codes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/12/c-program-without-main/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/09/basic-interview-questions-on-networking/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/09/various-software-model/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/08/left-most-n-digits-divisible-by-n/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/library-functions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/08/mathh/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/what-is-least-number-of-links-you-can/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/cts-aptitude-question-paperyellow-comments/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/cts-aptitude-question-paperyellow/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/cts-aptitude-question-paperyellow_7/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/psychometry-test/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/psychometry-test/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/learn-some-words/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/vocab/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/focus-on-word/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/questions-on-various-topics/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/verbal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/verbal-questions-2/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/verbal-questions-mixture-of-words/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/file-handling-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/random-number-generation/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/general-utilities/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/predefined-values-in-headers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/error-handling/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/random-access-functions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/file-handling-in-cpp/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/endianness/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/using-pointers-to-break-into-bytes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/ifdef-endif/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/preprocessor/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/07/sizeof-operator/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/const-functions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/keyword/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/pascal/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/06/using-pascal-keyword/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/06/ratio-and-proportion-difficult-questions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/06/ratio-and-proportion-difficult/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/06/problems-on-partnership/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/aptitudeconcepts/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/06/time-and-distance-questions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/06/trains/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/cram-it/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/06/multiplication-tables/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/06/find-all-sets-of-consecutive-integers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/progression/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/06/smallest-no-such-that-if-its-rightmost/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/06/sum-of-last-digit-sum-of-rest-digits/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/what-is-void-pointer-why-cant-we/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/program-to-check-if-stack-grows-up-or/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/how-can-we-sum-digits-of-given-number/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/to-swap-two-nibbles-in-byte/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/what-is-null-pointer-how-is-it/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/to-check-whether-string-is-pallindrome/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/program-to-print-numbers-from-1-to-100/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/c-code-to-check-if-integer-is-power-of/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/how-does-free-works/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/pointer-indirection-and-member-operator/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/given-two-strings-and-b-how-would-you/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/whats-difference-between-const-char-p/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/syntax-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/access-non-const-member-varible-inside/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/const/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/how-to-add-two-numbers-without-using/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/what-are-common-causes-of-pointer-bugs/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/what-is-difference-between-malloc-and/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/c-progam-to-convert-from-decimal-to-any/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/c-code-to-dynamically-allocate-one-two/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/what-is-dangling-pointer-what-are/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/write-program-to-add-two-long-positive/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/how-to-find-out-if-machine-is-32-bit-or/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/operator-precedence-in-c-cpp/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/05/whats-database-normalization/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/04/whats-rdbms/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/04/types-of-databases/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/04/what-is-database/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/04/acronyms-used-in-operating-system/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/04/range-of-datatypes-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/04/extern-keyword/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/linkage/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/scoping/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/define/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/04/using-in-define/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/functions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/04/return-values-of-some-functions-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/04/preprocessor-directives-can-be/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/03/given-rectangular-cuboidal-for-puritans/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/logical-questions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/exceptions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/good-practice/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/goto/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/03/how-does-throwing-and-catching/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/03/what-is-difference-between-goto-and/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/03/besides-communication-cost-what-is/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/confused/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/03/given-eight-bit-bitmap-graphics-file/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/03/given-time-devise-algorithm-to/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/03/efficient-code-for-extracting-unique/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/03/given-only-putchar-no-sprintf-itoa-etc/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/03/some-macros/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/12/03/using-define-without-assigning-value/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/11/28/to-determine-whether-machine-is-little/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/11/27/pow-function/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/macro/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/11/27/swapping-2-variables-using-macro/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/11/27/swapping-2-variables-without-3rd/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/09/20/3n1-problem/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/coding/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/09/18/jelly-beans/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/09/18/pirates/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/09/18/sum-it-up/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/09/18/palindromes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/09/18/red-marbles-blue-marbles/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/09/18/reverse-string-word-by-word/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/09/17/17-september-solutions/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/number-theoryq/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/09/12/create-copy-of-tree/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/08/30/tree1h-fully-updated/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/08/29/deleting-node/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/08/28/inorder-successor/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/c-implementation/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/08/28/tree1h/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/06/28/initialising-arrays/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2009/06/27/multi-dimensional-arrays/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/18/string-class-in-cppstandard-cpp-strings/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/18/stack-adt/</loc><lastmod>2020-08-11T09:29:59+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/14/miscellaneous-cases-with-printf/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/14/strings/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/14/method-overriding/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/14/access-specification/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/14/access-in-cpp-classes/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/13/escape-characters-and-printf/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/13/io-in-c/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/08/c-preprocessor/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/07/complicated-declaration/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/07/program-string-class/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/07/pattern-matching-program-using-brute/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/07/program-to-manage-array-of-pointers-to/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/07/program-with-use-of-array-of-pointers/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/07/program-to-manage-2-d-array-of/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/07/program-to-magage-strings/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/07/program-to-multiply-two-polynomials/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/tags/polynomial/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/07/program-to-add-two-polynomials/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/07/program-for-matrix-operations-like/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/07/program-to-perform-operations-like/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/07/program-to-merge-two-1-d-arrays/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/06/arrays/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/2008/08/06/why/</loc><lastmod>2020-08-07T20:23:36+02:00</lastmod></url><url><loc>https://kodeknight.k5kc.com/categories/</loc></url><url><loc>https://kodeknight.k5kc.com/tags/special-nos./</loc></url></urlset>