{"id":23726613,"url":"https://github.com/codenkoffee/java-interview-questions","last_synced_at":"2026-02-16T06:30:17.742Z","repository":{"id":203394306,"uuid":"709510069","full_name":"CodeNKoffee/Java-Interview-Questions","owner":"CodeNKoffee","description":null,"archived":false,"fork":false,"pushed_at":"2023-10-24T20:49:05.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-12-31T00:33:46.787Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/CodeNKoffee.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-10-24T20:32:02.000Z","updated_at":"2023-10-24T20:35:07.000Z","dependencies_parsed_at":null,"dependency_job_id":"271ab6f5-4f30-47f7-8421-5b32f9b8318d","html_url":"https://github.com/CodeNKoffee/Java-Interview-Questions","commit_stats":null,"previous_names":["codenkoffee/java-interview-questions"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CodeNKoffee%2FJava-Interview-Questions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CodeNKoffee%2FJava-Interview-Questions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CodeNKoffee%2FJava-Interview-Questions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CodeNKoffee%2FJava-Interview-Questions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/CodeNKoffee","download_url":"https://codeload.github.com/CodeNKoffee/Java-Interview-Questions/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239824980,"owners_count":19703199,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-12-31T00:32:26.675Z","updated_at":"2026-02-16T06:30:17.663Z","avatar_url":"https://github.com/CodeNKoffee.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Java Interview Questions for Top Tech Companies\n\n## Introduction\n\nThis repository contains a collection of interview questions commonly asked by top tech companies in JavaScript-related roles. However, I have transformed these JavaScript questions into their Java implementation. The goal is to help job seekers prepare for technical interviews and land high-paying jobs without a degree. Additionally, this resource can assist college students whose universities use Java for their courses.\n## Questions\n\n### String Manipulation\n\n1. **Reverse String**: Reverse a string.\n2. **Palindrome**: Check if a string is a palindrome.\n3. **Reverse Integer**: Reverse the digits of an integer.\n4. **Stringify ID**: Convert a numeric ID to a string representation.\n5. **Max Character**: Find the character that appears the most in a string.\n6. **Anagrams**: Check if two strings are anagrams of each other.\n7. **Array Chunk**: Split an array into chunked arrays of a specific length.\n8. **Capitalize Sentence**: Capitalize the first letter of each word in a sentence.\n\n### Algorithms and Data Structures\n\n9. **Steps**: Print steps using the # character.\n10. **Pyramid**: Print a pyramid with n levels.\n11. **Concurrency**: Implement concurrency-related problems.\n12. **Stopwatch**: Create a simple stopwatch.\n13. **Pomodoro**: Implement a Pomodoro timer.\n14. **Clock**: Simulate a clock.\n15. **Todo List**: Build a simple to-do list.\n16. **Tic Tac Toe**: Implement the game of Tic Tac Toe.\n\n### Array and Sorting\n\n17. **Two Sum**: Find two numbers in an array that add up to a specific target.\n18. **Contains Dupes**: Check if an array contains any duplicates.\n19. **Max Subarray**: Find the maximum sum of a subarray.\n20. **Two Sorted Sum**: Find two numbers in two sorted arrays that add up to a specific target.\n21. **Stock Trading**: Maximize profit by buying and selling stocks.\n22. **Three Sum**: Find all unique triplets in an array that sum to zero.\n23. **Product Except Self**: Compute the product of all elements except the current one.\n24. **Meeting Times**: Find overlapping meeting times.\n25. **Binary Search**: Implement the binary search algorithm.\n26. **Min Rotated Sorted Array**: Find the minimum element in a rotated sorted array.\n27. **Search Rotated Sorted Array**: Search for a target in a rotated sorted array.\n28. **Container With Most Water**: Find two lines that together with the x-axis forms a container with the most water.\n29. **Flatten Array**: Flatten a nested array.\n30. **Move Zeros**: Move all zeros to the end of an array.\n31. **Sum of Two**: Find two numbers that sum to a specific target.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodenkoffee%2Fjava-interview-questions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcodenkoffee%2Fjava-interview-questions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodenkoffee%2Fjava-interview-questions/lists"}