1.Distinct Digit Numbers
2.Sum of Subarray Problem
3.Minimum Operations to Reorder Items
4.Balanced Array Sum
5.Count Unique Digits within a Range
6.Find the Index of the First Unique Character
7.Optimize Character Movement Instructions
8.Minimum Operations to Make Array Good
9.Count Non-Repeating Character Substrings
10.Code Review
11.Parking Lot System Design
12.Cardinality Sorting
13.Longest Even Length Word
14.Subarray Sum
15.Rearranging a Word
16.Break a Palindrome
17.Object-Oriented Programming (OOP) Concepts
18.Arithmetic Progression Validation
19.How many flips?
20.Ascending Binary Sorting
21.System Design Analysis and Improvement
22.Code Review Improvement
23.Find the Minimum Absolute Difference in an Array
24.Discuss Java Memory Management
25.Explain OOP Concepts
26.Set Conversion Cost
27.Python For Loop Performance
28.Dictionary Key-Value Relationship
29.Algorithm Problem Solving
30.Understanding of Third-Party Library APIs
31.Differences in Coding Approaches
32.Explain the projects listed on your resume
33.Python Data Structures
34.Algorithm Complexity
35.Coordinate Transformation
36.Sum of All Subarrays
37.Fun with Anagrams
38.LeetCode Algorithm Problem
39.Python OOP Concepts
40.Monolithic to Microservices Architecture
41.Find the Pair with the Smallest Difference
42.Design a Flash Sale System
43.Print Fibonacci
44.Understanding React's useEffect Hook
45.Displaying Data with React
46.Minimum Total Cost to Reduce Array by Pair Removals
47.Unique Digits Count
48.Factors of 3 and 5
49.Longest Even Length Word
50.Design an Instagram-like Photo Sharing Service
51.Rearranging a Word to the Next Alphabetically Greater String
52.Is It Possible to Convert a Pair of Integers
53.Longest Even Length Word
54.Minimum Number of Flips to Achieve Target Binary String
55.Is Possible
56.Minimum Number of Flips to Convert Binary String to Target
57.Experience with Generics in Java
58.Experience with Threads in Java
59.Sorting a List of Users by Default
60.LLM Chatbot System Design
61.Balanced Or Not?
62.Is Possible
63.Maximum Sum with Fixed Jump Interval
64.Largest Number by Swapping Digits
65.Array Reduction Algorithm
66.Maximum Number of Pairs Selection
67.Handling Distributed System Issues
68.Distributed Lock Implementation
69.Discuss the complexity of operations in a linked list, including variants like cycles and arbitrary loops, and methods to detect them.
70.Identify three major differences between C++ and Python.
1. Distinct Digit Numbers
Given a range of integers, determine how many numbers have no repeating digits. For example, given the lower bound n=80 and the upper bound m=120, which are inclusive, there are 120-79=41 values in the range. Numbers without repeating characters are normal weight and others are bold. The two columns to the right are the valid number counts per row (normal weight) and invalid number counts (bold). There are 27 numbers with no repeating digits, and 14 other numbers in the range. The task is to implement a function countNumbers that has the following parameter(s): int arr[ ][2]: integer pairs representing inclusive lower (n) and upper (m) range limits.
2. Sum of Subarray Problem
A coding question was asked about the 'sum of subarray'. The approach used was a prefix sum to solve it.
3. Minimum Operations to Reorder Items
Determine the minimum number of operations to reorder the items correctly. For instance, given an array popularity = [1, 3, 4, 2], you can switch 3 and 4 to get popularity' = [4, 3, 1, 2], and then switch 1 and 2 to get [4, 3, 2, 1].
4. Balanced Array Sum
Given an array, find the index of the array element (the pivot), for which the sum of all elements to the left and to the right are equal. The array may not be reordered. For example, consider an array where the sum of the first three elements is 6 and the value of the last element is also 6. Using zero-based indexing, the pivot is the element at index 3. Write the function balancedSum to solve this problem.
5. Count Unique Digits within a Range
Write a function that takes a range of numbers and counts how many numbers within that range are composed of unique digits. For example, 101 is not unique, but 1234 is. The function should print out the count of such unique numbers for each given range.
解锁更多真题，请点此 登录 篱笆帮
高频题（0）
