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
SQL queries Rest API, Spring Security, Collections- HashMap
Oops,Collections, java8,string array,Microservices, Springboot Besic concept
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
Introduction about yourself and some coding questions.
QUESTIONS ASKED ◾Tell me about yourself. ◾Tell me about Research Work. ◾ What is your favorite data structure? ◾Print a tree in increasing order ◾Spiral Order Traversal of a Tree https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ ◾Reverse Linked List https://leetcode.com/problems/reverse-linked-list/ ◾Reverse nodes in k group in Linked List https://leetcode.com/problems/reverse-nodes-in-k-group/ ◾https://leetcode.com/problems/word-search/ ◾What is advantage Recursion over Iteration.
Basics of Spring MVC
General Questions about past projects and General Interview Questions
how would you cope up with your IT mates as you are from a non IT background? And what makes you think that you have it in you to be competitive with yout IT mates?
concurrent collections, executor framework in multithreading, diff annotation in spring boot, one to one and one to many mapping practical example.
Viewing 2471 - 2480 interview questions