Round 2: 1. Duplicate elements deletion without creating new array 2. Optimized Searching algorithm. 1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the array any number of times. 2.Activity lifestyle
Round 3: 1.Oops concepts 2.Oops code 2.About Java Spring 3. Array stack questions 4.Project discussion
Basic of testing and project-based question. Questions about the project did in college.
OA: Semi-basic probability questions. LeetCode easy/hard. Interviews: Mathematical/logical puzzles. LeetCode medium/hard. Low level programming/semi-basic computer architecture questions.
describe the hardest aspect of ____ class (ones your taking)
What is your technical experience?
Whats us a miss-conception that people had about you?
Problem Description: Given a string s representing a basic mathematical expression with non-negative integers and operators (+, -, *, /), evaluate the expression following the standard operator precedence: Multiplication (*) and Division (/) have higher precedence than Addition (+) and Subtraction (-). Division is integer division (truncate towards zero). No parentheses are included. Example: Input: "3+7*7-9/3" Output: 49
Technical interview: * Find a bug in a client-server system in java, * In order to add some feature to the system, do research on the internet between 2 tools and decide which one will be better. * Design how you would add this feature and implement it. Team leader interview: * Design a tiny-url system, includes discussion of implementation details and required tests Group leader interview: * Few simple questions about race condition * Design a CRM (Customer Relationship Management) system
1. Missing number 2. Merge interval 3. Sliding window
Viewing 2501 - 2510 interview questions