René's URL Explorer Experiment


Title: GitHub - LeetCode-LintCode-Solutions/interview-techdev-guide: This repository contains curated technical interview questions by fn+geeks community · GitHub

Open Graph Title: GitHub - LeetCode-LintCode-Solutions/interview-techdev-guide: This repository contains curated technical interview questions by fn+geeks community

X Title: GitHub - LeetCode-LintCode-Solutions/interview-techdev-guide: This repository contains curated technical interview questions by fn+geeks community

Description: This repository contains curated technical interview questions by fn+geeks community - LeetCode-LintCode-Solutions/interview-techdev-guide

Open Graph Description: This repository contains curated technical interview questions by fn+geeks community - LeetCode-LintCode-Solutions/interview-techdev-guide

X Description: This repository contains curated technical interview questions by fn+geeks community - LeetCode-LintCode-Solutions/interview-techdev-guide

Mail addresses
support@fnplus.tech

Opengraph URL: https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide

X: @github

direct link

Domain: github.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:9e76ff52-82eb-8cf5-bbf2-6247b8e5abc0
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-idDB66:204E27:A8D4582:AC3A42B:6A50B176
html-safe-nonce12725436546ef01734dc3565faf631e8f44ed483a1e7a07cc7a7ed84de9714f4
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJEQjY2OjIwNEUyNzpBOEQ0NTgyOkFDM0E0MkI6NkE1MEIxNzYiLCJ2aXNpdG9yX2lkIjoiMTM5ODIwNTYxMTE5NjMzMDM1OCIsInJlZ2lvbl9lZGdlIjoic2VhIiwicmVnaW9uX3JlbmRlciI6InNlYSJ9
visitor-hmaca38f08615081f4f05405f9afc71eb077cfe9a9217bf85cb5d0c1d187ed931fd5
hovercard-subject-tagrepository:305026354
github-keyboard-shortcutsrepository,copilot
google-site-verificationApib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-urlhttps://collector.github.com/github/collect
analytics-location//
fb:app_id1401488693436528
apple-itunes-appapp-id=1477376905, app-argument=https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
twitter:imagehttps://opengraph.githubassets.com/8b44d5fec02250c8c35ae66755074f812372eea9173a3e4a0b10eae95bb8fb7a/LeetCode-LintCode-Solutions/interview-techdev-guide
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/8b44d5fec02250c8c35ae66755074f812372eea9173a3e4a0b10eae95bb8fb7a/LeetCode-LintCode-Solutions/interview-techdev-guide
og:image:altThis repository contains curated technical interview questions by fn+geeks community - LeetCode-LintCode-Solutions/interview-techdev-guide
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
Noned6dc8294eb500fa36bbc57472d61fe87c522f9c3c1d64f70f4926f66a66a7efb
turbo-cache-controlno-cache
go-importgithub.com/LeetCode-LintCode-Solutions/interview-techdev-guide git https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide.git
octolytics-dimension-user_id55400758
octolytics-dimension-user_loginLeetCode-LintCode-Solutions
octolytics-dimension-repository_id305026354
octolytics-dimension-repository_nwoLeetCode-LintCode-Solutions/interview-techdev-guide
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forktrue
octolytics-dimension-repository_parent_id212162145
octolytics-dimension-repository_parent_nwofnplus/hacktoberfest-interview-questions
octolytics-dimension-repository_network_root_id212162145
octolytics-dimension-repository_network_root_nwofnplus/hacktoberfest-interview-questions
turbo-body-classeslogged-out env-production page-responsive
disable-turbofalse
browser-stats-urlhttps://api.github.com/_private/browser/stats
browser-errors-urlhttps://api.github.com/_private/browser/errors
release7ac0ad2f2c7e4b9056617355fd9e33e22b0c8df9
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#start-of-content
https://github.com/
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2FLeetCode-LintCode-Solutions%2Finterview-techdev-guide
GitHub CopilotWrite better code with AIhttps://github.com/features/copilot
GitHub Copilot appDirect agents from issue to mergehttps://github.com/features/ai/github-app
MCP RegistryNewIntegrate external toolshttps://github.com/mcp
ActionsAutomate any workflowhttps://github.com/features/actions
CodespacesInstant dev environmentshttps://github.com/features/codespaces
IssuesPlan and track workhttps://github.com/features/issues
Code ReviewManage code changeshttps://github.com/features/code-review
GitHub Advanced SecurityFind and fix vulnerabilitieshttps://github.com/security/advanced-security
Code securitySecure your code as you buildhttps://github.com/security/advanced-security/code-security
Secret protectionStop leaks before they starthttps://github.com/security/advanced-security/secret-protection
Why GitHubhttps://github.com/why-github
Documentationhttps://docs.github.com
Bloghttps://github.blog
Changeloghttps://github.blog/changelog
Marketplacehttps://github.com/marketplace
View all featureshttps://github.com/features
Enterpriseshttps://github.com/enterprise
Small and medium teamshttps://github.com/team
Startupshttps://github.com/enterprise/startups
Nonprofitshttps://github.com/solutions/industry/nonprofits
App Modernizationhttps://github.com/solutions/use-case/app-modernization
DevSecOpshttps://github.com/solutions/use-case/devsecops
DevOpshttps://github.com/solutions/use-case/devops
CI/CDhttps://github.com/solutions/use-case/ci-cd
View all use caseshttps://github.com/solutions/use-case
Healthcarehttps://github.com/solutions/industry/healthcare
Financial serviceshttps://github.com/solutions/industry/financial-services
Manufacturinghttps://github.com/solutions/industry/manufacturing
Governmenthttps://github.com/solutions/industry/government
View all industrieshttps://github.com/solutions/industry
View all solutionshttps://github.com/solutions
AIhttps://github.com/resources/articles?topic=ai
Software Developmenthttps://github.com/resources/articles?topic=software-development
DevOpshttps://github.com/resources/articles?topic=devops
Securityhttps://github.com/resources/articles?topic=security
View all topicshttps://github.com/resources/articles
Customer storieshttps://github.com/customer-stories
Events & webinarshttps://github.com/resources/events
Ebooks & reportshttps://github.com/resources/whitepapers
Business insightshttps://github.com/solutions/executive-insights
GitHub Skillshttps://skills.github.com
Documentationhttps://docs.github.com
Customer supporthttps://support.github.com
Community forumhttps://github.com/orgs/community/discussions
Trust centerhttps://github.com/trust-center
Partnershttps://github.com/partners
View all resourceshttps://github.com/resources
GitHub SponsorsFund open source developershttps://github.com/open-source/sponsors
Security Labhttps://securitylab.github.com
Maintainer Communityhttps://maintainers.github.com
Acceleratorhttps://github.com/open-source/accelerator
GitHub Starshttps://stars.github.com
Archive Programhttps://archiveprogram.github.com
Topicshttps://github.com/topics
Trendinghttps://github.com/trending
Collectionshttps://github.com/collections
Enterprise platformAI-powered developer platformhttps://github.com/enterprise
GitHub Advanced SecurityEnterprise-grade security featureshttps://github.com/security/advanced-security
Copilot for BusinessEnterprise-grade AI featureshttps://github.com/features/copilot/copilot-business
Premium SupportEnterprise-grade 24/7 supporthttps://github.com/enterprise/premium-support
Pricinghttps://github.com/pricing
Search syntax tipshttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
documentationhttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2FLeetCode-LintCode-Solutions%2Finterview-techdev-guide
Sign up https://github.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E&source=header-repo&source_repo=LeetCode-LintCode-Solutions%2Finterview-techdev-guide
Reloadhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
Reloadhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
Reloadhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
Please reload this pagehttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
LeetCode-LintCode-Solutions https://github.com/LeetCode-LintCode-Solutions
interview-techdev-guidehttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
fnplus/hacktoberfest-interview-questionshttps://github.com/fnplus/hacktoberfest-interview-questions
Notifications https://github.com/login?return_to=%2FLeetCode-LintCode-Solutions%2Finterview-techdev-guide
Fork 0 https://github.com/login?return_to=%2FLeetCode-LintCode-Solutions%2Finterview-techdev-guide
Star 0 https://github.com/login?return_to=%2FLeetCode-LintCode-Solutions%2Finterview-techdev-guide
Code https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
Pull requests 0 https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/pulls
Actions https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/actions
Projects https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/projects
Security and quality 0 https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/security
Insights https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/pulse
Code https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
Pull requests https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/pulls
Actions https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/actions
Projects https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/projects
Security and quality https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/security
Insights https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/pulse
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
Brancheshttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/branches
Tagshttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/tags
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/branches
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/tags
983 Commitshttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/commits/master/
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/commits/master/
Algorithmshttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/tree/master/Algorithms
Algorithmshttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/tree/master/Algorithms
Company Specific Interview Questionshttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/tree/master/Company%20Specific%20Interview%20Questions
Company Specific Interview Questionshttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/tree/master/Company%20Specific%20Interview%20Questions
Data Structureshttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/tree/master/Data%20Structures
Data Structureshttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/tree/master/Data%20Structures
.DS_Storehttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/.DS_Store
.DS_Storehttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/.DS_Store
.gitignorehttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/.gitignore
.gitignorehttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/.gitignore
CODE_OF_CONDUCT.mdhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/CODE_OF_CONDUCT.md
CODE_OF_CONDUCT.mdhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/CODE_OF_CONDUCT.md
CONTRIBUTING.mdhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/CONTRIBUTING.md
CONTRIBUTING.mdhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/CONTRIBUTING.md
ClassicalQuestions.mdhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/ClassicalQuestions.md
ClassicalQuestions.mdhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/ClassicalQuestions.md
Factorial.chttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/Factorial.c
Factorial.chttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/Factorial.c
LICENSEhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/LICENSE
LICENSEhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/LICENSE
README.mdhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/README.md
README.mdhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/README.md
READMEhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
Code of conducthttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
Contributinghttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
MIT licensehttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#welcome-to-the-interview-resources-footsteps-by-fnplus-community-to-crack-your-dream-company-octocat
https://camo.githubusercontent.com/ebc0d01c9000a0a38414f237a6b9c9cb41e6ee59f6c5f1623096c3a3ebfb3f7f/68747470733a2f2f692e696d6775722e636f6d2f765131746d32772e676966
HacktoberFest-an event organised by DigitalOceanhttps://hacktoberfest.digitalocean.com/
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#contributors
https://sourcerer.io/fame/xlogix/fnplus/interview-techdev-guide/links/0
https://sourcerer.io/fame/xlogix/fnplus/interview-techdev-guide/links/1
https://sourcerer.io/fame/xlogix/fnplus/interview-techdev-guide/links/2
https://sourcerer.io/fame/xlogix/fnplus/interview-techdev-guide/links/3
https://sourcerer.io/fame/xlogix/fnplus/interview-techdev-guide/links/4
https://sourcerer.io/fame/xlogix/fnplus/interview-techdev-guide/links/5
https://sourcerer.io/fame/xlogix/fnplus/interview-techdev-guide/links/6
https://sourcerer.io/fame/xlogix/fnplus/interview-techdev-guide/links/7
https://github.com/divyhshahhttps://github.com/divyhshah
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#contributing
Commit Messages guidelineshttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/blob/master/CONTRIBUTING.md#write-good-commit-messages
Extended Contributing Guidelineshttps://github.com/fnplus/interview-techdev-guide/issues/151
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#important-data-structures
Dynamic arrayhttps://en.wikipedia.org/wiki/Dynamic_array
Stackhttps://en.wikipedia.org/wiki/Stack_(abstract_data_type)
Singly Linked Listhttps://en.wikipedia.org/wiki/Linked_list
Double Linked Listhttps://en.wikipedia.org/wiki/Doubly_linked_list
Circular Linked Listhttps://en.wikipedia.org/wiki/Linked_list
Hash Tableshttps://en.wikipedia.org/wiki/Hash_table
Heaphttps://en.wikipedia.org/wiki/Heap_(data_structure)
Fibonacci Heapshttps://en.wikipedia.org/wiki/Fibonacci_heap
Disjoints Setshttps://en.wikipedia.org/wiki/Stack_(abstract_data_type)
Adjacency matrixhttps://en.wikipedia.org/wiki/List_of_data_structures#Hash-based_structures
Queuehttps://en.wikipedia.org/wiki/Queue_(abstract_data_type)
Priority Queuehttps://en.wikipedia.org/wiki/Priority_queue
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#important-algorithms
Euclidean GCDhttps://en.wikipedia.org/wiki/Euclidean_algorithm
Fibonacci serieshttps://en.wikipedia.org/wiki/Fibonacci_number
Pallindrome numberhttps://en.wikipedia.org/wiki/Palindromic_number
Perfect numberhttps://en.wikipedia.org/wiki/Perfect_number
Magic numberhttps://en.wikipedia.org/wiki/Magic_number
Polite numberhttps://en.wikipedia.org/wiki/Polite_number
Sieve of Eratostheneshttps://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
Modular exponentiationhttps://en.wikipedia.org/wiki/Modular_exponentiation
QuickSorthttps://en.wikipedia.org/wiki/Quicksort
Merge Sorthttps://en.wikipedia.org/wiki/Merge_sort
Insertion Sorthttps://en.wikipedia.org/wiki/Insertion_sort
Counting Sorthttps://en.wikipedia.org/wiki/Counting_sort
Radix Sorthttps://en.wikipedia.org/wiki/Radix_sort
Bubble Sorthttps://en.wikipedia.org/wiki/Bubble_sort
Heap Sorthttps://en.wikipedia.org/wiki/Heapsort
Selection Sorthttps://en.wikipedia.org/wiki/Selection_sort
Linear Searchhttps://en.wikipedia.org/wiki/Linear_search
Binary Searchhttps://en.wikipedia.org/wiki/Binary_search_algorithm
Pre-Order Traversalhttps://en.wikipedia.org/wiki/Tree_traversal
Post-Order Traversalhttps://en.wikipedia.org/wiki/Tree_traversal
In-Order Traversalhttps://en.wikipedia.org/wiki/Tree_traversal
Binary Search Treehttps://en.wikipedia.org/wiki/Binary_search_tree
Height of the Treehttps://en.wikipedia.org/wiki/Tree_(data_structure)
Depth of the Treehttps://en.wikipedia.org/wiki/Tree_(data_structure)
AVL Treehttps://en.wikipedia.org/wiki/AVL_tree
Spanning Treehttps://en.wikipedia.org/wiki/Spanning_tree
Segment Treehttps://en.wikipedia.org/wiki/Segment_tree
Fenwick Treehttps://en.wikipedia.org/wiki/Fenwick_tree
Triehttps://en.wikipedia.org/wiki/Trie
Breadth First Searchhttps://en.wikipedia.org/wiki/Breadth-first_search
Depth First Searchhttps://en.wikipedia.org/wiki/Depth-first_search
Topological Sorthttps://en.wikipedia.org/wiki/Topological_sorting
Kruskals Algorithmshttps://en.wikipedia.org/wiki/Kruskal%27s_algorithm
Prim's Algorithmshttps://en.wikipedia.org/wiki/Prim%27s_algorithm
Belmon Ford Algorithmshttps://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm
Floyd-Warshall Algorithmhttps://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm
Dijkstra's Algorithmhttps://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
Edit distancehttps://en.wikipedia.org/wiki/Breadth-first_search
Fractional Knapsackhttps://en.wikipedia.org/wiki/Depth-first_search
Longest Increasing Sequencehttps://en.wikipedia.org/wiki/Topological_sorting
Kadane's Algorithmshttps://en.wikipedia.org/wiki/Kruskal%27s_algorithm
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#curated-resources-footsteps-by-fnplus-community
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#coding-practices
LeetCodehttps://leetcode.com/
InterviewBithttps://www.interviewbit.com/
Codilityhttps://codility.com/
HackerRankhttps://www.hackerrank.com/
Project Eulerhttps://projecteuler.net/
Spojhttps://spoj.com/
Google Code Jam practice problemshttps://code.google.com/codejam/contests.html
HackerEarthhttps://www.hackerearth.com/
Top Coderhttps://www.topcoder.com/
CodeChefhttps://www.codechef.com/
Codewarshttps://www.codewars.com/
CodeSignalhttps://codesignal.com
CodeKatahttp://codekata.com/
Firecodehttps://www.firecode.io/
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#video-lectures
UC Berkeley Data Structureshttps://www.youtube.com/watch?v=mFPmKGIrQs4&index=1&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd
MIT Advanced Data Structureshttps://www.youtube.com/watch?v=T0yzrZL1py0&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf&index=1
MIT Introduction to Algorithmshttps://www.youtube.com/watch?v=HtSuA80QTyo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=1
MIT Advanced Algorithmshttps://www.youtube.com/playlist?list=PL6ogFv-ieghdoGKGg2Bik3Gl1glBTEu8c
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#interview-books
Competitive Programming 3 - Steven Halim & Felix Halimhttps://www.amazon.com/Competitive-Programming-3rd-Steven-Halim/dp/B00FG8MNN8
Cracking The Coding Interview - Gayle Laakmann McDowellhttps://www.amazon.com/Cracking-Coding-Interview-Programming-Questions/dp/0984782850/ref=sr_1_1?s=books&ie=UTF8
Cracking The PM Interview - Gayle Laakmann McDowell & Jackie Bavarohttps://www.amazon.com/Cracking-PM-Interview-Product-Technology-ebook/dp/B00ISYMUR6/ref=sr_1_1?s=books&ie=UTF8
Introduction to Algorithms - Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest & Clifford Steinhttps://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844/ref=sr_1_1?ie=UTF8&qid=1490295989&sr=8-1&
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#guides
GeeksForGeeks – A CS portal for geekshttp://www.geeksforgeeks.org/
Learneroo – Algorithmshttps://www.learneroo.com/subjects/8
Top Coder tutorialshttp://www.topcoder.com/tc?d1=tutorials&d2=alg_index&module=Static
Infoarena training pathhttp://www.infoarena.ro/training-path
Increasing the Lower Bound of Programming Contestshttps://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=118
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#courses
Hacking a Google Interviewhttps://courses.csail.mit.edu/iap/interview/materials.php
Coderust 2.0 ($$)https://www.educative.io/collection/5642554087309312/5679846214598656?authorName=Coderust
Interview Cake ($$$)https://www.interviewcake.com/
reviewhttps://www.quora.com/How-helpful-was-the-paid-program-from-Interview-Cake-in-your-interview-preparation
How to Ace the Software Engineering Interview ($$)https://interviewsteps.com/products/how-to-ace-the-software-engineering-interview
Grokking the System Design Interview ($$)https://www.educative.io/collection/5668639101419520/5649050225344512
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#sites
Coding for Interviewshttp://codingforinterviews.com/
Career Cuphttps://www.careercup.com/
HiredInTechhttps://www.hiredintech.com/
Codelahttps://www.codela.net/
TestDomehttps://www.testdome.com/
FreeCodeCamphttps://www.freecodecamp.com/
Dynamic Programming Practice Problemshttps://people.cs.clemson.edu/~bcdean/dp_practice/
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#videos
How to: Work at Google – Candidate Coaching Session for Technical Interviewing [45:45]https://www.youtube.com/watch?v=oWbUtlUhwa8
Cracking the Coding Interview [1:14:24]https://www.youtube.com/watch?v=rEJzOhC5ZtQ
Cracking the Coding Interview (examples) [9:05]https://www.youtube.com/watch?v=aClxtDcdpsQ
Google Recruiters Share Technical Interview Tips [31:06]https://www.youtube.com/watch?v=qc1owf2-220
Google Recruiters Share Non-Technical Interview Tips [28:23]https://www.youtube.com/watch?v=DINxNbBOEoI
What I Learned Doing 250 Interviews at Google [1:00:24]https://www.youtube.com/watch?v=r8RxkpUvxK0
How to Get a Job at the Big 4 [42:34]https://www.youtube.com/watch?v=YJZCUhxNCv8
Interview Prep Round 1: Strings, Arrays, Linked Lists [1:12:39]https://www.youtube.com/watch?v=fIpliB-ton8
Rethinking the Developer Career Path [25:03]https://www.youtube.com/watch?v=yIPbE7BssOs
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#system-design
donnemartin/system-design-primerhttps://github.com/donnemartin/system-design-primer
Grokking the System Design Interviewhttps://www.educative.io/courses/grokking-the-system-design-interview
Designing Instagramhttps://www.educative.io/courses/grokking-the-system-design-interview/m2yDVZnQ8lG
binhnguyennus/awesome-scalabilityhttps://github.com/binhnguyennus/awesome-scalability
Rope Sciencehttps://github.com/google/xi-editor/blob/master/doc/rope_science/intro.md
Architecture of Open Source Applicationshttp://aosabook.org/en/index.html
How should I prepare system design questions for Google/Facebook interview?http://www.quora.com/Job-Interviews/How-should-I-prepare-system-design-questions-for-Google-Facebook-Interview
How Good an Estimator Are You?http://blog.codinghorror.com/how-good-an-estimator-are-you/
0xAX/linux-insideshttps://github.com/0xAX/linux-insides
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#computer-science-news
Hacker Newshttps://news.ycombinator.com/
Lobstershttps://lobste.rs/
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#sample-run
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#support
footstepshttps://footsteps.dev
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#notes
https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#authors
Saurav Jaiswalhttps://github.com/sauravjaiswalsj
Abhishek Kumarhttps://www.abhishekkumar.dev
Abhishek Uniyalhttps://github.com/xlogix
bit.ly/fnplusnowhttp://bit.ly/fnplusnow
Readme https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#readme-ov-file
MIT license https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#MIT-1-ov-file
Code of conduct https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#coc-ov-file
Contributing https://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide#contributing-ov-file
Please reload this pagehttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
Activityhttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/activity
Custom propertieshttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/custom-properties
0 forkshttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/forks
Report repository https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2FLeetCode-LintCode-Solutions%2Finterview-techdev-guide&report=LeetCode-LintCode-Solutions+%28user%29
Releaseshttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/releases
Packages 0https://github.com/orgs/LeetCode-LintCode-Solutions/packages?repo_name=interview-techdev-guide
Please reload this pagehttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
Contributorshttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide/graphs/contributors
Please reload this pagehttps://github.com/LeetCode-LintCode-Solutions/interview-techdev-guide
https://github.com
Termshttps://docs.github.com/site-policy/github-terms/github-terms-of-service
Privacyhttps://docs.github.com/site-policy/privacy-policies/github-privacy-statement
Securityhttps://github.com/security
Statushttps://www.githubstatus.com/
Communityhttps://github.community/
Docshttps://docs.github.com/
Contacthttps://support.github.com?tags=dotcom-footer

Viewport: width=device-width

URLs of crawlers that visited me.