[{"data":1,"prerenderedAt":370},["ShallowReactive",2],{"$f3671w0fr7yxk2":3,"blog-posts-featured":51},[4,14,28,42],{"name":5,"languages":6,"description":10,"homepageUrl":11,"url":12,"stargazerCount":13},"Sen.jl",[7],{"color":8,"name":9},"#a270ba","Julia","A filter aware vector search engine written in Julia","","https:\u002F\u002Fgithub.com\u002F53n90ku\u002FSen.jl",0,{"name":15,"languages":16,"description":26,"homepageUrl":11,"url":27,"stargazerCount":13},"redisclone",[17,20,23],{"color":18,"name":19},"#00ADD8","Go",{"color":21,"name":22},"#384d54","Dockerfile",{"color":24,"name":25},"#427819","Makefile","A light weight in-memory key-value store written in Go","https:\u002F\u002Fgithub.com\u002F53n90ku\u002Fredisclone",{"name":29,"languages":30,"description":40,"homepageUrl":11,"url":41,"stargazerCount":13},"eventhub",[31,34,37],{"color":32,"name":33},"#3178c6","TypeScript",{"color":35,"name":36},"#663399","CSS",{"color":38,"name":39},"#f1e05a","JavaScript","Event management website with role hierarchy and a chatbot powered by groq api made as part of coursework of CS F212","https:\u002F\u002Fgithub.com\u002F53n90ku\u002Feventhub",{"name":43,"languages":44,"description":49,"homepageUrl":11,"url":50,"stargazerCount":13},"dyxn",[45,48],{"color":46,"name":47},"#3572A5","Python",{"color":21,"name":22},"An end to end Agentic Retrieval, Reasoning and Generation Project which specializes in Asynchronously ingesting study material and generating concise latex notes coming with a fully fledged Frontend","https:\u002F\u002Fgithub.com\u002FProdigyOnGithub\u002Fdyxn",[52,287],{"id":53,"title":54,"body":55,"date_created":276,"date_modified":277,"description":278,"extension":279,"featured":280,"head":277,"meta":281,"navigation":280,"ogImage":277,"path":282,"robots":277,"schemaOrg":277,"seo":283,"sitemap":284,"stem":285,"__hash__":286},"content\u002Fblog\u002Fint128.md","int128",{"type":56,"value":57,"toc":273},"minimark",[58,73],[59,60,61,62,65,66,69,70,72],"p",{},"I just found out today that ",[63,64,54],"code",{}," which used as ",[63,67,68],{},"__int128"," exists and like its kind of complicated cin and cout cannot use int128 data type, its not part off cpp, its a complier specific thing but its still amazing i wish cpp had better approaches for integer overflows also its kind of my skill issue but having ",[63,71,54],{}," is a cheat skill ngl your answer for every integer overflow hehe.",[74,75,76,270],"ul",{},[77,78,79,80,180,181],"li",{},"As the name suggests it has values ranging from ",[81,82,85,118],"span",{"className":83},[84],"katex",[81,86,89],{"className":87},[88],"katex-mathml",[90,91,93],"math",{"xmlns":92},"http:\u002F\u002Fwww.w3.org\u002F1998\u002FMath\u002FMathML",[94,95,96,113],"semantics",{},[97,98,99,103],"mrow",{},[100,101,102],"mo",{},"−",[104,105,106,110],"msup",{},[107,108,109],"mn",{},"2",[107,111,112],{},"127",[114,115,117],"annotation",{"encoding":116},"application\u002Fx-tex","-2^{127}",[81,119,123],{"className":120,"ariaHidden":122},[121],"katex-html","true",[81,124,127,132,136],{"className":125},[126],"base",[81,128],{"className":129,"style":131},[130],"strut","height:0.8974em;vertical-align:-0.0833em;",[81,133,102],{"className":134},[135],"mord",[81,137,139,142],{"className":138},[135],[81,140,109],{"className":141},[135],[81,143,146],{"className":144},[145],"msupsub",[81,147,150],{"className":148},[149],"vlist-t",[81,151,154],{"className":152},[153],"vlist-r",[81,155,159],{"className":156,"style":158},[157],"vlist","height:0.8141em;",[81,160,162,167],{"style":161},"top:-3.063em;margin-right:0.05em;",[81,163],{"className":164,"style":166},[165],"pstrut","height:2.7em;",[81,168,174],{"className":169},[170,171,172,173],"sizing","reset-size6","size3","mtight",[81,175,177],{"className":176},[135,173],[81,178,112],{"className":179},[135,173]," to ",[81,182,184,207],{"className":183},[84],[81,185,187],{"className":186},[88],[90,188,189],{"xmlns":92},[94,190,191,204],{},[97,192,193,199,201],{},[104,194,195,197],{},[107,196,109],{},[107,198,112],{},[100,200,102],{},[107,202,203],{},"1",[114,205,206],{"encoding":116},"2^{127}-1",[81,208,210,260],{"className":209,"ariaHidden":122},[121],[81,211,213,216,248,253,257],{"className":212},[126],[81,214],{"className":215,"style":131},[130],[81,217,219,222],{"className":218},[135],[81,220,109],{"className":221},[135],[81,223,225],{"className":224},[145],[81,226,228],{"className":227},[149],[81,229,231],{"className":230},[153],[81,232,234],{"className":233,"style":158},[157],[81,235,236,239],{"style":161},[81,237],{"className":238,"style":166},[165],[81,240,242],{"className":241},[170,171,172,173],[81,243,245],{"className":244},[135,173],[81,246,112],{"className":247},[135,173],[81,249],{"className":250,"style":252},[251],"mspace","margin-right:0.2222em;",[81,254,102],{"className":255},[256],"mbin",[81,258],{"className":259,"style":252},[251],[81,261,263,267],{"className":262},[126],[81,264],{"className":265,"style":266},[130],"height:0.6444em;",[81,268,203],{"className":269},[135],[77,271,272],{},"I think this is a good way to counter overflow issues we ususally have with cpp, it really pmo when i get everything right and its a precision issue or overflow issue",{"title":11,"searchDepth":274,"depth":274,"links":275},2,[],"2026-08-11T12:00:00Z",null,"int overflow issue related","md",true,{},"\u002Fblog\u002Fint128",{"title":54,"description":278},{"loc":282},"blog\u002Fint128","wPL1FQa6NvmljNejUoRfU2aUsHm-kvFtX75nU38E3is",{"id":288,"title":289,"body":290,"date_created":276,"date_modified":277,"description":363,"extension":279,"featured":280,"head":277,"meta":364,"navigation":280,"ogImage":277,"path":365,"robots":277,"schemaOrg":277,"seo":366,"sitemap":367,"stem":368,"__hash__":369},"content\u002Fblog\u002Fmy_thoughts_on_dp.md","DP",{"type":56,"value":291,"toc":361},[292,295,298,315,324,331,334,357],[59,293,294],{},"Dynamic programming is nothing but solving a bigger problem by dividing it into sub tasks and avoiding repitions in those subproblems, storing those  and building the answer from the smaller problems we solved beforehand",[59,296,297],{},"Its simple to think of",[74,299,300,303,306,309,312],{},[77,301,302],{},"Split the problem into overlapping subproblems(one related to the other)",[77,304,305],{},"Solve each problem recursively(means break it into further sub problems, this is it most of the times it may not be recursive at all times)",[77,307,308],{},"Combine the solutions to the subproblems into one for the given problem",[77,310,311],{},"Important rule is that you dont compute the same problem twice because we already have it",[77,313,314],{},"Do remember that we memorize the answers we had gotten i.e, storing them",[316,317,318],"blockquote",{},[59,319,320],{},[321,322,323],"strong",{},"From what i can understand DP can be mainly classified into 5-6 types(it can be more or less, its just my preferred number)",[316,325,326],{},[59,327,328],{},[321,329,330],{},"1-D DP",[59,332,333],{},"Which is like number of ways to write a number using another set of numbers or find the longest increasing or decreasing subsequence something like that i believe, because all these can be done using a single array  of n elements and with optimal time complexities",[74,335,336],{},[77,337,338,339,342,343,346,347,346,350,353,354,356],{},"how to solve them? lets go in",[340,341],"br",{},"For the first one we can do this in O(n) time complexity, the given numbers will be very like like represent x in terms of 1, 3 and 4  we can construct this from base case as number of ways to write 1 is 1 way, like wise nubmer of ways to write 2 using 1 is 1 then we sorted the base case then from this point we can just add no.ofways",[81,344,345],{},"x-1","+no.ofways",[81,348,349],{},"x-3",[81,351,352],{},"n-4"," like this i believe simpe enough to do",[340,355],{},"For the second problem we can do like have an array as a base case where we just have 1 as the longest subsequence as that is the minimum we can have then we will run a double loop to update the values each time we enconter a smaller value we see then output the maxumum value in the array simple.",[358,359,360],"style",{},"\n  body { font-size: 0.9em; } \n",{"title":11,"searchDepth":274,"depth":274,"links":362},[],"dynamic programming",{},"\u002Fblog\u002Fmy_thoughts_on_dp",{"title":289,"description":363},{"loc":365},"blog\u002Fmy_thoughts_on_dp","P1ukIW65VmXUGjdhYmrqYicSXAeCJV9zQqeQwdq5FM4",1786455577264]