kdn251/interviews

This system is a curated repository of algorithmic problem solutions designed to help users prepare for technical interviews. It organizes implementations across multiple platforms, including LeetCode, UVA, and specific company problem sets, alongside classic data structure and algorithmic challenges from 'Cracking the Coding Interview'. The codebase provides concrete Java implementations for a wide range of topics, including arrays, linked lists, trees, dynamic programming, and graph traversal.

Added Java implementations for multiple UVA online judge problems, including AddingReversedNumbers, Ants, ArchaeologistsDilemma, AverageSpeed, BackToIntermediateMath, BasicRemains, BasicallySpeaking, BigMod, BrickGame, CoconutsRevisited, DigitCounting, FactorialFrequenices, FiveHundredFactorial, Friends, GoldbachConjecture, GoogleIsFeelingLucky, HashmatWarriors, HighPrecisionNumber, HighSchoolPhysics, ICanGuessTheDataStructure, IntegerInquiry, and JollyJumpers.

uva · high confidence

Added a collection of Java source files implementing common data structure and algorithmic problems, including string manipulation (e.g., \IsUniqueChars\, \ReplaceSpaces\), linked list operations (\DeleteDups\, \IsPalindrome\), stack/queue implementations (\MyQueue\, \SetOfStacks\), tree and graph algorithms (\CreateBinarySearchTree\, \FindPath\), and recursive/dynamic programming solutions (\EightQueens\, \Staircase\). These files provide concrete implementations for standard interview questions such as checking for palindromes, partitioning linked lists, managing stack capacities, and solving the Towers of Hanoi.

cracking-the-coding-interview · high confidence

The leetcode directory now includes a broad set of new algorithmic solutions, primarily within the array, backtracking, binary-search, and bit-manipulation subdirectories. New additions include dynamic programming and greedy approaches (BestTimeToBuyAndSellStock, MinCostClimbingStairs, MinimumPathSum, MaximumSubarray, UniquePaths), backtracking and recursion patterns (AndroidUnlockPatterns, GenerateParentheses, LetterCombinationsOfAPhoneNumber, Permutations), binary search utilities (FirstBadVersion, GuessNumberHigherOrLower, SquareRootX), and bit manipulation tools (BinaryWatch, CountingBits, HammingDistance). The collection also features data structure implementations (InsertDeleteGetRandomO1), graph and matrix traversal (GameOfLife, SpiralMatrix), and various array manipulation problems (MergeIntervals, Subsets, WordSearch).

leetcode · high confidence

Added new algorithmic problem solutions for multiple companies, including Adobe, Airbnb, Amazon, Apple, and Bloomberg. Each company directory now contains specific implementations for common interview questions such as Two Sum, Valid Parentheses, and Min Stack, providing users with curated practice sets tailored to specific company interview patterns.

company · high confidence

The repository was initialized with essential configuration and documentation files. A \.gitignore\ was added to exclude build artifacts (\/bin/\) and IDE settings (\.idea\). A \LICENSE\ file was added, establishing the project under the MIT License. The \README.md\ and \README-zh-cn.md\ files were created to provide a comprehensive guide to data structures, algorithms, and online practice platforms for technical interviews. Additionally, an \interviews.iml\ file was added to support IntelliJ IDEA project configuration.

(repo-wide) · high confidence

Written by watchdog.canine.dev from the codebase's own history, inside the signed delivery this page is composed from.

• CAI 40 → 44 (+3.2)
• Rubric changed (rubric-2026.08.19 → rubric-2026.09.15) — scores are not directly comparable.

• Code Health 98 → 88 (-9.9)
• Architecture 100 → 100 (+0.0)
• Maturity 26 → 44 (+17.8)
• Readiness 15 → 15 (+0.0)
• Security 100 → 100 (+0.0)

• Dependency hygiene not measured — no supported dependency manifest was read
• Duplicated block (10 lines × 2) (company/google/ShortestDistanceFromAllBuildings.java)
• Duplicated block (11 lines × 2) (company/amazon/LowestCommonAncestorOfABinaryTree.java)
• Duplicated block (11 lines × 2) (company/facebook/ImplementTrie.java)
• Duplicated block (12 lines × 2) (company/google/ExpressionAddOperators.java)
• Duplicated block (13 lines × 2) (company/facebook/ImplementTrie.java)
• Duplicated block (15 lines × 2) (company/facebook/BinaryTreeLevelOrderTraversal.java)
• Duplicated block (17 lines × 2) (company/google/ShortestDistanceFromAllBuildings.java)
• Duplicated block (5 lines × 4) (uva/Friends.java)
• No exposed public API
• complexity unreadable for .java — churn × complexity hotspots could not be measured
• dormant codebase — no living knowledge left to concentrate

• BombEnemy.maxKilledEnemies (cognitive 23) (company/google/BombEnemy.java)
• BombEnemy.maxKilledEnemies (cognitive 23) (leetcode/dynamic-programming/BombEnemy.java)
• CoconutsRevisited.main (cognitive 16) (uva/CoconutsRevisited.java)
• Documentation: no installation or build instructions (README.md)
• Documentation: no usage examples (README.md)
• Duplicated block (10 lines × 2) (company/facebook/IntegerToEnglishWords.java)
• Duplicated block (10 lines × 2) (company/facebook/WordSearch.java)
• Duplicated block (10 lines × 2) (company/google/PacificAtlanticWaterFlow.java)
• Duplicated block (10 lines × 2) (company/linkedin/MaximumProductSubarray.java)
• Duplicated block (10 lines × 2) (company/linkedin/SymmetricTree.java)
• Duplicated block (10 lines × 2) (leetcode/bit-manipulation/CountingBits.java)
• Duplicated block (10 lines × 3) (company/facebook/ExpressionAddOperators.java)
• Duplicated block (10 lines × 3) (company/facebook/RomanToInteger.java)
• Duplicated block (10 lines × 4) (company/amazon/BestTimeToBuyAndSellStock.java)
• Duplicated block (10 lines × 5) (company/amazon/LetterCombinationsOfAPhoneNumber.java)
• Duplicated block (10 lines × 5) (company/amazon/WordBreak.java)
• Duplicated block (10 lines × 6) (company/airbnb/ValidParentheses.java)
• Duplicated block (10–11 lines × 3) (company/facebook/MultiplyStrings.java)
• Duplicated block (11 lines × 2) (company/google/ClosestBinarySearchTreeValue.java)
• Duplicated block (11 lines × 2) (company/google/GeneralizedAbbreviation.java)
• …and 254 more

Written by watchdog.canine.dev from the codebase's own history, inside the signed delivery this page is composed from.

kdn251/interviews was measured the same way every project in this corpus was: the same rubric, at a pinned commit, with the result published in full. Point a surveyor at a repository you know and see whether you agree with it.