backenddev_ Telegram Gönderileri

https://jsfiddle.net/2qs3aj19/

*$ You need to implement queue using the stack data structure



Solution -> https://jsfiddle.net/3vdwjhga/

Q2 - There are k number of people having N cards each. Every card has a number written on it. All the cards
are then collected and merged together in ascending sorted order. Write a program for the same.

Constraints: time complexity should not be more than : O( n * k * log k)

Sample input:

let a = [1,5,7];

let b = [2,4,6];

let c = [3,8,9];
Solution:- live code https://jsfiddle.net/3qwe0ofc/1/

Q1 - Count all the pairs of a given array satisfying the condition-

(A[i] > A[j] and i < j).

Input - Array = [5,7,1,9,4,10,16]

Sample output: 2

Solution:- live code https://jsfiddle.net/j5po6qeb/

https://topmate.io/backenddev/1454725

try

live code problem also

this type all problems

Backend Interview Problems

200+