Repository with resources to prepare for coding interviews
Leetcode解题、剑指offer第二版💪💪💪⛷😀
剑指offer Java代码 部分Go
This repository contains all the algorithms implementation & problems solution, assignment solution, Interview question solution & other related materials (Slides, Resources) related to Princeton University algorithms Part I & II course at COURSERA
剑指offer CodingInterview | Solutions to the book <Coding Interviews> with Java.《剑指offer—名企面试官精讲典型编程题》面试题目的Java实现。
solution of codinginterview
Sudden JavaScript Interview? Quickly Revise Key Topics for Interview Prep. Complex concepts explained simply and concisely. 🎁
Online IDE to help you grind LeetCode & crack the coding interview.
Coding interview questions
This is a solution to a competitive coding question that's said to have appeared in a Google coding interview.
Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.
Add a description, image, and links to the codinginterview topic page so that developers can more easily learn about it.
To associate your repository with the codinginterview topic, visit your repo's landing page and select "manage topics."