Working at Hike | Glassdoor.com.au

Hike Overview

New Delhi (India)
51 to 200 employees
2012
Company - Private
Internet
Unknown / Non-Applicable
Facebook, Google, WhatsApp
We're the fastest growing messaging app in India with over 35 Million Users. As of Aug'14, we're handling over 10 Billion messages per month.

We're still an extremely young company, less ... Read more

Mission: Our goal is to bring india online by building through messaging. In a country where 1 billion people will come on to the internet mobile first on a low-end smartphone and 2G/pre-paid data, we believe messaging can become a highway to the internet.

Hike Reviews

4.4
StarStarStarStarStar
Rating TrendsRating Trends
Recommend to a friend
Approve of CEO
Hike Founder and CEO Kavin Bharti Mittal
Kavin Bharti Mittal
170 Ratings
  • "Software Development Engineer"

    StarStarStarStarStar
    • Work/Life Balance
    • Culture & Values
    • Career Opportunities
    • Comp & Benefits
    • Senior Management
    Current Employee - Software Development Engineer in New Delhi (India)
    Current Employee - Software Development Engineer in New Delhi (India)
    Recommends
    Positive Outlook
    Approves of CEO

    I have been working at Hike full-time (Less than a year)

    Pros

    Great Opportunities, Smart and Helpful Colleagues, World-class office space, Free Lunch and Snacks, Cutting edge tech, Motivated bunch of people, Nice Pay

    Cons

    None that I can think of.

    Advice to Management

    Keep it up!

See All 203 Reviews

Hike Photos

Hike photo of: Welcome to Hike office!
Hike photo of: ZeroTo2 Hiring Drive
Hike photo of: ZeroTo2 Hiring Drive
Hike photo of: ZeroTo2 Hiring Drive
Hike photo of: ZeroTo2 Hiring Drive
Hike photo of: ZeroTo2 Hiring Drive
See All PhotosSee All

Hike Interviews

Experience

Experience
50%
11%
39%

Getting an Interview

Getting an Interview
30%
30%
15%
15
5
5

Difficulty

3.5
Average

Difficulty

Hard
Average
Easy
  1. Helpful (11)  

    Software Engineer Interview

    Anonymous Interview Candidate
    No Offer

    Application

    I applied through college or university. The process took 1 day. I interviewed at Hike.

    Interview

    First Round Written Test
    3 sections in all. To be done in 90 minutes
    Section A: – 10 aptitude questions (you can find almost every question on indiabix).
    Section B: – 13 questions based on C skills.
    Section C: – 2 programming questions which were easy.

    1) Reverse every K nodes in a singly linked list.

    2) Find out the next greater element having same digits.

        1432 -> 2134
        5432 -> no greater number
    First Technical Interview
    The interviewer was quite cool and composed.
    1 He started with simple question and asked me to write the code of Quick sort but before I could start he said leave it and tell me how you will find out 3rd smallest element from an array.

    2. Based on first Question, rather than an array you have a large file containing billions of number and from it you have to print Kth minimum element.

    3. A file containing billion of numbers in unsorted manner is given to you. At run time you will be given two integers ‘m’ and ‘n’. Now print all the numbers from file which lies in this range. He said u can use extra space, no problem with memory but time complexity should be minimum.

    4. This question was new to me. He told me let’s play a game. I said okay sir :). In this game we will be given even number of cards. Each card will be having some digit written over it. Now both player will play optimally and can only choose card from either corner. He asked me to devise a strategy which would help me winning the game always.
    Later he asked me to prove my strategy for the general case :)

    Second Technical Interview
    Interviewer asked me about chess, rules of chess and all
    1. He started with Knight Tour problem in which I have to print the path. Conditions were
    I have to cover all the blocks in chess. I can use only 63 moves and solution must be other than backtracking.(most optimal solution). He wanted me to tell him the strategy required to prune the recursion tree.

    2. Given a file which contains large number of strings.
    e.g.:my name is XYZ. My emansi XYZ
    i.e. it has words and reverse of words. There can be the case where no reverse word is present
           He told me to print all those pair whose reverse is also present in the file.
           For above example output will be:
           {name,eman}, {is, si}
           Constraints were Minimum space should be used and time complexity should be minimum
           further he added don’t compute reverse of string at all.
    (He was interested in function which I will use to calculate the hash value of string).

    3. He asked me what my weak point in coding is. I said finding out the corner test cases. At this he caught me and said let see how you will face your fear and give me a code and asked me to generate all the test cases for the program.

    Later he asked me to write code for printing a helix (spiral matrix)
    and write all corner test cases for it.
    I wrote solution for NxN but he asked me to write for NxMand do dry run for several test cases.
    That is how second round went ?

    Third Technical Interview
    The interviewer was a bit strict.

    In this round only single Question was asked but it took almost 1 hour.
    He asked do you know spell checker in micro soft word. I said yes.

    He said, you have newspapers of last 20 years. Use these newspapers and suggest most probable words.

    He gave me example
    Input: fon
    for this input print
    Output: foe, for, fork, fond

    Question seemed easy but when I started he kept adding constraints on data structures used and complexity.

    I used lexicographical dictionary for this but later he added two more example
    he asked me to suggest ‘con’ and ‘ion’ as most probable word for fon.

    Later he added another example
    Browser
    Bsowerr

    He said suggest browser for ‘Bsowerr’.

    He kept adding examples and constraints.
    My solution started from lexicographical dictionary moved to Trie Tree then to Edit Distance problem then Hashing

    He said why I gave you newspapers rather than Dictionary. From this I got smell of Machine learning
    He wanted me to suggest on the basis of currently most frequently used words.

    And the Question got more complex
    and it ended on SUFFIX TREE.

    HR round
    It was telephonic round taken by the CEO of the company and asked me all HR related Questions

    It was a good experience.

    Interview Questions

    • He said, you have newspapers of last 20 years. Use these newspapers and suggest most probable words.   Answer Question
See All 21 Interviews

Hike Awards & Accolades

  • 38th Most Exciting Brand of India, Economic Times, Brand Equity, 2015
  • BT Coolest Start-ups, Business Today, 2016
See More

Work at Hike? Share Your Experiences

Hike
  • Star
  • Star
  • Star
  • Star
  • Star
 
Click to Rate
or