[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"project-75770":3},{"id":4,"name":5,"fullName":6,"owner":7,"repo":5,"description":8,"homepage":9,"htmlUrl":10,"language":11,"languages":9,"totalLinesOfCode":9,"stars":12,"forks":13,"watchers":14,"openIssues":15,"contributorsCount":9,"subscribersCount":16,"size":16,"stars1d":17,"stars7d":18,"stars30d":19,"stars90d":16,"forks30d":16,"starsTrendScore":20,"compositeScore":21,"rankGlobal":9,"rankLanguage":9,"license":9,"archived":22,"fork":22,"defaultBranch":23,"hasWiki":22,"hasPages":22,"topics":24,"createdAt":9,"pushedAt":9,"updatedAt":32,"readmeContent":33,"aiSummary":34,"trendingCount":16,"starSnapshotCount":16,"syncStatus":35,"lastSyncTime":36,"discoverSource":37},75770,"Interview_DS_Algo","MAZHARMIK\u002FInterview_DS_Algo","MAZHARMIK","Super Repository for Coding Interview Preperation",null,"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo","C++",4334,1933,53,11,0,172,252,301,516,31.86,false,"main",[25,26,27,28,29,30,31],"interview-ds-algo","coding-interviews","algorithms","algorithms-and-data-structures","companies-list","data-structures","leetcode","2026-06-12 02:03:35","# Repository Name - Interview_DS_Algo\n# My YouTube Channel Name - codestorywithMIK \u003Cimg src=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Fblob\u002Fmaster\u002Ficons8-youtube.gif\"\u002F>\n\n\u003Cimg src=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Fblob\u002Fmaster\u002Fcodestorywithmik.png\" align=\"right\" \u002F> \n🦸🏻‍♂️On a mission to make a Super Repository for Interview Prep for everyone. :checkered_flag: One stop Solution.  \n\u003Cul>\n \u003Cli> Help me by joining my Youtube Channel for this Repository as well + System Design - \u003Ca href=\"https:\u002F\u002Fwww.youtube.com\u002Fchannel\u002FUCaw58edcO3ZqMw76Bvs0kGQ\">Youtube Channel codestorywithMIK\u003C\u002Fa> (**Subscribers** : 90K+ :hearts:) \u003Cimg src=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Fblob\u002Fmaster\u002Ficons8-youtube.gif\"\u002F>  \n \u003Cli>Official Facebook Page - \u003Ca href=\"https:\u002F\u002Fwww.facebook.com\u002Fprofile.php?id=100090524295846\">codestorywithMIK\u003C\u002Fa>\u003C\u002Fli>\n \u003Cli>This repo contains solutions to questions asked in various coding interviews topic wise.\u003C\u002Fli>\n \u003Cli>Every topic will have sub-topics as well to categorize different types\u002Ftechniques.\u003C\u002Fli>\n \u003Cli>At the top of the solutions, you will find the link to the question and also list of the \u003Cstrong>\u003Cem>Companies\u003C\u002Fem>\u003C\u002Fstrong> who have asked the question in interviews.\u003C\u002Fli>\n \u003Cli>So, Look for \u003Cstrong>\u003Cem>COMPANY TAGS\u003C\u002Fem>\u003C\u002Fstrong> above every solution. :dizzy_face:\u003C\u002Fli>\n \u003Cli>:tada:LATEST UPDATE:tada: : \u003Cstrong>\u003Cem>Frequency\u003C\u002Fem>\u003C\u002Fstrong> also added from now onwards. :tada:\u003C\u002Fli>\n \u003Cli>:tada:LATEST UPDATE:tada: : \u003Cstrong>\u003Cem>Video Explanation in HINGLISH \u003C\u002Fem>\u003C\u002Fstrong> by me also added from now onwards. :tada:\u003C\u002Fli>\n \u003Cli> Why I am doing this ? Because knowledge should be free. You don't need to pay for courses. Learn free, share free. PEACE :heartbeat:\u003C\u002Fli>\n \u003Cli> You can join this group on LinkedIn - \u003Ca href=\"https:\u002F\u002Fwww.linkedin.com\u002Fgroups\u002F12559380\u002F\">LinkedIn Page : codestorywithMIK\u003C\u002Fa>\u003C\u002Fli>\n\u003C\u002Ful>\nLatest Update⏰  -  \n\u003Cem>It helped me to crack interviews of \u003Cstrong>\"Microsoft\", \"Tower Research\" and \"Tokopedia\"\u003C\u002Fstrong>. I hope to add more to this list later 🙂\u003C\u002Fem>\n\n![](https:\u002F\u002Fkomarev.com\u002Fghpvc\u002F?username=MAZHARMIK)\n\n\u003C!-- Visitor Count : ![Visitor Count](https:\u002F\u002Fprofile-counter.glitch.me\u002F{MAZHARMIK}\u002Fcount.svg) -->\n \n\u003Ch3>Contents : :pencil:\u003C\u002Fh3>\n\u003Cul>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FTree\">Tree 🌳\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FArrays\"> Arrays :slot_machine:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FMathematical\">Mathematical :straight_ruler:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FHeap\">Heap :warning:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FLinked%20List\">Linked List :link:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FDP\">DP :calendar:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FGraph\">Graph :earth_asia:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FTrie\">Trie 🌳\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FBacktracking\">Backtracking :end:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FStack\">Stack :books:\u003C\u002Fa>\u003C\u002Fli>\n \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FQueue\">Queue :train::train:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FBit_Magic\">Bit_Magic :keycap_ten:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FGreedy\">Greedy :shipit:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FHashMap\">Hash Map :key:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FHashSet\">Hash Set :key:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FRecursion\">Recursion :cyclone:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FSliding%20Window\">Sliding Window :bus:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FDesign\">Design :scissors::triangular_ruler:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002Fstrings\">Strings :bookmark_tabs:\u003C\u002Fa>\u003C\u002Fli>\n  \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FSegment%20Tree\">Segment Tree 🌳\u003C\u002Fa>\u003C\u002Fli>\n \u003Cli>\u003Ca href=\"https:\u002F\u002Fgithub.com\u002FMAZHARMIK\u002FInterview_DS_Algo\u002Ftree\u002Fmaster\u002FLine%20Sweep%20Technique\">Line Sweep Technique 📈\u003C\u002Fa>\u003C\u002Fli>\n\u003C\u002Ful>\n\n\n\n# Contributors\n\n\u003C!-- ALL-CONTRIBUTORS-LIST:START - Do not remove or modify this section -->\n [\u003Cimg src=\"https:\u002F\u002Favatars0.githubusercontent.com\u002Fu\u002F17107752?s=400&v=4\" width=\"100px;\"\u002F>](https:\u002F\u002Fgithub.com\u002FMAZHARMIK)\n\u003C!-- ALL-CONTRIBUTORS-LIST:END -->\n","Interview_DS_Algo 是一个专注于编程面试准备的超级资源库。该项目使用 C++ 语言，涵盖了从树、数组到图等数据结构与算法的多种主题，并为每个问题提供了详细的解决方案及公司标签，帮助用户了解哪些公司在面试中可能会问到这些问题。此外，项目还包含了频率统计和部分问题的 Hinglish 视频讲解，旨在提供一站式的面试准备资料。它非常适合正在准备技术岗位面试的开发者或希望提高自己在数据结构与算法方面能力的学习者使用。",2,"2026-06-11 03:53:19","trending"]