logo
  • 首页
  • 去刷题
  • 搜考题
  • 刷面经
  • 开通会员
  • 其他资料
    分科找资料考试题分类面试题分类
登录 注册
Java工程师/专家/架构师

面试题目/Java工程师/专家/架构师/

面试题:Given that you have one string of length N and M small strings of length L. How do you efficiently find the occurrence of each small string in the larger one ?

掌握等级:5 星级

面试题:Let’s say you have to construct Google maps from scratch and guide a person standing on Gateway of India (Mumbai) to India Gate(Delhi). How do you do the same ?

掌握等级:5 星级

面试题:How many lines can be drawn in a 2D plane such that they are equidistant from 3 non-collinear points ?

掌握等级:5 星级

面试题:Given That One of the strings is very very long , and the other one could be of various sizes. Windowing will result in O(N+M) solution but could it be better ? May be NlogM or even better ?

掌握等级:5 星级

面试题:Given two sequences of items, find the items whose absolute number increases or decreases the most when comparing one sequence with the other by reading the sequence only once.

掌握等级:5 星级

面试题:Given a Data Structure having first n integers and next n chars. A = i1 i2 i3 … iN c1 c2 c3 … cN.Write an in-place algorithm to rearrange the elements of the array ass A = i1 c1 i2 c2 … in cn

掌握等级:5 星级

面试题:How do you find out the fifth maximum element in an Binary Search Tree in efficient manner. Note: You should not use use any extra space. i.e sorting Binary Search Tree and storing the results in an array and listing out the fifth element.

掌握等级:5 星级

面试题:How do you put a Binary Search Tree in an array in a efficient manner. Hint :: If the node is stored at the ith position and its children are at 2i and 2i+1(I mean level order wise)Its not the most efficient way.

掌握等级:5 星级

面试题:You are given an array [a1 To an] and we have to construct another array [b1 To bn] where bi = a1*a2*…*an/ai. you are allowed to use only constant space and the time complexity is O(n). No divisions are allowed.

掌握等级:5 星级

面试题:You are given a game of Tic Tac Toe. You have to write a function in which you pass the whole game and name of a player. The function will return whether the player has won the game or not. First you to decide which data structure you will use for the game. You need to tell the algorithm first and then need to write the code. Note: Some position may be blank in the game। So your data structure should consider this condition also.

掌握等级:5 星级

显示 481 - 490 条,共 5466 条

Previousleft1 ... 484950 ... 547Nextright
image
image

手机刷题,爽过刷剧!扫码解锁新知识!

最热门资讯

image

JAVA工程师面试指导--猎头内部资料

阅读数 11891

image

常见面试问题100问!

阅读数 32921

  • logo

您可以在下面这些平台中找到我们,我们会在1-2个工作日内回复。

关于网站
  • 关于我们
  • 意见反馈
  • 使用帮助
  • 免责声明
其他相关
  • 开通会员
  • 友情链接
  • 隐私条款
Copyright © 2020-2023 北京明婉科技有限公司
京ICP备2022017351号-5