Daily Coding Problem

Updated: Oct 10, 2019

Get Daily Practice Problems for your upcoming interview.


Your Daily Dose #1

Write a program to determine whether an input string x is a substring of another input string y.

(For example, “bat" is a substring of “abate”, but not of "beat".)




Your Daily Dose #2

Describe a design for a text editor. Describe the classes, interfaces, and so on that you would use and how you would organize them.



Bonus Problem

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million.



Your Daily Dose #3

Implement a queue with 2 stacks. Your queue should have an enqueue and a dequeue method and it should be "first in first out" (FIFO). Optimize for the time cost of mm calls on your queue. These can be any mix of enqueue and dequeue calls. Assume you already have a stack implementation and it gives O(1)O(1) time push and pop.


Your Daily Dose #4

Reverse an array in place in Java?




Generally asked in Interview

Find the missing number in a given integer array of 1 to 100?


Your Daily Dose #5

You are given an array of integers. Return the largest product that can be made by multiplying any 3 integers in the array.

Example: [-4, -4, 2, 8] should return 128 as the largest product can be made by multiplying -4 * -4 * 8 = 128.


Your Daily Dose #6

Find the most optimal way (memory space wise) to store text, and implement it.


#codingInterviewProblem #codingProblem #interviewProblem #DailyPracticeProblem #interview #CodingChallenge

CONTACT

INFO

D Block, United College of Engineering and Research, Naini, Allahabad. 

211009

© 2023 SAN FRAN SUPERHUNT. PROUDLY CREATED WITH WIX.COM