neshg
BAN USER
Questions (6)
Reputation 60
- 1of 1 vote
AnswersYou have an array containing n integers. Find a triplet a,b,c st a < b < c and a appears before b and b before c in the array. Suggest a solution with complexity less than O(n2)
- neshg in India| Report Duplicate | Flag | PURGE
Walmart Labs Developer Program Engineer Algorithm - 0of 0 votes
AnswersHow would you merge two binary search tree's ?
- neshg in India
O(n) solution
Gave them a soln to do inorder traversal for both trees and merge the two sorted lists and create a tree out of the new list| Report Duplicate | Flag | PURGE
Walmart Labs Developer Program Engineer Algorithm - 0of 0 votes
AnswersAre all the system calls interfaced in glibc ?
- neshg in India| Report Duplicate | Flag | PURGE
Operating System - 0of 0 votes
AnswersWhich is better to use - binary semaphore or mutex
- neshg in India| Report Duplicate | Flag | PURGE
Operating System - 1of 1 vote
AnswersWhat is the difference between kill-6 and kill -9
- neshg in India| Report Duplicate | Flag | PURGE
Linux Kernel
Page:
1
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.