技术控

    今日:4| 主题:49488
收藏本版 (1)
最新软件应用技术尽在掌握

[其他] Kuliza Interview Experience | Set 4 (On-Campus)

[复制链接]
嫉妒恨 发表于 2016-10-8 21:44:24
122 1

立即注册CoLaBug.com会员,免费获得投稿人的专业资料,享用更多功能,玩转个人品牌!

您需要 登录 才可以下载或查看,没有帐号?立即注册

x
Recently kuliza technology conducted interview at NIT campus . The company did not come to campus , they took interview through skype and hangouts .
    First roundconsists of 15 mathematics and basic English + aptitude questions . relatively simple.   
    Then there is 2 coding questions , one related to seating arrangement of boys and girls . Test was on hackerrank and total time was 1 hour .(Timing would be an issue , apti+coding in 1 hour ).
    They shortlisted almost 13 students .
    1st round interview   
    It was scheduled in skype , but that was not working in college network , so they have done it in phone + coding through skype chat.
      1) Deeply about project
    2) connections , questions about java script and database .
    3) Future enhancements about projects , (suggestions from interviewer) .
    4)Algorithm to find smallest element in infinitely long array(use partition , based on binary search) .
    5) One problem based coding question (send code through skype chat) .
    They shortlisted 7 out of 13 .
    2nd round( via Hangouts)   
    1) Project questions
    2) Vertical printing of binary tree .
    3) One dynamic programming question, kind of more difficult, i approached through brute force, tried 3 different approaches, brain fusing problem that was :-). (Refer geeksforgeeks for DP, Later i found solution from geeks)
    4) About company
    5) multi programming and threading
    6) Ajax
    Then they selected 3 candidates, they gave confirmation in next day and offer letter in that weekend !!!
  (Make your algorithms and data structures strong, try in a nice way even if you aren’t aware about solution , be confident and cool,    refer geeksforgeeks for everything) .  
  If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to [email protected] See your article appearing on the GeeksforGeeks main page and help other Geeks.
友荐云推荐




上一篇:HTTP/2 基本帧说明
下一篇:Find all reachable nodes from every node present in a given set
酷辣虫提示酷辣虫禁止发表任何与中华人民共和国法律有抵触的内容!所有内容由用户发布,并不代表酷辣虫的观点,酷辣虫无法对用户发布内容真实性提供任何的保证,请自行验证并承担风险与后果。如您有版权、违规等问题,请通过"联系我们"或"违规举报"告知我们处理。

fjku2oJa 发表于 2016-10-9 00:09:36
嫉妒恨表述之事与本人无关,只是本着“看贴回贴,繁荣网络、利人利己”的原则
回复 支持 反对

使用道具 举报

*滑动验证:
您需要登录后才可以回帖 登录 | 立即注册

本版积分规则

我要投稿

推荐阅读

扫码访问 @iTTTTT瑞翔 的微博
回页顶回复上一篇下一篇回列表手机版
手机版/CoLaBug.com ( 粤ICP备05003221号 | 文网文[2010]257号 )|网站地图 酷辣虫

© 2001-2016 Comsenz Inc. Design: Dean. DiscuzFans.

返回顶部 返回列表