You are given an m x n integer matrix matrix with the following two properties Each row is sorted in non-decreasing order. The first integer of each row is greater than the last integer of the previous Given an integer target, return true if target is in matrix or false otherwise You must write a solution in O(log(m * n)) time complexity. Input: matrix = [ 11,3, 5, 7], [10,11,16,20], [23,30,34,60]], target =3 Output: true
Time complexity of my solutions.
What is difference btw ETL and ELT?
Oops,Collections, java8,string array,Microservices, Springboot Besic concept
simple app. for simulating stock market
Basic Nodejs questions , What is XSS , basic Database questions and git. Many react questions , Whats is Hoisting , stale states , ...etc
Introduction about yourself and some coding questions.
First Round was for around 30 mins , basic java / Spring boot questions , asked to write one simple code. Second round level was moderate level , asked project related questions and given a coding problem
Write a SQL query to Fetch the second highest value in a Table.
Explain oops concepts? What is static? What is multithreading? Custom exception syntax, Collection hierarchy, Mist important internal working of Hashmap? (refer to javatpoint) Sql queris simple,
Viewing 2491 - 2500 interview questions