Mock iOS Facebook Interview 2020 - Software Engineer

[@deerdeer4071]

try checking the "move zeros to front" with the array [0, 7, 0]

[@SerJG]

Thank you for the video and sharing this information. As for your method that should return an array with all zeros in the beginning of it: In case when array has already zero in the beginning it will swap it to the end e.g. 0, 1, 2, 3, 4 and results of function will be 4, 1, 2, 3, 0

[@iOSAcademy]

Good catch - I actually noticed this after uploading. The solution would be to run a while loop to move the front index inward until a non 0 is found.

[@Ryan-sr9zv]

Swift 5 ... Just removeAll(where:) O(n), take the counts before and after O(2), and then append the filtered array O(1) to an array of zeros O(zeros)? Easier to maintain, less iteration.

[@christopherliudahl-rackley9108]

FINALLY something in Objective-C! Please do more in Objective-C!

[@iOSAcademy]

Coming soon

[@venkateswarid8231]

Thank u..do more for beginners coding questions in interview

[@iOSAcademy]

Coming soon

[@Oscar-ig2gm]

I think the solution for first question was wrong, but I liked your video ;)

[@ZAP1able]

What a chance! I am looking for algorithms and data structures with swift videos and I said almost I found one but it is objc

[@iOSAcademy]

Don’t worry, I will be adding more in Swift

[@MrMarat24]

I think that for "Return whether or not it contains the UIView" you could have used just a while loop that runs on while(targetView != nil) { if(targetView == view || view == [targetView superView]) { return YES; } targetView = [targetView superView]; } without recursion. this solution should solve it in O(logn) while your solution works in o(n)

[@franciselias1381]

swift solution for first question: func zerosHandler (_ array : [Int]) -> (Int, [Int]) { var counter = 0 var newArray = [Int]() for eachValue in array { if eachValue == 0 { counter += 1 newArray.insert(eachValue, at: 0) } else { newArray.append(eachValue) } } return (counter, newArray) }

[@iOSAcademy]

Also a great solution! Thanks for sharing

[@shynggyssaparbek2209]

Doen't insert works in O(N). Your solution would be O(N ^ 2) then

[@franciselias1381]

@@shynggyssaparbek2209 the point of this comment was to show that you can return multiple values from one func in swift. Inserting at row 0 does cost o(n) time since it shifts all elements which would make this algo run at o(n^2). A simple dictionary/hashmap could make this run o(n)..

[@amitnaskar1497]

Thank you for making this video. Do you provide any session on ios interview?

[@iOSAcademy]

You're welcome! And yes! I do 1 on 1 and I also have a whole program for interviewing coming soon. Dm me on instagram @frazzyfraz

[@amitnaskar1497]

@@iOSAcademy I sent the request, please accept and I messaged you on LinkedIn. Please let me know if we can speak on iOS interview program. Thanks!

[@sarojtiwari2496]

Your videos are very informative. Also can you share the code for the second question in swift

[@iOSAcademy]

Glad you like them! Sure, I plan to do mock interviews in swift as well!

[@vijaytholpadis]

I happened to solve it in Swift. Hope it helps. ------ func checkFor(_ view: UIView, in initialNode: UIView) -> UIView? { //Base case if initialNode.subviews.isEmpty { if initialNode == view { return initialNode.superview } } for i in 0..

[@MrTalhakhan01]

Aren't these very basic tests for a company like Facebook?

[@iOSAcademy]

Yes

[@JoffreyB]

You don't need to zoom in like 10000000x, it's hard to see the whole code structure when you zoom into 1 line of code. Please do take note of that. Great video!

[@iOSAcademy]

Thanks for the feedback!

[@cuevas714]

Awesome video ! Just subscribed :)

[@iOSAcademy]

Glad you liked it!

[@pallaviligade5398]

Do we need to write testcase for this type small Question. Also If there are any 1 hr task e.g API Parsing etc then do we need to write test case.

[@HaggleLad]

You recommend testing your solution but don't Facebook use Coderpad with execution *disabled* (in 2020), so that's not possible right?

[@trs_4612]

funky question, guys. i legit don't know if you are an iOS Developer then you will interview using swift? i'm not familiar with the language. why i can't picture it is because given the nature of the interviews like loops, DS, and algorithm, i can't picture using swift for that.

[@iOSAcademy]

You can use swift or objc

[@trs_4612]

@@iOSAcademy thank you. i will do some more digging. i just switched from grinding leetcode using Python to iOS interviews.

[@sheldon94666]

It would be wrong if there is a nil nsnumber in that areay

[@iOSAcademy]

Correct

[@vijaytholpadis]

Thanks for the video. I solved the "Bringing zeros to the front" problem in the following way in Swift. It also retains the order of other elements. Time complexity: O(n) ---------- func bringZerosToTheFront(_ array: inout [Int]) { var countIndex = array.count - 1 let arrayLength = array.count for i in (0..

[@iOSAcademy]

Nice! Great solution

[@42ALR42]

In a more Swifty way I would do a reorder function like this : func reArrangeArray(input: inout Array, indexDelete: Int, indexInsert: Int) -> Array { let reArrangedItem = input.remove(at: indexDelete) input.insert(reArrangedItem, at: indexInsert) return input } An then the method to use it func reorder() { var arrCopy = arr arrCopy.enumerated().forEach { (index , item) in if item == 0 { reArrangeArray(input: &arrCopy, indexDelete: index, indexInsert: 0) } } print(arrCopy) }

[@mike_zander]

Hey great video! Even though Facebook uses Obj-C, can you use swift for these domain specific questions??

[@iOSAcademy]

Yes you can! I personally did a few years back ;)

[@abdulrahim46]

Thanks. Keep up the good work!

[@iOSAcademy]

thanks!

[@AnkitSoni30]

thanks for the video..

[@SWATversion3]

Your move zeros to front will not work if the array starts with 0 or a series of zeros. This solution will get you disqualified.

[@Денис-ж3ф5р]

Objective c ++ ?

[@iOSAcademy]

You can use that or objc